./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:27:06,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:27:06,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:27:06,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:27:06,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:27:06,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:27:06,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:27:06,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:27:06,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:27:06,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:27:06,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:27:06,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:27:06,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:27:06,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:27:06,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:27:06,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:27:06,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:27:06,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:27:06,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:27:06,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:27:06,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:27:06,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:27:06,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:27:06,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:27:06,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:27:06,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:27:06,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:27:06,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:27:06,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:27:06,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:27:06,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:27:06,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:27:06,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:27:06,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:27:06,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:27:06,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:27:06,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:27:06,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:27:06,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:27:06,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:27:06,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:27:06,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:27:07,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:27:07,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:27:07,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:27:07,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:27:07,015 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:27:07,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:27:07,016 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:27:07,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:27:07,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:27:07,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:27:07,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:27:07,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:27:07,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:27:07,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:27:07,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:27:07,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:27:07,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:27:07,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:27:07,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:27:07,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:27:07,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:27:07,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:27:07,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:27:07,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:27:07,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:27:07,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:27:07,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:27:07,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:27:07,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d [2019-11-28 00:27:07,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:27:07,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:27:07,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:27:07,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:27:07,425 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:27:07,427 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2019-11-28 00:27:07,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d33ed4f6/d53aeae7ff554411bed186a6cc785bf9/FLAGf86c807b9 [2019-11-28 00:27:08,049 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:27:08,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2019-11-28 00:27:08,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d33ed4f6/d53aeae7ff554411bed186a6cc785bf9/FLAGf86c807b9 [2019-11-28 00:27:08,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d33ed4f6/d53aeae7ff554411bed186a6cc785bf9 [2019-11-28 00:27:08,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:27:08,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:27:08,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:08,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:27:08,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:27:08,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1482558f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08, skipping insertion in model container [2019-11-28 00:27:08,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:27:08,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:27:08,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:08,706 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:27:08,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:08,858 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:27:08,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08 WrapperNode [2019-11-28 00:27:08,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:08,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:08,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:27:08,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:27:08,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:08,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:27:08,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:27:08,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:27:08,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2019-11-28 00:27:08,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:27:08,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:27:08,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:27:08,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:27:08,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 00:27:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:27:09,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:27:09,648 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0; [2019-11-28 00:27:09,648 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1 == ~q_free~0); [2019-11-28 00:27:09,652 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:27:09,653 INFO L297 CfgBuilder]: Removed 70 assume(true) statements. [2019-11-28 00:27:09,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:09 BoogieIcfgContainer [2019-11-28 00:27:09,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:27:09,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:27:09,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:27:09,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:27:09,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:27:08" (1/3) ... [2019-11-28 00:27:09,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67600c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:09, skipping insertion in model container [2019-11-28 00:27:09,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (2/3) ... [2019-11-28 00:27:09,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67600c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:09, skipping insertion in model container [2019-11-28 00:27:09,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:09" (3/3) ... [2019-11-28 00:27:09,664 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2019-11-28 00:27:09,675 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:27:09,684 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 00:27:09,697 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 00:27:09,727 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:27:09,727 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:27:09,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:27:09,728 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:27:09,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:27:09,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:27:09,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:27:09,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:27:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-28 00:27:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:27:09,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:09,761 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] [2019-11-28 00:27:09,761 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:09,769 INFO L82 PathProgramCache]: Analyzing trace with hash -660120607, now seen corresponding path program 1 times [2019-11-28 00:27:09,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:09,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939671062] [2019-11-28 00:27:09,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:09,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939671062] [2019-11-28 00:27:09,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:09,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:09,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615156722] [2019-11-28 00:27:09,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:09,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:10,014 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-11-28 00:27:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:10,169 INFO L93 Difference]: Finished difference Result 377 states and 602 transitions. [2019-11-28 00:27:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:10,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 00:27:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:10,187 INFO L225 Difference]: With dead ends: 377 [2019-11-28 00:27:10,188 INFO L226 Difference]: Without dead ends: 248 [2019-11-28 00:27:10,192 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-11-28 00:27:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-28 00:27:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2019-11-28 00:27:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-28 00:27:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 372 transitions. [2019-11-28 00:27:10,259 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 372 transitions. Word has length 39 [2019-11-28 00:27:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:10,259 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 372 transitions. [2019-11-28 00:27:10,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 372 transitions. [2019-11-28 00:27:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:27:10,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:10,266 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] [2019-11-28 00:27:10,266 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1873516389, now seen corresponding path program 1 times [2019-11-28 00:27:10,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:10,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013422234] [2019-11-28 00:27:10,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:10,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013422234] [2019-11-28 00:27:10,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:10,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:10,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554554983] [2019-11-28 00:27:10,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:10,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:10,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:10,352 INFO L87 Difference]: Start difference. First operand 244 states and 372 transitions. Second operand 3 states. [2019-11-28 00:27:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:10,466 INFO L93 Difference]: Finished difference Result 640 states and 969 transitions. [2019-11-28 00:27:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:10,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 00:27:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:10,471 INFO L225 Difference]: With dead ends: 640 [2019-11-28 00:27:10,471 INFO L226 Difference]: Without dead ends: 416 [2019-11-28 00:27:10,474 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-11-28 00:27:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-28 00:27:10,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2019-11-28 00:27:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-28 00:27:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2019-11-28 00:27:10,526 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 39 [2019-11-28 00:27:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:10,526 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2019-11-28 00:27:10,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2019-11-28 00:27:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 00:27:10,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:10,535 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] [2019-11-28 00:27:10,535 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1793155390, now seen corresponding path program 1 times [2019-11-28 00:27:10,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:10,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843175235] [2019-11-28 00:27:10,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:10,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843175235] [2019-11-28 00:27:10,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:10,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:10,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433215478] [2019-11-28 00:27:10,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:10,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:10,638 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 3 states. [2019-11-28 00:27:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:10,744 INFO L93 Difference]: Finished difference Result 1098 states and 1630 transitions. [2019-11-28 00:27:10,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:10,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-28 00:27:10,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:10,750 INFO L225 Difference]: With dead ends: 1098 [2019-11-28 00:27:10,750 INFO L226 Difference]: Without dead ends: 724 [2019-11-28 00:27:10,753 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-11-28 00:27:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-28 00:27:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-11-28 00:27:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-28 00:27:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1039 transitions. [2019-11-28 00:27:10,802 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1039 transitions. Word has length 40 [2019-11-28 00:27:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:10,802 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1039 transitions. [2019-11-28 00:27:10,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1039 transitions. [2019-11-28 00:27:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 00:27:10,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:10,807 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:27:10,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1344512514, now seen corresponding path program 1 times [2019-11-28 00:27:10,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:10,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326455875] [2019-11-28 00:27:10,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 00:27:10,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326455875] [2019-11-28 00:27:10,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:10,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:10,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853122610] [2019-11-28 00:27:10,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:10,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:10,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:10,862 INFO L87 Difference]: Start difference. First operand 716 states and 1039 transitions. Second operand 3 states. [2019-11-28 00:27:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:10,961 INFO L93 Difference]: Finished difference Result 2127 states and 3084 transitions. [2019-11-28 00:27:10,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:10,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 00:27:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:10,970 INFO L225 Difference]: With dead ends: 2127 [2019-11-28 00:27:10,970 INFO L226 Difference]: Without dead ends: 1427 [2019-11-28 00:27:10,973 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-11-28 00:27:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-11-28 00:27:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1423. [2019-11-28 00:27:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-28 00:27:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2041 transitions. [2019-11-28 00:27:11,043 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2041 transitions. Word has length 53 [2019-11-28 00:27:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:11,043 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 2041 transitions. [2019-11-28 00:27:11,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2041 transitions. [2019-11-28 00:27:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 00:27:11,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:11,047 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:27:11,048 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1321880260, now seen corresponding path program 1 times [2019-11-28 00:27:11,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:11,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256067761] [2019-11-28 00:27:11,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 00:27:11,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256067761] [2019-11-28 00:27:11,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:11,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:11,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760069689] [2019-11-28 00:27:11,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:11,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:11,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:11,105 INFO L87 Difference]: Start difference. First operand 1423 states and 2041 transitions. Second operand 3 states. [2019-11-28 00:27:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:11,251 INFO L93 Difference]: Finished difference Result 4019 states and 5733 transitions. [2019-11-28 00:27:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:11,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 00:27:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:11,266 INFO L225 Difference]: With dead ends: 4019 [2019-11-28 00:27:11,267 INFO L226 Difference]: Without dead ends: 2687 [2019-11-28 00:27:11,270 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-11-28 00:27:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-11-28 00:27:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2683. [2019-11-28 00:27:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2019-11-28 00:27:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3745 transitions. [2019-11-28 00:27:11,414 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3745 transitions. Word has length 53 [2019-11-28 00:27:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:11,415 INFO L462 AbstractCegarLoop]: Abstraction has 2683 states and 3745 transitions. [2019-11-28 00:27:11,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3745 transitions. [2019-11-28 00:27:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 00:27:11,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:11,421 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:27:11,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 669631146, now seen corresponding path program 1 times [2019-11-28 00:27:11,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:11,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18456856] [2019-11-28 00:27:11,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:11,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18456856] [2019-11-28 00:27:11,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:11,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:11,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988239844] [2019-11-28 00:27:11,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:11,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:11,503 INFO L87 Difference]: Start difference. First operand 2683 states and 3745 transitions. Second operand 3 states. [2019-11-28 00:27:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:11,729 INFO L93 Difference]: Finished difference Result 7663 states and 10675 transitions. [2019-11-28 00:27:11,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:11,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-28 00:27:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:11,760 INFO L225 Difference]: With dead ends: 7663 [2019-11-28 00:27:11,760 INFO L226 Difference]: Without dead ends: 5147 [2019-11-28 00:27:11,767 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-11-28 00:27:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2019-11-28 00:27:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 5147. [2019-11-28 00:27:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5147 states. [2019-11-28 00:27:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7065 transitions. [2019-11-28 00:27:12,058 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7065 transitions. Word has length 55 [2019-11-28 00:27:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:12,059 INFO L462 AbstractCegarLoop]: Abstraction has 5147 states and 7065 transitions. [2019-11-28 00:27:12,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7065 transitions. [2019-11-28 00:27:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-28 00:27:12,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:12,075 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:12,075 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1088862051, now seen corresponding path program 1 times [2019-11-28 00:27:12,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:12,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313921928] [2019-11-28 00:27:12,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 00:27:12,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313921928] [2019-11-28 00:27:12,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:12,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:12,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367228444] [2019-11-28 00:27:12,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:12,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:12,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:12,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:12,173 INFO L87 Difference]: Start difference. First operand 5147 states and 7065 transitions. Second operand 3 states. [2019-11-28 00:27:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:12,516 INFO L93 Difference]: Finished difference Result 14819 states and 20413 transitions. [2019-11-28 00:27:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:12,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-28 00:27:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:12,567 INFO L225 Difference]: With dead ends: 14819 [2019-11-28 00:27:12,567 INFO L226 Difference]: Without dead ends: 9983 [2019-11-28 00:27:12,577 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-11-28 00:27:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-11-28 00:27:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9979. [2019-11-28 00:27:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9979 states. [2019-11-28 00:27:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9979 states to 9979 states and 13609 transitions. [2019-11-28 00:27:12,968 INFO L78 Accepts]: Start accepts. Automaton has 9979 states and 13609 transitions. Word has length 96 [2019-11-28 00:27:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:12,968 INFO L462 AbstractCegarLoop]: Abstraction has 9979 states and 13609 transitions. [2019-11-28 00:27:12,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9979 states and 13609 transitions. [2019-11-28 00:27:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-28 00:27:12,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:12,987 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:12,987 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 786050006, now seen corresponding path program 1 times [2019-11-28 00:27:12,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:12,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180848414] [2019-11-28 00:27:12,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:13,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180848414] [2019-11-28 00:27:13,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:13,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:13,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457421878] [2019-11-28 00:27:13,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:13,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:13,063 INFO L87 Difference]: Start difference. First operand 9979 states and 13609 transitions. Second operand 3 states. [2019-11-28 00:27:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:13,481 INFO L93 Difference]: Finished difference Result 14843 states and 20361 transitions. [2019-11-28 00:27:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:13,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-28 00:27:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:13,482 INFO L225 Difference]: With dead ends: 14843 [2019-11-28 00:27:13,483 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:27:13,499 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-11-28 00:27:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:27:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:27:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:27:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:27:13,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2019-11-28 00:27:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:13,500 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:27:13,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:27:13,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:27:13,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:27:15,180 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-28 00:27:15,180 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-28 00:27:15,180 INFO L246 CegarLoopResult]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2019-11-28 00:27:15,181 INFO L242 CegarLoopResult]: At program point L268-1(lines 301 305) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,181 INFO L246 CegarLoopResult]: For program point L301-2(lines 301 305) no Hoare annotation was computed. [2019-11-28 00:27:15,181 INFO L246 CegarLoopResult]: For program point L301-4(lines 300 313) no Hoare annotation was computed. [2019-11-28 00:27:15,181 INFO L246 CegarLoopResult]: For program point L500(lines 500 509) no Hoare annotation was computed. [2019-11-28 00:27:15,181 INFO L242 CegarLoopResult]: At program point L500-1(lines 500 509) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,183 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 00:27:15,183 INFO L246 CegarLoopResult]: For program point L139(lines 139 151) no Hoare annotation was computed. [2019-11-28 00:27:15,184 INFO L242 CegarLoopResult]: At program point L106(lines 84 108) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,185 INFO L242 CegarLoopResult]: At program point L106-1(lines 84 108) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,188 INFO L242 CegarLoopResult]: At program point L106-2(lines 84 108) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,188 INFO L242 CegarLoopResult]: At program point L107(lines 81 109) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,189 INFO L242 CegarLoopResult]: At program point L107-1(lines 81 109) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,189 INFO L242 CegarLoopResult]: At program point L107-2(lines 81 109) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,190 INFO L246 CegarLoopResult]: For program point L405(lines 405 409) no Hoare annotation was computed. [2019-11-28 00:27:15,191 INFO L246 CegarLoopResult]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2019-11-28 00:27:15,237 INFO L246 CegarLoopResult]: For program point L339(lines 339 346) no Hoare annotation was computed. [2019-11-28 00:27:15,237 INFO L242 CegarLoopResult]: At program point L306-1(lines 297 314) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,237 INFO L242 CegarLoopResult]: At program point L339-2(lines 335 350) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,238 INFO L242 CegarLoopResult]: At program point L306-3(lines 297 314) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,238 INFO L246 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-28 00:27:15,238 INFO L246 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-28 00:27:15,238 INFO L246 CegarLoopResult]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2019-11-28 00:27:15,238 INFO L246 CegarLoopResult]: For program point L142(lines 142 150) no Hoare annotation was computed. [2019-11-28 00:27:15,238 INFO L249 CegarLoopResult]: At program point L10-1(lines 188 242) the Hoare annotation is: true [2019-11-28 00:27:15,239 INFO L242 CegarLoopResult]: At program point L143(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,239 INFO L242 CegarLoopResult]: At program point L77(lines 55 79) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,239 INFO L242 CegarLoopResult]: At program point L77-1(lines 55 79) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,239 INFO L242 CegarLoopResult]: At program point L77-2(lines 55 79) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,239 INFO L242 CegarLoopResult]: At program point L441(lines 394 446) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,239 INFO L242 CegarLoopResult]: At program point L78(lines 52 80) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,240 INFO L242 CegarLoopResult]: At program point L78-1(lines 52 80) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,242 INFO L242 CegarLoopResult]: At program point L78-2(lines 52 80) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,242 INFO L242 CegarLoopResult]: At program point L541(lines 525 543) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= 2 ~q_write_ev~0) (<= 2 ~q_read_ev~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,242 INFO L246 CegarLoopResult]: For program point L145(lines 145 149) no Hoare annotation was computed. [2019-11-28 00:27:15,242 INFO L242 CegarLoopResult]: At program point L410(lines 400 440) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,243 INFO L246 CegarLoopResult]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-11-28 00:27:15,243 INFO L246 CegarLoopResult]: For program point L377-2(lines 377 381) no Hoare annotation was computed. [2019-11-28 00:27:15,243 INFO L246 CegarLoopResult]: For program point L377-3(lines 377 381) no Hoare annotation was computed. [2019-11-28 00:27:15,243 INFO L246 CegarLoopResult]: For program point L377-5(lines 377 381) no Hoare annotation was computed. [2019-11-28 00:27:15,243 INFO L246 CegarLoopResult]: For program point L377-6(lines 377 381) no Hoare annotation was computed. [2019-11-28 00:27:15,243 INFO L246 CegarLoopResult]: For program point L377-8(lines 377 381) no Hoare annotation was computed. [2019-11-28 00:27:15,243 INFO L246 CegarLoopResult]: For program point L281(lines 281 291) no Hoare annotation was computed. [2019-11-28 00:27:15,243 INFO L246 CegarLoopResult]: For program point L248(lines 248 254) no Hoare annotation was computed. [2019-11-28 00:27:15,244 INFO L246 CegarLoopResult]: For program point L281-1(lines 281 291) no Hoare annotation was computed. [2019-11-28 00:27:15,244 INFO L242 CegarLoopResult]: At program point L248-1(lines 263 267) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,244 INFO L246 CegarLoopResult]: For program point L281-2(lines 281 291) no Hoare annotation was computed. [2019-11-28 00:27:15,244 INFO L246 CegarLoopResult]: For program point L248-2(lines 248 254) no Hoare annotation was computed. [2019-11-28 00:27:15,244 INFO L242 CegarLoopResult]: At program point L248-3(lines 244 258) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,244 INFO L246 CegarLoopResult]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-11-28 00:27:15,244 INFO L246 CegarLoopResult]: For program point L414(lines 414 421) no Hoare annotation was computed. [2019-11-28 00:27:15,244 INFO L242 CegarLoopResult]: At program point L481-1(lines 315 518) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,245 INFO L246 CegarLoopResult]: For program point L85(lines 85 94) no Hoare annotation was computed. [2019-11-28 00:27:15,245 INFO L246 CegarLoopResult]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2019-11-28 00:27:15,245 INFO L246 CegarLoopResult]: For program point L85-3(lines 85 94) no Hoare annotation was computed. [2019-11-28 00:27:15,245 INFO L246 CegarLoopResult]: For program point L85-5(lines 84 108) no Hoare annotation was computed. [2019-11-28 00:27:15,245 INFO L246 CegarLoopResult]: For program point L85-6(lines 85 94) no Hoare annotation was computed. [2019-11-28 00:27:15,245 INFO L246 CegarLoopResult]: For program point L85-8(lines 84 108) no Hoare annotation was computed. [2019-11-28 00:27:15,245 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 00:27:15,245 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:27:15,246 INFO L246 CegarLoopResult]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-11-28 00:27:15,246 INFO L246 CegarLoopResult]: For program point L86-1(lines 86 91) no Hoare annotation was computed. [2019-11-28 00:27:15,246 INFO L246 CegarLoopResult]: For program point L86-2(lines 86 91) no Hoare annotation was computed. [2019-11-28 00:27:15,246 INFO L246 CegarLoopResult]: For program point L285(lines 285 290) no Hoare annotation was computed. [2019-11-28 00:27:15,246 INFO L246 CegarLoopResult]: For program point L285-1(lines 285 290) no Hoare annotation was computed. [2019-11-28 00:27:15,246 INFO L246 CegarLoopResult]: For program point L285-2(lines 285 290) no Hoare annotation was computed. [2019-11-28 00:27:15,246 INFO L246 CegarLoopResult]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-11-28 00:27:15,246 INFO L242 CegarLoopResult]: At program point L385-2(lines 319 323) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-11-28 00:27:15,247 INFO L246 CegarLoopResult]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2019-11-28 00:27:15,247 INFO L246 CegarLoopResult]: For program point L385-3(lines 385 389) no Hoare annotation was computed. [2019-11-28 00:27:15,247 INFO L242 CegarLoopResult]: At program point L385-5(lines 319 323) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,248 INFO L246 CegarLoopResult]: For program point L319-3(lines 318 331) no Hoare annotation was computed. [2019-11-28 00:27:15,248 INFO L246 CegarLoopResult]: For program point L385-6(lines 385 389) no Hoare annotation was computed. [2019-11-28 00:27:15,248 INFO L242 CegarLoopResult]: At program point L154-1(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,248 INFO L242 CegarLoopResult]: At program point L385-8(lines 355 359) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,248 INFO L246 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-28 00:27:15,248 INFO L246 CegarLoopResult]: For program point L56(lines 56 65) no Hoare annotation was computed. [2019-11-28 00:27:15,248 INFO L246 CegarLoopResult]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2019-11-28 00:27:15,248 INFO L246 CegarLoopResult]: For program point L56-3(lines 56 65) no Hoare annotation was computed. [2019-11-28 00:27:15,249 INFO L246 CegarLoopResult]: For program point L56-5(lines 55 79) no Hoare annotation was computed. [2019-11-28 00:27:15,249 INFO L246 CegarLoopResult]: For program point L56-6(lines 56 65) no Hoare annotation was computed. [2019-11-28 00:27:15,249 INFO L246 CegarLoopResult]: For program point L56-8(lines 55 79) no Hoare annotation was computed. [2019-11-28 00:27:15,249 INFO L249 CegarLoopResult]: At program point L519(lines 466 524) the Hoare annotation is: true [2019-11-28 00:27:15,249 INFO L246 CegarLoopResult]: For program point L189(lines 189 197) no Hoare annotation was computed. [2019-11-28 00:27:15,249 INFO L246 CegarLoopResult]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-11-28 00:27:15,249 INFO L246 CegarLoopResult]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-28 00:27:15,249 INFO L246 CegarLoopResult]: For program point L57-2(lines 57 62) no Hoare annotation was computed. [2019-11-28 00:27:15,250 INFO L249 CegarLoopResult]: At program point L553(lines 544 555) the Hoare annotation is: true [2019-11-28 00:27:15,250 INFO L246 CegarLoopResult]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2019-11-28 00:27:15,250 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:27:15,250 INFO L246 CegarLoopResult]: For program point L455(lines 455 460) no Hoare annotation was computed. [2019-11-28 00:27:15,250 INFO L246 CegarLoopResult]: For program point L224(lines 224 236) no Hoare annotation was computed. [2019-11-28 00:27:15,250 INFO L246 CegarLoopResult]: For program point L26(lines 26 30) no Hoare annotation was computed. [2019-11-28 00:27:15,250 INFO L246 CegarLoopResult]: For program point L26-2(lines 25 40) no Hoare annotation was computed. [2019-11-28 00:27:15,250 INFO L246 CegarLoopResult]: For program point L26-3(lines 26 30) no Hoare annotation was computed. [2019-11-28 00:27:15,251 INFO L246 CegarLoopResult]: For program point L26-5(lines 25 40) no Hoare annotation was computed. [2019-11-28 00:27:15,251 INFO L246 CegarLoopResult]: For program point L225(lines 225 231) no Hoare annotation was computed. [2019-11-28 00:27:15,251 INFO L242 CegarLoopResult]: At program point L324-3(lines 315 332) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,251 INFO L246 CegarLoopResult]: For program point L192(lines 192 196) no Hoare annotation was computed. [2019-11-28 00:27:15,251 INFO L242 CegarLoopResult]: At program point L193(lines 188 242) the Hoare annotation is: false [2019-11-28 00:27:15,251 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:27:15,251 INFO L242 CegarLoopResult]: At program point L425(lines 400 440) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,252 INFO L242 CegarLoopResult]: At program point L293(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,252 INFO L242 CegarLoopResult]: At program point L293-1(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,252 INFO L242 CegarLoopResult]: At program point L293-2(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,252 INFO L242 CegarLoopResult]: At program point L161(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,252 INFO L246 CegarLoopResult]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2019-11-28 00:27:15,252 INFO L246 CegarLoopResult]: For program point L95-3(lines 95 104) no Hoare annotation was computed. [2019-11-28 00:27:15,252 INFO L246 CegarLoopResult]: For program point L95-5(lines 95 104) no Hoare annotation was computed. [2019-11-28 00:27:15,253 INFO L242 CegarLoopResult]: At program point L294(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,253 INFO L242 CegarLoopResult]: At program point L294-1(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,253 INFO L242 CegarLoopResult]: At program point L294-2(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,253 INFO L246 CegarLoopResult]: For program point L96(lines 96 101) no Hoare annotation was computed. [2019-11-28 00:27:15,253 INFO L246 CegarLoopResult]: For program point L96-1(lines 96 101) no Hoare annotation was computed. [2019-11-28 00:27:15,253 INFO L246 CegarLoopResult]: For program point L96-2(lines 96 101) no Hoare annotation was computed. [2019-11-28 00:27:15,253 INFO L246 CegarLoopResult]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2019-11-28 00:27:15,253 INFO L246 CegarLoopResult]: For program point L31-3(lines 31 35) no Hoare annotation was computed. [2019-11-28 00:27:15,254 INFO L246 CegarLoopResult]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2019-11-28 00:27:15,254 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:27:15,254 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-28 00:27:15,254 INFO L242 CegarLoopResult]: At program point L462(lines 451 464) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,254 INFO L246 CegarLoopResult]: For program point L429(lines 429 436) no Hoare annotation was computed. [2019-11-28 00:27:15,254 INFO L246 CegarLoopResult]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2019-11-28 00:27:15,254 INFO L246 CegarLoopResult]: For program point L66-3(lines 66 75) no Hoare annotation was computed. [2019-11-28 00:27:15,255 INFO L246 CegarLoopResult]: For program point L66-5(lines 66 75) no Hoare annotation was computed. [2019-11-28 00:27:15,256 INFO L242 CegarLoopResult]: At program point L463(lines 447 465) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-11-28 00:27:15,256 INFO L246 CegarLoopResult]: For program point L67(lines 67 72) no Hoare annotation was computed. [2019-11-28 00:27:15,256 INFO L246 CegarLoopResult]: For program point L67-1(lines 67 72) no Hoare annotation was computed. [2019-11-28 00:27:15,257 INFO L246 CegarLoopResult]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2019-11-28 00:27:15,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:27:15 BoogieIcfgContainer [2019-11-28 00:27:15,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:27:15,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:27:15,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:27:15,309 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:27:15,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:09" (3/4) ... [2019-11-28 00:27:15,314 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:27:15,332 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:27:15,333 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:27:15,442 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:27:15,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:27:15,445 INFO L168 Benchmark]: Toolchain (without parser) took 7068.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -329.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:15,445 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:15,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:15,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:15,447 INFO L168 Benchmark]: Boogie Preprocessor took 38.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:15,447 INFO L168 Benchmark]: RCFGBuilder took 695.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:15,448 INFO L168 Benchmark]: TraceAbstraction took 5652.40 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -226.7 MB). Peak memory consumption was 452.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:15,448 INFO L168 Benchmark]: Witness Printer took 134.08 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:15,450 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 477.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 695.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5652.40 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -226.7 MB). Peak memory consumption was 452.7 MB. Max. memory is 11.5 GB. * Witness Printer took 134.08 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: ((((p_dw_pc <= 0 && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 466]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((p_dw_pc <= 0 && 0 == p_dw_st) && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 544]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 2 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 1693 SDtfs, 1151 SDslu, 1210 SDs, 0 SdLazy, 147 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9979occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 43 PreInvPairs, 3777 NumberOfFragments, 316 HoareAnnotationTreeSize, 43 FomulaSimplifications, 47557 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 43 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 53124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 81/81 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...