./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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_label34.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 f01979d5da4d022026be8efd02bfc41090b6cbce ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:52:52,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:52:52,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:52:52,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:52:52,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:52:52,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:52:52,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:52:52,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:52:52,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:52:52,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:52:52,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:52:52,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:52:52,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:52:52,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:52:52,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:52:52,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:52:52,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:52:52,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:52:52,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:52:52,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:52:52,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:52:52,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:52:52,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:52:52,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:52:52,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:52:52,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:52:52,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:52:52,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:52:52,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:52:52,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:52:52,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:52:52,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:52:52,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:52:52,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:52:52,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:52:52,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:52:52,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:52:52,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:52:52,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:52:52,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:52:52,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:52:52,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:52:52,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:52:52,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:52:52,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:52:52,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:52:52,263 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:52:52,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:52:52,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:52:52,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:52:52,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:52:52,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:52:52,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:52:52,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:52:52,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:52:52,266 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:52:52,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:52:52,266 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:52:52,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:52:52,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:52:52,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:52:52,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:52:52,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:52:52,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:52:52,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:52:52,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:52:52,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:52:52,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:52:52,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:52:52,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:52:52,270 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 -> f01979d5da4d022026be8efd02bfc41090b6cbce [2019-11-19 20:52:52,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:52:52,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:52:52,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:52:52,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:52:52,634 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:52:52,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label34.c [2019-11-19 20:52:52,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa8ca466/50d6a03754af4aa4b3a4af8066500803/FLAGf8973e8c6 [2019-11-19 20:52:53,283 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:52:53,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label34.c [2019-11-19 20:52:53,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa8ca466/50d6a03754af4aa4b3a4af8066500803/FLAGf8973e8c6 [2019-11-19 20:52:53,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aa8ca466/50d6a03754af4aa4b3a4af8066500803 [2019-11-19 20:52:53,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:52:53,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:52:53,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:53,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:52:53,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:52:53,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:53" (1/1) ... [2019-11-19 20:52:53,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f5128e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:53, skipping insertion in model container [2019-11-19 20:52:53,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:53" (1/1) ... [2019-11-19 20:52:53,563 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:52:53,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:52:54,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:54,108 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:52:54,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:54,360 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:52:54,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54 WrapperNode [2019-11-19 20:52:54,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:54,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:54,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:52:54,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:52:54,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:54,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:52:54,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:52:54,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:52:54,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:52:54,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:52:54,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:52:54,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:52:54,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (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-19 20:52:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:52:54,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:52:56,124 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:52:56,125 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:52:56,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:56 BoogieIcfgContainer [2019-11-19 20:52:56,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:52:56,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:52:56,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:52:56,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:52:56,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:52:53" (1/3) ... [2019-11-19 20:52:56,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733248b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:56, skipping insertion in model container [2019-11-19 20:52:56,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54" (2/3) ... [2019-11-19 20:52:56,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733248b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:56, skipping insertion in model container [2019-11-19 20:52:56,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:56" (3/3) ... [2019-11-19 20:52:56,143 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label34.c [2019-11-19 20:52:56,156 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:52:56,167 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:52:56,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:52:56,211 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:52:56,212 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:52:56,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:52:56,212 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:52:56,212 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:52:56,212 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:52:56,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:52:56,213 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:52:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-19 20:52:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 20:52:56,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:56,264 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] [2019-11-19 20:52:56,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:56,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1487053686, now seen corresponding path program 1 times [2019-11-19 20:52:56,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:56,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882753731] [2019-11-19 20:52:56,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:56,778 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-19 20:52:56,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882753731] [2019-11-19 20:52:56,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:56,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:52:56,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467273820] [2019-11-19 20:52:56,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:56,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:56,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:56,811 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-19 20:52:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:58,246 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-19 20:52:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:52:58,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-19 20:52:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:58,274 INFO L225 Difference]: With dead ends: 662 [2019-11-19 20:52:58,274 INFO L226 Difference]: Without dead ends: 397 [2019-11-19 20:52:58,285 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-19 20:52:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-19 20:52:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-19 20:52:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-19 20:52:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-19 20:52:58,378 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 105 [2019-11-19 20:52:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:58,379 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-19 20:52:58,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-19 20:52:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-19 20:52:58,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:58,384 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:58,384 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:58,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2090027166, now seen corresponding path program 1 times [2019-11-19 20:52:58,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:58,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119468699] [2019-11-19 20:52:58,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:58,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119468699] [2019-11-19 20:52:58,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:58,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:52:58,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112706] [2019-11-19 20:52:58,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:58,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:58,482 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-19 20:52:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:59,101 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-19 20:52:59,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:59,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-19 20:52:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:59,106 INFO L225 Difference]: With dead ends: 1185 [2019-11-19 20:52:59,106 INFO L226 Difference]: Without dead ends: 790 [2019-11-19 20:52:59,108 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-19 20:52:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-19 20:52:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-19 20:52:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-19 20:52:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-19 20:52:59,144 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 110 [2019-11-19 20:52:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:59,145 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-19 20:52:59,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:52:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-19 20:52:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-19 20:52:59,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:59,151 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:59,151 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1180375025, now seen corresponding path program 1 times [2019-11-19 20:52:59,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:59,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574715430] [2019-11-19 20:52:59,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 20:52:59,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574715430] [2019-11-19 20:52:59,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:59,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:52:59,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193360003] [2019-11-19 20:52:59,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:52:59,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:52:59,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:52:59,254 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-19 20:52:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:59,837 INFO L93 Difference]: Finished difference Result 1971 states and 2688 transitions. [2019-11-19 20:52:59,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:52:59,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-19 20:52:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:59,843 INFO L225 Difference]: With dead ends: 1971 [2019-11-19 20:52:59,843 INFO L226 Difference]: Without dead ends: 1183 [2019-11-19 20:52:59,845 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-19 20:52:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-19 20:52:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 790. [2019-11-19 20:52:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-19 20:52:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-19 20:52:59,873 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 117 [2019-11-19 20:52:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:59,874 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-19 20:52:59,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:52:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-19 20:52:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 20:52:59,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:59,879 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:59,879 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash 908956375, now seen corresponding path program 1 times [2019-11-19 20:52:59,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:59,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326328052] [2019-11-19 20:52:59,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:00,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326328052] [2019-11-19 20:53:00,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:00,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:00,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481483369] [2019-11-19 20:53:00,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:00,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:00,042 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 4 states. [2019-11-19 20:53:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:00,838 INFO L93 Difference]: Finished difference Result 1714 states and 2292 transitions. [2019-11-19 20:53:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:53:00,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-19 20:53:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:00,846 INFO L225 Difference]: With dead ends: 1714 [2019-11-19 20:53:00,846 INFO L226 Difference]: Without dead ends: 926 [2019-11-19 20:53:00,849 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-19 20:53:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-19 20:53:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 921. [2019-11-19 20:53:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-19 20:53:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1204 transitions. [2019-11-19 20:53:00,887 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1204 transitions. Word has length 120 [2019-11-19 20:53:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:00,887 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1204 transitions. [2019-11-19 20:53:00,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1204 transitions. [2019-11-19 20:53:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-19 20:53:00,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:00,895 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:00,895 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1523327247, now seen corresponding path program 1 times [2019-11-19 20:53:00,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:00,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605260592] [2019-11-19 20:53:00,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:01,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605260592] [2019-11-19 20:53:01,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:01,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:01,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639720225] [2019-11-19 20:53:01,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:53:01,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:01,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:53:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:53:01,078 INFO L87 Difference]: Start difference. First operand 921 states and 1204 transitions. Second operand 5 states. [2019-11-19 20:53:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:02,159 INFO L93 Difference]: Finished difference Result 2233 states and 2968 transitions. [2019-11-19 20:53:02,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:53:02,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-11-19 20:53:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:02,167 INFO L225 Difference]: With dead ends: 2233 [2019-11-19 20:53:02,168 INFO L226 Difference]: Without dead ends: 1445 [2019-11-19 20:53:02,170 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-19 20:53:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-19 20:53:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-19 20:53:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-19 20:53:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1806 transitions. [2019-11-19 20:53:02,208 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1806 transitions. Word has length 124 [2019-11-19 20:53:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:02,208 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1806 transitions. [2019-11-19 20:53:02,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:53:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1806 transitions. [2019-11-19 20:53:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-19 20:53:02,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:02,212 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:02,213 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:02,213 INFO L82 PathProgramCache]: Analyzing trace with hash -438004118, now seen corresponding path program 1 times [2019-11-19 20:53:02,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:02,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924269796] [2019-11-19 20:53:02,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:02,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924269796] [2019-11-19 20:53:02,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:02,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:02,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707402739] [2019-11-19 20:53:02,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:02,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:02,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:02,283 INFO L87 Difference]: Start difference. First operand 1445 states and 1806 transitions. Second operand 3 states. [2019-11-19 20:53:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:02,776 INFO L93 Difference]: Finished difference Result 3150 states and 3956 transitions. [2019-11-19 20:53:02,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:02,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-19 20:53:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:02,787 INFO L225 Difference]: With dead ends: 3150 [2019-11-19 20:53:02,787 INFO L226 Difference]: Without dead ends: 1707 [2019-11-19 20:53:02,790 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-19 20:53:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-19 20:53:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-19 20:53:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-19 20:53:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1665 transitions. [2019-11-19 20:53:02,836 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1665 transitions. Word has length 127 [2019-11-19 20:53:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:02,836 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1665 transitions. [2019-11-19 20:53:02,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1665 transitions. [2019-11-19 20:53:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-19 20:53:02,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:02,842 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:02,842 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:02,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1608303192, now seen corresponding path program 1 times [2019-11-19 20:53:02,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:02,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284423429] [2019-11-19 20:53:02,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-19 20:53:02,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284423429] [2019-11-19 20:53:02,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:02,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:53:02,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173421103] [2019-11-19 20:53:02,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:02,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:02,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:02,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:02,931 INFO L87 Difference]: Start difference. First operand 1445 states and 1665 transitions. Second operand 3 states. [2019-11-19 20:53:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:03,356 INFO L93 Difference]: Finished difference Result 2888 states and 3326 transitions. [2019-11-19 20:53:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:03,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-19 20:53:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:03,365 INFO L225 Difference]: With dead ends: 2888 [2019-11-19 20:53:03,365 INFO L226 Difference]: Without dead ends: 1445 [2019-11-19 20:53:03,368 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-19 20:53:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-19 20:53:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-19 20:53:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-19 20:53:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1593 transitions. [2019-11-19 20:53:03,402 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1593 transitions. Word has length 135 [2019-11-19 20:53:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:03,403 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1593 transitions. [2019-11-19 20:53:03,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1593 transitions. [2019-11-19 20:53:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-19 20:53:03,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:03,408 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:03,408 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2140021486, now seen corresponding path program 1 times [2019-11-19 20:53:03,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:03,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063161368] [2019-11-19 20:53:03,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:04,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063161368] [2019-11-19 20:53:04,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:04,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-19 20:53:04,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778517851] [2019-11-19 20:53:04,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 20:53:04,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:04,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 20:53:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-19 20:53:04,319 INFO L87 Difference]: Start difference. First operand 1445 states and 1593 transitions. Second operand 12 states. [2019-11-19 20:53:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:06,040 INFO L93 Difference]: Finished difference Result 3260 states and 3653 transitions. [2019-11-19 20:53:06,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 20:53:06,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2019-11-19 20:53:06,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:06,051 INFO L225 Difference]: With dead ends: 3260 [2019-11-19 20:53:06,051 INFO L226 Difference]: Without dead ends: 1914 [2019-11-19 20:53:06,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-19 20:53:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-19 20:53:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1611. [2019-11-19 20:53:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-11-19 20:53:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 1755 transitions. [2019-11-19 20:53:06,105 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 1755 transitions. Word has length 142 [2019-11-19 20:53:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:06,107 INFO L462 AbstractCegarLoop]: Abstraction has 1611 states and 1755 transitions. [2019-11-19 20:53:06,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 20:53:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1755 transitions. [2019-11-19 20:53:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-19 20:53:06,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:06,116 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-19 20:53:06,116 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash -724774353, now seen corresponding path program 1 times [2019-11-19 20:53:06,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:06,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826163535] [2019-11-19 20:53:06,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 171 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 20:53:06,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826163535] [2019-11-19 20:53:06,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496827508] [2019-11-19 20:53:06,422 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-19 20:53:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:06,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:53:06,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:53:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-19 20:53:06,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:53:06,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-19 20:53:06,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748282404] [2019-11-19 20:53:06,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:06,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:06,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:06,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:53:06,857 INFO L87 Difference]: Start difference. First operand 1611 states and 1755 transitions. Second operand 3 states. [2019-11-19 20:53:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:07,390 INFO L93 Difference]: Finished difference Result 1611 states and 1755 transitions. [2019-11-19 20:53:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:07,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-19 20:53:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:07,393 INFO L225 Difference]: With dead ends: 1611 [2019-11-19 20:53:07,393 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:53:07,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 212 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-19 20:53:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:53:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:53:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:53:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:53:07,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-11-19 20:53:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:07,398 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:53:07,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:53:07,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:53:07,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:53:07,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:53:07,816 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-19 20:53:07,816 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-19 20:53:07,816 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,816 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,817 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,817 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,817 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,817 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,817 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-19 20:53:07,821 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-19 20:53:07,822 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-19 20:53:07,822 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-19 20:53:07,822 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-19 20:53:07,822 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-19 20:53:07,823 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-19 20:53:07,823 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-19 20:53:07,823 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-19 20:53:07,823 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-19 20:53:07,824 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,824 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,824 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,824 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,824 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,824 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,825 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-19 20:53:07,825 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-19 20:53:07,825 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-19 20:53:07,826 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-19 20:53:07,826 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-19 20:53:07,826 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-19 20:53:07,826 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-19 20:53:07,826 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-19 20:53:07,826 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-19 20:53:07,827 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-19 20:53:07,827 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-19 20:53:07,827 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-19 20:53:07,827 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-19 20:53:07,827 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-19 20:53:07,827 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-19 20:53:07,828 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,828 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,828 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,828 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,828 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,828 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-19 20:53:07,829 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-19 20:53:07,829 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-19 20:53:07,829 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-19 20:53:07,829 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-19 20:53:07,829 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-19 20:53:07,829 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-19 20:53:07,830 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-19 20:53:07,830 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-19 20:53:07,831 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0))) (or (and .cse0 (= ~a12~0 8) (= ~a20~0 1)) (and (= ~a21~0 1) (<= ~a7~0 0)) (and .cse0 (not (= ~a16~0 6))))) [2019-11-19 20:53:07,831 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,831 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,832 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,832 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,832 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,832 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-19 20:53:07,833 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-19 20:53:07,833 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-19 20:53:07,833 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-19 20:53:07,833 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-19 20:53:07,833 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-19 20:53:07,834 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-19 20:53:07,834 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-19 20:53:07,834 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-19 20:53:07,834 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-19 20:53:07,835 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-19 20:53:07,835 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-19 20:53:07,835 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-19 20:53:07,835 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-19 20:53:07,836 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,836 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,836 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,836 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,837 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,837 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-19 20:53:07,837 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-19 20:53:07,837 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-19 20:53:07,838 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-19 20:53:07,838 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-19 20:53:07,838 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-19 20:53:07,838 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-19 20:53:07,839 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-19 20:53:07,839 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-19 20:53:07,839 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,839 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,839 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,840 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,840 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-19 20:53:07,840 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,840 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-19 20:53:07,841 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-19 20:53:07,841 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-19 20:53:07,841 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-19 20:53:07,841 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-19 20:53:07,842 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-19 20:53:07,842 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-19 20:53:07,842 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:53:07,842 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-19 20:53:07,843 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-19 20:53:07,843 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-19 20:53:07,843 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-19 20:53:07,843 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-19 20:53:07,844 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-19 20:53:07,844 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,845 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0))) (or (and .cse0 (= ~a12~0 8) (= ~a20~0 1)) (and (= ~a21~0 1) (<= ~a7~0 0)) (and .cse0 (not (= ~a16~0 6))))) [2019-11-19 20:53:07,846 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,846 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,846 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,847 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,847 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-19 20:53:07,847 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-19 20:53:07,847 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-19 20:53:07,848 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-19 20:53:07,848 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-19 20:53:07,848 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-19 20:53:07,848 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-19 20:53:07,849 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-19 20:53:07,849 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,849 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,849 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,850 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,850 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,850 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-19 20:53:07,850 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:53:07,850 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-19 20:53:07,851 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-19 20:53:07,851 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-19 20:53:07,851 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-19 20:53:07,851 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-19 20:53:07,852 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-19 20:53:07,852 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-19 20:53:07,852 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-19 20:53:07,852 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-19 20:53:07,853 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-19 20:53:07,853 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-19 20:53:07,853 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,853 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,854 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,854 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,854 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-19 20:53:07,854 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,855 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,855 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-19 20:53:07,855 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-19 20:53:07,855 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:53:07,855 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-19 20:53:07,855 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-19 20:53:07,856 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-19 20:53:07,856 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-19 20:53:07,856 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-19 20:53:07,856 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-19 20:53:07,857 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-19 20:53:07,857 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-19 20:53:07,857 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-19 20:53:07,857 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-19 20:53:07,857 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,858 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,858 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,858 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,858 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,859 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-19 20:53:07,859 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,859 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-19 20:53:07,859 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-19 20:53:07,860 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-19 20:53:07,860 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-19 20:53:07,860 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-19 20:53:07,860 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-19 20:53:07,861 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-19 20:53:07,861 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-19 20:53:07,861 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-19 20:53:07,861 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-19 20:53:07,862 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-19 20:53:07,862 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 20:53:07,862 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 491) no Hoare annotation was computed. [2019-11-19 20:53:07,862 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-19 20:53:07,863 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-19 20:53:07,863 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-19 20:53:07,863 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,863 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,864 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,864 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,864 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,864 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:07,865 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-19 20:53:07,865 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-19 20:53:07,865 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-19 20:53:07,865 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-19 20:53:07,865 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-19 20:53:07,866 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-19 20:53:07,866 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-19 20:53:07,866 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-19 20:53:07,866 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-19 20:53:07,867 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-19 20:53:07,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:53:07 BoogieIcfgContainer [2019-11-19 20:53:07,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:53:07,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:53:07,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:53:07,901 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:53:07,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:56" (3/4) ... [2019-11-19 20:53:07,906 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:53:07,941 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:53:07,943 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:53:08,149 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:53:08,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:53:08,152 INFO L168 Benchmark]: Toolchain (without parser) took 14605.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.3 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -227.6 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:08,153 INFO L168 Benchmark]: CDTParser took 0.27 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-19 20:53:08,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:08,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:08,154 INFO L168 Benchmark]: Boogie Preprocessor took 62.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:08,154 INFO L168 Benchmark]: RCFGBuilder took 1617.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:08,155 INFO L168 Benchmark]: TraceAbstraction took 11769.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -183.8 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:08,155 INFO L168 Benchmark]: Witness Printer took 249.82 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:08,159 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.27 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 814.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1617.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11769.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 259.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -183.8 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. * Witness Printer took 249.82 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 491]: 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 && a12 == 8) && a20 == 1) || (a21 == 1 && a7 <= 0)) || (1 == a7 && !(a16 == 6)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((1 == a7 && a12 == 8) && a20 == 1) || (a21 == 1 && a7 <= 0)) || (1 == a7 && !(a16 == 6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.6s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 562 SDtfs, 2069 SDslu, 120 SDs, 0 SdLazy, 5132 SolverSat, 680 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1611occurred 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, 963 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 53 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1958 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1404 NumberOfCodeBlocks, 1404 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1394 ConstructedInterpolants, 0 QuantifiedInterpolants, 755026 SizeOfPredicates, 1 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 607/634 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...