./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/eca-rers2012/Problem01_label00.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 785a7f7444547118219ac2dc565afc7f15fbca51 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:42:43,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:42:43,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:42:43,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:42:43,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:42:43,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:42:43,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:42:43,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:42:43,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:42:43,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:42:43,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:42:43,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:42:43,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:42:43,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:42:43,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:42:43,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:42:43,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:42:43,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:42:43,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:42:43,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:42:43,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:42:43,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:42:43,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:42:43,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:42:43,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:42:43,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:42:43,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:42:43,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:42:43,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:42:43,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:42:43,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:42:43,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:42:43,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:42:43,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:42:43,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:42:43,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:42:43,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:42:43,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:42:43,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:42:43,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:42:43,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:42:43,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:42:43,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:42:43,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:42:43,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:42:43,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:42:43,899 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:42:43,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:42:43,899 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:42:43,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:42:43,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:42:43,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:42:43,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:42:43,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:42:43,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:42:43,901 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:42:43,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:42:43,901 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:42:43,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:42:43,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:42:43,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:42:43,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:42:43,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:42:43,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:42:43,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:42:43,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:42:43,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:42:43,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:42:43,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:42:43,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:42:43,905 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:42:43,905 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 -> 785a7f7444547118219ac2dc565afc7f15fbca51 [2019-11-28 15:42:44,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:42:44,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:42:44,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:42:44,224 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:42:44,225 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:42:44,225 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2019-11-28 15:42:44,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f83b453/228b02f6873843db85271a22349453ca/FLAGf68609c61 [2019-11-28 15:42:44,890 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:42:44,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2019-11-28 15:42:44,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f83b453/228b02f6873843db85271a22349453ca/FLAGf68609c61 [2019-11-28 15:42:45,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f83b453/228b02f6873843db85271a22349453ca [2019-11-28 15:42:45,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:42:45,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:42:45,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:42:45,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:42:45,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:42:45,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:45,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2d5097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45, skipping insertion in model container [2019-11-28 15:42:45,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:45,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:42:45,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:42:45,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:42:45,751 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:42:45,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:42:45,917 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:42:45,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45 WrapperNode [2019-11-28 15:42:45,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:42:45,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:42:45,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:42:45,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:42:45,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:45,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:46,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:42:46,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:42:46,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:42:46,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:42:46,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:46,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:46,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:46,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:46,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:46,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:46,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (1/1) ... [2019-11-28 15:42:46,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:42:46,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:42:46,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:42:46,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:42:46,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (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 15:42:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:42:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:42:47,623 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:42:47,623 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:42:47,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:42:47 BoogieIcfgContainer [2019-11-28 15:42:47,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:42:47,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:42:47,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:42:47,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:42:47,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:42:45" (1/3) ... [2019-11-28 15:42:47,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740d98c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:42:47, skipping insertion in model container [2019-11-28 15:42:47,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:42:45" (2/3) ... [2019-11-28 15:42:47,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740d98c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:42:47, skipping insertion in model container [2019-11-28 15:42:47,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:42:47" (3/3) ... [2019-11-28 15:42:47,638 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label00.c [2019-11-28 15:42:47,649 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:42:47,657 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:42:47,672 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:42:47,717 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:42:47,718 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:42:47,718 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:42:47,718 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:42:47,718 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:42:47,719 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:42:47,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:42:47,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:42:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-28 15:42:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-28 15:42:47,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:47,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:47,775 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1766677921, now seen corresponding path program 1 times [2019-11-28 15:42:47,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:47,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178347960] [2019-11-28 15:42:47,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:48,309 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 15:42:48,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178347960] [2019-11-28 15:42:48,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:42:48,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:42:48,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868922818] [2019-11-28 15:42:48,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:42:48,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:42:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:42:48,340 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-28 15:42:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:49,935 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-28 15:42:49,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:42:49,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-28 15:42:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:49,961 INFO L225 Difference]: With dead ends: 662 [2019-11-28 15:42:49,962 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 15:42:49,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:42:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 15:42:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-28 15:42:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-28 15:42:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-28 15:42:50,090 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 108 [2019-11-28 15:42:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:50,092 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-28 15:42:50,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:42:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-28 15:42:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-28 15:42:50,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:50,103 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:50,103 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1731030898, now seen corresponding path program 1 times [2019-11-28 15:42:50,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:50,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116066414] [2019-11-28 15:42:50,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:42:50,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116066414] [2019-11-28 15:42:50,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:42:50,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:42:50,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903995997] [2019-11-28 15:42:50,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:42:50,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:42:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:42:50,215 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-28 15:42:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:51,071 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-28 15:42:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:42:51,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-28 15:42:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:51,077 INFO L225 Difference]: With dead ends: 1054 [2019-11-28 15:42:51,078 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:42:51,080 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-11-28 15:42:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:42:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-28 15:42:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:42:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-28 15:42:51,121 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 114 [2019-11-28 15:42:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:51,123 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-28 15:42:51,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:42:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-28 15:42:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-28 15:42:51,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:51,130 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:51,134 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:51,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1128519054, now seen corresponding path program 1 times [2019-11-28 15:42:51,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:51,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209674539] [2019-11-28 15:42:51,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:42:51,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209674539] [2019-11-28 15:42:51,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:42:51,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:42:51,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212946098] [2019-11-28 15:42:51,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:42:51,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:42:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:42:51,322 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2019-11-28 15:42:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:52,205 INFO L93 Difference]: Finished difference Result 1578 states and 2134 transitions. [2019-11-28 15:42:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:42:52,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-28 15:42:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:52,212 INFO L225 Difference]: With dead ends: 1578 [2019-11-28 15:42:52,212 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:42:52,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-28 15:42:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:42:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-28 15:42:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:42:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 994 transitions. [2019-11-28 15:42:52,242 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 994 transitions. Word has length 115 [2019-11-28 15:42:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:52,243 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 994 transitions. [2019-11-28 15:42:52,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:42:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 994 transitions. [2019-11-28 15:42:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-28 15:42:52,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:52,247 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:52,247 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:52,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash -544120587, now seen corresponding path program 1 times [2019-11-28 15:42:52,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:52,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912152410] [2019-11-28 15:42:52,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 15:42:52,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912152410] [2019-11-28 15:42:52,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:42:52,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:42:52,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502379123] [2019-11-28 15:42:52,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:42:52,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:52,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:42:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:42:52,337 INFO L87 Difference]: Start difference. First operand 790 states and 994 transitions. Second operand 3 states. [2019-11-28 15:42:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:52,964 INFO L93 Difference]: Finished difference Result 2233 states and 2809 transitions. [2019-11-28 15:42:52,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:42:52,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-28 15:42:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:52,973 INFO L225 Difference]: With dead ends: 2233 [2019-11-28 15:42:52,974 INFO L226 Difference]: Without dead ends: 1445 [2019-11-28 15:42:52,976 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-11-28 15:42:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-28 15:42:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-28 15:42:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-28 15:42:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1429 transitions. [2019-11-28 15:42:53,020 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1429 transitions. Word has length 126 [2019-11-28 15:42:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:53,020 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1429 transitions. [2019-11-28 15:42:53,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:42:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1429 transitions. [2019-11-28 15:42:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-28 15:42:53,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:53,026 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:53,026 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1267766409, now seen corresponding path program 1 times [2019-11-28 15:42:53,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:53,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939768483] [2019-11-28 15:42:53,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 15:42:53,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939768483] [2019-11-28 15:42:53,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:42:53,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:42:53,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081212843] [2019-11-28 15:42:53,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:42:53,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:53,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:42:53,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:42:53,181 INFO L87 Difference]: Start difference. First operand 1183 states and 1429 transitions. Second operand 4 states. [2019-11-28 15:42:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:53,862 INFO L93 Difference]: Finished difference Result 2500 states and 3010 transitions. [2019-11-28 15:42:53,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:42:53,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-28 15:42:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:53,870 INFO L225 Difference]: With dead ends: 2500 [2019-11-28 15:42:53,870 INFO L226 Difference]: Without dead ends: 1319 [2019-11-28 15:42:53,872 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-11-28 15:42:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-28 15:42:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2019-11-28 15:42:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-28 15:42:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1566 transitions. [2019-11-28 15:42:53,905 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1566 transitions. Word has length 134 [2019-11-28 15:42:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:53,906 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1566 transitions. [2019-11-28 15:42:53,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:42:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1566 transitions. [2019-11-28 15:42:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-28 15:42:53,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:53,910 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:53,910 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1620959425, now seen corresponding path program 1 times [2019-11-28 15:42:53,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:53,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125133455] [2019-11-28 15:42:53,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 15:42:54,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125133455] [2019-11-28 15:42:54,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:42:54,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:42:54,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423963087] [2019-11-28 15:42:54,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:42:54,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:54,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:42:54,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:42:54,021 INFO L87 Difference]: Start difference. First operand 1314 states and 1566 transitions. Second operand 5 states. [2019-11-28 15:42:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:55,030 INFO L93 Difference]: Finished difference Result 2626 states and 3160 transitions. [2019-11-28 15:42:55,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:42:55,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-11-28 15:42:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:55,037 INFO L225 Difference]: With dead ends: 2626 [2019-11-28 15:42:55,038 INFO L226 Difference]: Without dead ends: 1445 [2019-11-28 15:42:55,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:42:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-28 15:42:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-28 15:42:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:42:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1691 transitions. [2019-11-28 15:42:55,076 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1691 transitions. Word has length 138 [2019-11-28 15:42:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:55,077 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1691 transitions. [2019-11-28 15:42:55,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:42:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1691 transitions. [2019-11-28 15:42:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 15:42:55,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:55,082 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:55,082 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash -633054500, now seen corresponding path program 1 times [2019-11-28 15:42:55,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:55,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198588927] [2019-11-28 15:42:55,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 15:42:55,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198588927] [2019-11-28 15:42:55,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:42:55,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:42:55,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681934659] [2019-11-28 15:42:55,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:42:55,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:55,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:42:55,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:42:55,166 INFO L87 Difference]: Start difference. First operand 1445 states and 1691 transitions. Second operand 3 states. [2019-11-28 15:42:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:55,744 INFO L93 Difference]: Finished difference Result 3281 states and 3857 transitions. [2019-11-28 15:42:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:42:55,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-28 15:42:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:55,753 INFO L225 Difference]: With dead ends: 3281 [2019-11-28 15:42:55,753 INFO L226 Difference]: Without dead ends: 1707 [2019-11-28 15:42:55,756 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 15:42:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-28 15:42:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-28 15:42:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:42:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1559 transitions. [2019-11-28 15:42:55,795 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1559 transitions. Word has length 141 [2019-11-28 15:42:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:55,795 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1559 transitions. [2019-11-28 15:42:55,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:42:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1559 transitions. [2019-11-28 15:42:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 15:42:55,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:55,799 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:42:55,800 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash 728477792, now seen corresponding path program 1 times [2019-11-28 15:42:55,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:55,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491483292] [2019-11-28 15:42:55,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 15:42:55,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491483292] [2019-11-28 15:42:55,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:42:55,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:42:55,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313485244] [2019-11-28 15:42:55,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:42:55,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:55,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:42:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:42:55,909 INFO L87 Difference]: Start difference. First operand 1445 states and 1559 transitions. Second operand 3 states. [2019-11-28 15:42:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:56,327 INFO L93 Difference]: Finished difference Result 3543 states and 3847 transitions. [2019-11-28 15:42:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:42:56,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-28 15:42:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:56,338 INFO L225 Difference]: With dead ends: 3543 [2019-11-28 15:42:56,339 INFO L226 Difference]: Without dead ends: 2231 [2019-11-28 15:42:56,341 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-11-28 15:42:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-28 15:42:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1838. [2019-11-28 15:42:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:42:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1972 transitions. [2019-11-28 15:42:56,389 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1972 transitions. Word has length 156 [2019-11-28 15:42:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:56,390 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1972 transitions. [2019-11-28 15:42:56,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:42:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1972 transitions. [2019-11-28 15:42:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-28 15:42:56,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:42:56,395 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:42:56,396 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:42:56,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:42:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash -519802284, now seen corresponding path program 1 times [2019-11-28 15:42:56,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:42:56,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455887928] [2019-11-28 15:42:56,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:42:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 15:42:56,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455887928] [2019-11-28 15:42:56,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941450330] [2019-11-28 15:42:56,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:42:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:42:56,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:42:56,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:42:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-28 15:42:56,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:42:56,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-28 15:42:56,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869875874] [2019-11-28 15:42:56,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:42:56,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:42:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:42:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:42:56,905 INFO L87 Difference]: Start difference. First operand 1838 states and 1972 transitions. Second operand 3 states. [2019-11-28 15:42:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:42:57,303 INFO L93 Difference]: Finished difference Result 1969 states and 2119 transitions. [2019-11-28 15:42:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:42:57,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-28 15:42:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:42:57,304 INFO L225 Difference]: With dead ends: 1969 [2019-11-28 15:42:57,304 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:42:57,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:42:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:42:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:42:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:42:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:42:57,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2019-11-28 15:42:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:42:57,309 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:42:57,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:42:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:42:57,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:42:57,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:42:57,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:42:57,790 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-28 15:42:57,791 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-28 15:42:57,791 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,791 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,791 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,791 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,791 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,791 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,791 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-28 15:42:57,792 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-28 15:42:57,793 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,799 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,802 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,803 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,803 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,803 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,803 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-28 15:42:57,804 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-28 15:42:57,804 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-28 15:42:57,804 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-28 15:42:57,804 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-28 15:42:57,805 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-28 15:42:57,805 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-28 15:42:57,805 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-28 15:42:57,805 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-28 15:42:57,805 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-28 15:42:57,806 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-28 15:42:57,806 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-28 15:42:57,806 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-28 15:42:57,809 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-28 15:42:57,809 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-28 15:42:57,809 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,809 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,810 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,810 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,810 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,810 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-28 15:42:57,810 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-28 15:42:57,811 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-28 15:42:57,811 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-28 15:42:57,811 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-28 15:42:57,811 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-28 15:42:57,811 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-28 15:42:57,812 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-28 15:42:57,812 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-28 15:42:57,812 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (not (= ~a16~0 5)))) (or (and .cse0 .cse1) (and .cse0 (<= ~a21~0 0) .cse2) (= ~a16~0 4) (and .cse2 (= ~a21~0 1) .cse1) (not (= 13 ~a8~0)))) [2019-11-28 15:42:57,814 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,814 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,814 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,814 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,814 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,815 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-28 15:42:57,816 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-28 15:42:57,816 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-28 15:42:57,816 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-28 15:42:57,816 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-28 15:42:57,816 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-28 15:42:57,817 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-28 15:42:57,819 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-28 15:42:57,820 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-28 15:42:57,821 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-28 15:42:57,821 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-28 15:42:57,821 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-28 15:42:57,821 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-28 15:42:57,821 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-28 15:42:57,822 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,822 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,822 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,822 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,822 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,822 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-28 15:42:57,823 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-28 15:42:57,823 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-28 15:42:57,823 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-28 15:42:57,823 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-28 15:42:57,823 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-28 15:42:57,824 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-28 15:42:57,824 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-28 15:42:57,824 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-28 15:42:57,824 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,825 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,825 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,826 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,826 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-28 15:42:57,828 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,828 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-28 15:42:57,829 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-28 15:42:57,829 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-28 15:42:57,829 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-28 15:42:57,829 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 15:42:57,829 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-28 15:42:57,830 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-28 15:42:57,830 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:42:57,830 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-28 15:42:57,830 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-28 15:42:57,830 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-28 15:42:57,830 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-28 15:42:57,831 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-28 15:42:57,831 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-28 15:42:57,831 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,831 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (not (= ~a16~0 5)))) (or (and .cse0 .cse1) (and .cse0 (<= ~a21~0 0) .cse2) (= ~a16~0 4) (and .cse2 (= ~a21~0 1) .cse1) (not (= 13 ~a8~0)))) [2019-11-28 15:42:57,832 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,833 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,833 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,833 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,833 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-28 15:42:57,833 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-28 15:42:57,834 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-28 15:42:57,834 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-28 15:42:57,834 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-28 15:42:57,834 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 15:42:57,834 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-28 15:42:57,835 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-28 15:42:57,835 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,835 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,835 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,835 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,835 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,836 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-28 15:42:57,836 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:42:57,836 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-28 15:42:57,836 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-28 15:42:57,836 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-28 15:42:57,837 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-28 15:42:57,837 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-28 15:42:57,837 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-28 15:42:57,837 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-28 15:42:57,837 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-28 15:42:57,838 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-28 15:42:57,838 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-28 15:42:57,838 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-28 15:42:57,838 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,838 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,839 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,839 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,839 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-28 15:42:57,839 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,839 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,840 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-28 15:42:57,840 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-28 15:42:57,840 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:42:57,840 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-28 15:42:57,840 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-28 15:42:57,841 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-28 15:42:57,842 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-28 15:42:57,843 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-28 15:42:57,843 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-28 15:42:57,843 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-28 15:42:57,843 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-28 15:42:57,843 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-28 15:42:57,844 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-28 15:42:57,844 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,844 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,844 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,844 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,845 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,845 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-28 15:42:57,845 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,845 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-28 15:42:57,845 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-28 15:42:57,845 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-28 15:42:57,846 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-28 15:42:57,846 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-28 15:42:57,846 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-28 15:42:57,846 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-28 15:42:57,846 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-28 15:42:57,847 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-28 15:42:57,847 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-28 15:42:57,847 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-28 15:42:57,847 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:42:57,848 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 500) no Hoare annotation was computed. [2019-11-28 15:42:57,849 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-28 15:42:57,849 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-28 15:42:57,850 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-28 15:42:57,850 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,850 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,850 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,850 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,851 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,851 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:42:57,851 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-28 15:42:57,851 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-28 15:42:57,851 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-28 15:42:57,852 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-28 15:42:57,852 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-28 15:42:57,852 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-28 15:42:57,852 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-28 15:42:57,852 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-28 15:42:57,852 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-28 15:42:57,853 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-28 15:42:57,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:42:57 BoogieIcfgContainer [2019-11-28 15:42:57,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:42:57,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:42:57,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:42:57,886 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:42:57,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:42:47" (3/4) ... [2019-11-28 15:42:57,891 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:42:57,925 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:42:57,926 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:42:58,289 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:42:58,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:42:58,293 INFO L168 Benchmark]: Toolchain (without parser) took 13097.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 405.3 MB). Free memory was 952.3 MB in the beginning and 1.4 GB in the end (delta: -425.2 MB). Peak memory consumption was 447.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:42:58,293 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:42:58,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -125.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:42:58,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.76 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:42:58,295 INFO L168 Benchmark]: Boogie Preprocessor took 107.95 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:42:58,296 INFO L168 Benchmark]: RCFGBuilder took 1481.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.1 MB in the end (delta: 100.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:42:58,297 INFO L168 Benchmark]: TraceAbstraction took 10257.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 963.1 MB in the beginning and 807.6 MB in the end (delta: 155.6 MB). Peak memory consumption was 342.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:42:58,297 INFO L168 Benchmark]: Witness Printer took 403.88 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 102.8 MB). Free memory was 807.6 MB in the beginning and 1.4 GB in the end (delta: -569.9 MB). Peak memory consumption was 653.3 kB. Max. memory is 11.5 GB. [2019-11-28 15:42:58,302 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 722.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -125.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.76 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.95 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1481.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.1 MB in the end (delta: 100.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10257.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 963.1 MB in the beginning and 807.6 MB in the end (delta: 155.6 MB). Peak memory consumption was 342.2 MB. Max. memory is 11.5 GB. * Witness Printer took 403.88 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 102.8 MB). Free memory was 807.6 MB in the beginning and 1.4 GB in the end (delta: -569.9 MB). Peak memory consumption was 653.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 500]: 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: ((((1 == a7 && !(a16 == 5)) || ((1 == a7 && a21 <= 0) && a17 == 1)) || a16 == 4) || ((a17 == 1 && a21 == 1) && !(a16 == 5))) || !(13 == a8) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((1 == a7 && !(a16 == 5)) || ((1 == a7 && a21 <= 0) && a17 == 1)) || a16 == 4) || ((a17 == 1 && a21 == 1) && !(a16 == 5))) || !(13 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.8s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 830 SDtfs, 1953 SDslu, 93 SDs, 0 SdLazy, 4427 SolverSat, 786 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 75 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1188 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 162 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1402 NumberOfCodeBlocks, 1402 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 487642 SizeOfPredicates, 1 NumberOfNonLiveVariables, 329 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 450/477 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...