./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label46.c -s /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer --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 15c406f4c881927013bc1c3740a0ccf2226e847a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:27:23,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:27:23,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:27:23,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:27:23,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:27:23,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:27:23,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:27:23,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:27:23,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:27:23,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:27:23,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:27:23,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:27:23,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:27:23,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:27:23,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:27:23,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:27:23,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:27:23,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:27:23,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:27:23,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:27:23,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:27:23,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:27:23,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:27:23,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:27:23,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:27:23,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:27:23,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:27:23,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:27:23,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:27:23,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:27:23,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:27:23,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:27:23,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:27:23,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:27:23,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:27:23,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:27:23,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:27:23,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:27:23,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:27:23,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:27:23,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:27:23,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:27:23,259 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:27:23,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:27:23,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:27:23,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:27:23,260 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:27:23,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:27:23,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:27:23,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:27:23,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:27:23,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:27:23,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:27:23,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:27:23,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:27:23,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:27:23,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:27:23,262 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:27:23,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:27:23,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:27:23,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:27:23,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:27:23,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:27:23,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:27:23,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:27:23,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:27:23,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:27:23,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:27:23,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:27:23,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:27:23,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:27:23,263 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer 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 -> 15c406f4c881927013bc1c3740a0ccf2226e847a [2019-12-07 17:27:23,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:27:23,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:27:23,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:27:23,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:27:23,373 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:27:23,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label46.c [2019-12-07 17:27:23,422 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/data/1ec38743a/b1c4d0b4f2f64fffa2e6c48435b7d462/FLAG22a881d2a [2019-12-07 17:27:23,882 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:27:23,883 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/sv-benchmarks/c/eca-rers2012/Problem14_label46.c [2019-12-07 17:27:23,892 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/data/1ec38743a/b1c4d0b4f2f64fffa2e6c48435b7d462/FLAG22a881d2a [2019-12-07 17:27:23,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/data/1ec38743a/b1c4d0b4f2f64fffa2e6c48435b7d462 [2019-12-07 17:27:23,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:27:23,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:27:23,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:27:23,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:27:23,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:27:23,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:27:23" (1/1) ... [2019-12-07 17:27:23,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:23, skipping insertion in model container [2019-12-07 17:27:23,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:27:23" (1/1) ... [2019-12-07 17:27:23,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:27:23,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:27:24,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:27:24,206 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:27:24,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:27:24,284 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:27:24,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24 WrapperNode [2019-12-07 17:27:24,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:27:24,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:27:24,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:27:24,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:27:24,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:27:24,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:27:24,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:27:24,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:27:24,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... [2019-12-07 17:27:24,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:27:24,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:27:24,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:27:24,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:27:24,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:27:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:27:24,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:27:25,192 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:27:25,192 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:27:25,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:25 BoogieIcfgContainer [2019-12-07 17:27:25,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:27:25,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:27:25,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:27:25,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:27:25,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:27:23" (1/3) ... [2019-12-07 17:27:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252d6457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:27:25, skipping insertion in model container [2019-12-07 17:27:25,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:24" (2/3) ... [2019-12-07 17:27:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252d6457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:27:25, skipping insertion in model container [2019-12-07 17:27:25,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:25" (3/3) ... [2019-12-07 17:27:25,198 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label46.c [2019-12-07 17:27:25,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:27:25,211 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:27:25,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:27:25,238 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:27:25,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:27:25,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:27:25,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:27:25,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:27:25,239 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:27:25,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:27:25,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:27:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-12-07 17:27:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:27:25,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:25,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:25,262 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2019-12-07 17:27:25,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:25,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685248480] [2019-12-07 17:27:25,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:27:25,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685248480] [2019-12-07 17:27:25,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:25,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:27:25,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084981298] [2019-12-07 17:27:25,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:27:25,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:25,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:27:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:27:25,509 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2019-12-07 17:27:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:26,685 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2019-12-07 17:27:26,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:27:26,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 17:27:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:26,699 INFO L225 Difference]: With dead ends: 852 [2019-12-07 17:27:26,699 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 17:27:26,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:27:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 17:27:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-12-07 17:27:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-07 17:27:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2019-12-07 17:27:26,754 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 39 [2019-12-07 17:27:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:26,754 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2019-12-07 17:27:26,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:27:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2019-12-07 17:27:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 17:27:26,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:26,762 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:27:26,763 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1976295897, now seen corresponding path program 1 times [2019-12-07 17:27:26,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:26,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552698193] [2019-12-07 17:27:26,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-07 17:27:26,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552698193] [2019-12-07 17:27:26,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:26,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:27:26,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961972716] [2019-12-07 17:27:26,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:27:26,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:27:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:27:26,890 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2019-12-07 17:27:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:27,618 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2019-12-07 17:27:27,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:27:27,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-12-07 17:27:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:27,622 INFO L225 Difference]: With dead ends: 1252 [2019-12-07 17:27:27,622 INFO L226 Difference]: Without dead ends: 894 [2019-12-07 17:27:27,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:27:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-07 17:27:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2019-12-07 17:27:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-12-07 17:27:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2019-12-07 17:27:27,643 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 187 [2019-12-07 17:27:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:27,643 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2019-12-07 17:27:27,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:27:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2019-12-07 17:27:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-07 17:27:27,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:27,646 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:27,646 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:27,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1989656586, now seen corresponding path program 1 times [2019-12-07 17:27:27,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:27,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137427309] [2019-12-07 17:27:27,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 140 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 17:27:27,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137427309] [2019-12-07 17:27:27,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089438343] [2019-12-07 17:27:27,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:27,922 INFO L264 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:27:27,931 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-12-07 17:27:27,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:27:27,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 17:27:27,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601962181] [2019-12-07 17:27:27,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:27:27,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:27,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:27:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:27:27,980 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 3 states. [2019-12-07 17:27:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:28,460 INFO L93 Difference]: Finished difference Result 2320 states and 3245 transitions. [2019-12-07 17:27:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:27:28,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-12-07 17:27:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:28,467 INFO L225 Difference]: With dead ends: 2320 [2019-12-07 17:27:28,467 INFO L226 Difference]: Without dead ends: 1606 [2019-12-07 17:27:28,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:27:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-12-07 17:27:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-12-07 17:27:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 17:27:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1842 transitions. [2019-12-07 17:27:28,491 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1842 transitions. Word has length 210 [2019-12-07 17:27:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:28,491 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1842 transitions. [2019-12-07 17:27:28,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:27:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1842 transitions. [2019-12-07 17:27:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-12-07 17:27:28,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:28,495 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:27:28,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:28,696 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:28,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1040958891, now seen corresponding path program 1 times [2019-12-07 17:27:28,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:28,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208235842] [2019-12-07 17:27:28,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 248 proven. 4 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 17:27:28,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208235842] [2019-12-07 17:27:28,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483220999] [2019-12-07 17:27:28,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:29,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:27:29,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-12-07 17:27:29,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:27:29,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 17:27:29,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904110521] [2019-12-07 17:27:29,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:27:29,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:29,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:27:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:27:29,109 INFO L87 Difference]: Start difference. First operand 1428 states and 1842 transitions. Second operand 3 states. [2019-12-07 17:27:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:29,618 INFO L93 Difference]: Finished difference Result 3388 states and 4517 transitions. [2019-12-07 17:27:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:27:29,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-12-07 17:27:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:29,630 INFO L225 Difference]: With dead ends: 3388 [2019-12-07 17:27:29,630 INFO L226 Difference]: Without dead ends: 2140 [2019-12-07 17:27:29,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:27:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-07 17:27:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2019-12-07 17:27:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-12-07 17:27:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2478 transitions. [2019-12-07 17:27:29,684 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2478 transitions. Word has length 309 [2019-12-07 17:27:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:29,685 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2478 transitions. [2019-12-07 17:27:29,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:27:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2478 transitions. [2019-12-07 17:27:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-12-07 17:27:29,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:29,692 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:27:29,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:29,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:29,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1776950710, now seen corresponding path program 1 times [2019-12-07 17:27:29,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:29,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519924315] [2019-12-07 17:27:29,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 248 proven. 4 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-12-07 17:27:30,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519924315] [2019-12-07 17:27:30,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431292323] [2019-12-07 17:27:30,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:30,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:27:30,168 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-12-07 17:27:30,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:27:30,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 17:27:30,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93373888] [2019-12-07 17:27:30,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:27:30,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:27:30,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:27:30,270 INFO L87 Difference]: Start difference. First operand 1962 states and 2478 transitions. Second operand 4 states. [2019-12-07 17:27:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:30,841 INFO L93 Difference]: Finished difference Result 3951 states and 5007 transitions. [2019-12-07 17:27:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:27:30,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-12-07 17:27:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:30,848 INFO L225 Difference]: With dead ends: 3951 [2019-12-07 17:27:30,848 INFO L226 Difference]: Without dead ends: 2140 [2019-12-07 17:27:30,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:27:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-07 17:27:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2019-12-07 17:27:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-12-07 17:27:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2178 transitions. [2019-12-07 17:27:30,872 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2178 transitions. Word has length 328 [2019-12-07 17:27:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:30,873 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2178 transitions. [2019-12-07 17:27:30,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:27:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2178 transitions. [2019-12-07 17:27:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-12-07 17:27:30,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:30,878 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:31,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:31,079 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1745090076, now seen corresponding path program 1 times [2019-12-07 17:27:31,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:31,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866658108] [2019-12-07 17:27:31,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 419 proven. 65 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-12-07 17:27:31,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866658108] [2019-12-07 17:27:31,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514864335] [2019-12-07 17:27:31,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:31,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:27:31,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-12-07 17:27:31,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:27:31,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-12-07 17:27:31,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730430071] [2019-12-07 17:27:31,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:27:31,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:31,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:27:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:27:31,884 INFO L87 Difference]: Start difference. First operand 1962 states and 2178 transitions. Second operand 7 states. [2019-12-07 17:27:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:32,450 INFO L93 Difference]: Finished difference Result 3972 states and 4416 transitions. [2019-12-07 17:27:32,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:27:32,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 423 [2019-12-07 17:27:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:32,460 INFO L225 Difference]: With dead ends: 3972 [2019-12-07 17:27:32,460 INFO L226 Difference]: Without dead ends: 2140 [2019-12-07 17:27:32,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:27:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-07 17:27:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2019-12-07 17:27:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-12-07 17:27:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2130 transitions. [2019-12-07 17:27:32,487 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2130 transitions. Word has length 423 [2019-12-07 17:27:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:32,487 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2130 transitions. [2019-12-07 17:27:32,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:27:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2130 transitions. [2019-12-07 17:27:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-12-07 17:27:32,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:32,490 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:32,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:32,691 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:32,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash 482320211, now seen corresponding path program 1 times [2019-12-07 17:27:32,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:32,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447083496] [2019-12-07 17:27:32,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-12-07 17:27:32,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447083496] [2019-12-07 17:27:32,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:32,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:27:32,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509257890] [2019-12-07 17:27:32,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:27:32,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:32,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:27:32,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:27:32,942 INFO L87 Difference]: Start difference. First operand 1962 states and 2130 transitions. Second operand 4 states. [2019-12-07 17:27:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:33,591 INFO L93 Difference]: Finished difference Result 5168 states and 5693 transitions. [2019-12-07 17:27:33,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:27:33,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-12-07 17:27:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:33,603 INFO L225 Difference]: With dead ends: 5168 [2019-12-07 17:27:33,603 INFO L226 Difference]: Without dead ends: 3386 [2019-12-07 17:27:33,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:27:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2019-12-07 17:27:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3208. [2019-12-07 17:27:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-12-07 17:27:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3480 transitions. [2019-12-07 17:27:33,653 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3480 transitions. Word has length 526 [2019-12-07 17:27:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:33,654 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 3480 transitions. [2019-12-07 17:27:33,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:27:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3480 transitions. [2019-12-07 17:27:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-12-07 17:27:33,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:33,660 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:33,661 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1579274014, now seen corresponding path program 1 times [2019-12-07 17:27:33,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:33,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79793780] [2019-12-07 17:27:33,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-12-07 17:27:34,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79793780] [2019-12-07 17:27:34,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:34,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:27:34,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639187563] [2019-12-07 17:27:34,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:27:34,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:34,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:27:34,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:27:34,452 INFO L87 Difference]: Start difference. First operand 3208 states and 3480 transitions. Second operand 8 states. [2019-12-07 17:27:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:35,201 INFO L93 Difference]: Finished difference Result 6432 states and 6979 transitions. [2019-12-07 17:27:35,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:27:35,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 596 [2019-12-07 17:27:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:35,212 INFO L225 Difference]: With dead ends: 6432 [2019-12-07 17:27:35,212 INFO L226 Difference]: Without dead ends: 3404 [2019-12-07 17:27:35,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:27:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-12-07 17:27:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3208. [2019-12-07 17:27:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-12-07 17:27:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3476 transitions. [2019-12-07 17:27:35,256 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3476 transitions. Word has length 596 [2019-12-07 17:27:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:35,256 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 3476 transitions. [2019-12-07 17:27:35,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:27:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3476 transitions. [2019-12-07 17:27:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2019-12-07 17:27:35,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:35,261 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:35,261 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1906346804, now seen corresponding path program 1 times [2019-12-07 17:27:35,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:35,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144600941] [2019-12-07 17:27:35,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 687 proven. 45 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 17:27:36,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144600941] [2019-12-07 17:27:36,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135217586] [2019-12-07 17:27:36,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:36,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:27:36,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2019-12-07 17:27:36,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:27:36,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 17:27:36,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897481354] [2019-12-07 17:27:36,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:27:36,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:27:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:27:36,350 INFO L87 Difference]: Start difference. First operand 3208 states and 3476 transitions. Second operand 3 states. [2019-12-07 17:27:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:36,719 INFO L93 Difference]: Finished difference Result 7660 states and 8292 transitions. [2019-12-07 17:27:36,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:27:36,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 664 [2019-12-07 17:27:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:36,734 INFO L225 Difference]: With dead ends: 7660 [2019-12-07 17:27:36,734 INFO L226 Difference]: Without dead ends: 4632 [2019-12-07 17:27:36,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:27:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-12-07 17:27:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3920. [2019-12-07 17:27:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-12-07 17:27:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4194 transitions. [2019-12-07 17:27:36,785 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4194 transitions. Word has length 664 [2019-12-07 17:27:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:36,786 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4194 transitions. [2019-12-07 17:27:36,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:27:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4194 transitions. [2019-12-07 17:27:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-12-07 17:27:36,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:36,792 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2019-12-07 17:27:36,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:36,993 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:36,993 INFO L82 PathProgramCache]: Analyzing trace with hash 945691275, now seen corresponding path program 1 times [2019-12-07 17:27:36,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:36,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292389072] [2019-12-07 17:27:36,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 761 proven. 45 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2019-12-07 17:27:37,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292389072] [2019-12-07 17:27:37,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714182186] [2019-12-07 17:27:37,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:37,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:27:37,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1168 backedges. 806 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2019-12-07 17:27:38,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:27:38,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 17:27:38,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731214726] [2019-12-07 17:27:38,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:27:38,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:38,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:27:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:27:38,155 INFO L87 Difference]: Start difference. First operand 3920 states and 4194 transitions. Second operand 3 states. [2019-12-07 17:27:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:38,491 INFO L93 Difference]: Finished difference Result 8372 states and 8972 transitions. [2019-12-07 17:27:38,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:27:38,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-12-07 17:27:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:38,505 INFO L225 Difference]: With dead ends: 8372 [2019-12-07 17:27:38,505 INFO L226 Difference]: Without dead ends: 4632 [2019-12-07 17:27:38,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:27:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-12-07 17:27:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2019-12-07 17:27:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-12-07 17:27:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4933 transitions. [2019-12-07 17:27:38,551 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4933 transitions. Word has length 669 [2019-12-07 17:27:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:38,552 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4933 transitions. [2019-12-07 17:27:38,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:27:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4933 transitions. [2019-12-07 17:27:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2019-12-07 17:27:38,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:38,561 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-12-07 17:27:38,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:38,762 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:38,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:38,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1584602280, now seen corresponding path program 1 times [2019-12-07 17:27:38,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:38,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901556092] [2019-12-07 17:27:38,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 1172 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-12-07 17:27:39,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901556092] [2019-12-07 17:27:39,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:39,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:27:39,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404314823] [2019-12-07 17:27:39,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:27:39,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:39,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:27:39,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:27:39,140 INFO L87 Difference]: Start difference. First operand 4632 states and 4933 transitions. Second operand 3 states. [2019-12-07 17:27:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:39,579 INFO L93 Difference]: Finished difference Result 10330 states and 11011 transitions. [2019-12-07 17:27:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:27:39,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 714 [2019-12-07 17:27:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:39,598 INFO L225 Difference]: With dead ends: 10330 [2019-12-07 17:27:39,598 INFO L226 Difference]: Without dead ends: 5878 [2019-12-07 17:27:39,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:27:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-12-07 17:27:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5522. [2019-12-07 17:27:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-12-07 17:27:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5863 transitions. [2019-12-07 17:27:39,648 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5863 transitions. Word has length 714 [2019-12-07 17:27:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:39,649 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5863 transitions. [2019-12-07 17:27:39,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:27:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5863 transitions. [2019-12-07 17:27:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2019-12-07 17:27:39,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:39,657 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-12-07 17:27:39,657 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1269972873, now seen corresponding path program 1 times [2019-12-07 17:27:39,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:39,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712794852] [2019-12-07 17:27:39,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2103 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-12-07 17:27:40,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712794852] [2019-12-07 17:27:40,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:40,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:27:40,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041690649] [2019-12-07 17:27:40,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:27:40,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:27:40,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:27:40,105 INFO L87 Difference]: Start difference. First operand 5522 states and 5863 transitions. Second operand 3 states. [2019-12-07 17:27:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:40,473 INFO L93 Difference]: Finished difference Result 10864 states and 11541 transitions. [2019-12-07 17:27:40,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:27:40,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 786 [2019-12-07 17:27:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:40,483 INFO L225 Difference]: With dead ends: 10864 [2019-12-07 17:27:40,484 INFO L226 Difference]: Without dead ends: 5522 [2019-12-07 17:27:40,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:27:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2019-12-07 17:27:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5522. [2019-12-07 17:27:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-12-07 17:27:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5834 transitions. [2019-12-07 17:27:40,532 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5834 transitions. Word has length 786 [2019-12-07 17:27:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:40,532 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5834 transitions. [2019-12-07 17:27:40,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:27:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5834 transitions. [2019-12-07 17:27:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2019-12-07 17:27:40,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:40,539 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:40,539 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:40,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash -928636369, now seen corresponding path program 1 times [2019-12-07 17:27:40,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:40,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639588521] [2019-12-07 17:27:40,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1135 proven. 4 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2019-12-07 17:27:41,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639588521] [2019-12-07 17:27:41,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686027822] [2019-12-07 17:27:41,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:41,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:27:41,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1116 proven. 23 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2019-12-07 17:27:42,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:27:42,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-12-07 17:27:42,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942911162] [2019-12-07 17:27:42,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:27:42,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:42,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:27:42,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:27:42,318 INFO L87 Difference]: Start difference. First operand 5522 states and 5834 transitions. Second operand 8 states. [2019-12-07 17:27:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:43,233 INFO L93 Difference]: Finished difference Result 11485 states and 12113 transitions. [2019-12-07 17:27:43,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:27:43,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 870 [2019-12-07 17:27:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:43,239 INFO L225 Difference]: With dead ends: 11485 [2019-12-07 17:27:43,239 INFO L226 Difference]: Without dead ends: 6143 [2019-12-07 17:27:43,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:27:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2019-12-07 17:27:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5522. [2019-12-07 17:27:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-12-07 17:27:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5833 transitions. [2019-12-07 17:27:43,290 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5833 transitions. Word has length 870 [2019-12-07 17:27:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:43,290 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5833 transitions. [2019-12-07 17:27:43,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:27:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5833 transitions. [2019-12-07 17:27:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2019-12-07 17:27:43,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:43,297 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:27:43,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:43,498 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:43,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash -754416928, now seen corresponding path program 1 times [2019-12-07 17:27:43,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:43,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481145601] [2019-12-07 17:27:43,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1955 proven. 0 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2019-12-07 17:27:45,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481145601] [2019-12-07 17:27:45,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:45,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:27:45,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188177353] [2019-12-07 17:27:45,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:27:45,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:45,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:27:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:27:45,014 INFO L87 Difference]: Start difference. First operand 5522 states and 5833 transitions. Second operand 7 states. [2019-12-07 17:27:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:45,814 INFO L93 Difference]: Finished difference Result 11223 states and 11847 transitions. [2019-12-07 17:27:45,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:27:45,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 959 [2019-12-07 17:27:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:45,820 INFO L225 Difference]: With dead ends: 11223 [2019-12-07 17:27:45,820 INFO L226 Difference]: Without dead ends: 5881 [2019-12-07 17:27:45,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:27:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2019-12-07 17:27:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5522. [2019-12-07 17:27:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-12-07 17:27:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5828 transitions. [2019-12-07 17:27:45,868 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5828 transitions. Word has length 959 [2019-12-07 17:27:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:45,868 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5828 transitions. [2019-12-07 17:27:45,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:27:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5828 transitions. [2019-12-07 17:27:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2019-12-07 17:27:45,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:45,876 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:27:45,876 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1310024199, now seen corresponding path program 1 times [2019-12-07 17:27:45,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:45,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132475251] [2019-12-07 17:27:45,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 2408 proven. 140 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-12-07 17:27:46,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132475251] [2019-12-07 17:27:46,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945076291] [2019-12-07 17:27:46,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:46,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:27:46,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:46,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:46,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 2485 proven. 616 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-12-07 17:27:47,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:27:47,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-07 17:27:47,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574578339] [2019-12-07 17:27:47,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:27:47,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:47,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:27:47,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:27:47,639 INFO L87 Difference]: Start difference. First operand 5522 states and 5828 transitions. Second operand 7 states. [2019-12-07 17:27:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:48,932 INFO L93 Difference]: Finished difference Result 12288 states and 12967 transitions. [2019-12-07 17:27:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:27:48,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1036 [2019-12-07 17:27:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:48,938 INFO L225 Difference]: With dead ends: 12288 [2019-12-07 17:27:48,939 INFO L226 Difference]: Without dead ends: 6946 [2019-12-07 17:27:48,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 1037 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:27:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-12-07 17:27:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5878. [2019-12-07 17:27:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-12-07 17:27:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6137 transitions. [2019-12-07 17:27:48,990 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6137 transitions. Word has length 1036 [2019-12-07 17:27:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:48,991 INFO L462 AbstractCegarLoop]: Abstraction has 5878 states and 6137 transitions. [2019-12-07 17:27:48,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:27:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6137 transitions. [2019-12-07 17:27:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1184 [2019-12-07 17:27:48,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:48,999 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:27:49,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:49,200 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:49,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1616010734, now seen corresponding path program 1 times [2019-12-07 17:27:49,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:49,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855771657] [2019-12-07 17:27:49,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2672 proven. 6 refuted. 0 times theorem prover too weak. 1985 trivial. 0 not checked. [2019-12-07 17:27:50,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855771657] [2019-12-07 17:27:50,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882584032] [2019-12-07 17:27:50,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:50,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:27:50,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 1978 proven. 0 refuted. 0 times theorem prover too weak. 2685 trivial. 0 not checked. [2019-12-07 17:27:51,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:27:51,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 17:27:51,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226421132] [2019-12-07 17:27:51,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:27:51,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:51,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:27:51,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:27:51,593 INFO L87 Difference]: Start difference. First operand 5878 states and 6137 transitions. Second operand 4 states. [2019-12-07 17:27:52,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:52,076 INFO L93 Difference]: Finished difference Result 11754 states and 12278 transitions. [2019-12-07 17:27:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:27:52,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1183 [2019-12-07 17:27:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:52,080 INFO L225 Difference]: With dead ends: 11754 [2019-12-07 17:27:52,080 INFO L226 Difference]: Without dead ends: 6056 [2019-12-07 17:27:52,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1187 GetRequests, 1182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:27:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-12-07 17:27:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2019-12-07 17:27:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-12-07 17:27:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6304 transitions. [2019-12-07 17:27:52,124 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6304 transitions. Word has length 1183 [2019-12-07 17:27:52,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:52,124 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6304 transitions. [2019-12-07 17:27:52,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:27:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6304 transitions. [2019-12-07 17:27:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1605 [2019-12-07 17:27:52,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:52,139 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:52,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:27:52,340 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:52,341 INFO L82 PathProgramCache]: Analyzing trace with hash 836341823, now seen corresponding path program 1 times [2019-12-07 17:27:52,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:52,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546003801] [2019-12-07 17:27:52,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8329 backedges. 2654 proven. 0 refuted. 0 times theorem prover too weak. 5675 trivial. 0 not checked. [2019-12-07 17:27:54,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546003801] [2019-12-07 17:27:54,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:54,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:27:54,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138998394] [2019-12-07 17:27:54,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:27:54,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:54,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:27:54,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:27:54,669 INFO L87 Difference]: Start difference. First operand 6056 states and 6304 transitions. Second operand 7 states. [2019-12-07 17:27:55,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:55,449 INFO L93 Difference]: Finished difference Result 12052 states and 12547 transitions. [2019-12-07 17:27:55,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:27:55,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1604 [2019-12-07 17:27:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:55,457 INFO L225 Difference]: With dead ends: 12052 [2019-12-07 17:27:55,457 INFO L226 Difference]: Without dead ends: 6056 [2019-12-07 17:27:55,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:27:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-12-07 17:27:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2019-12-07 17:27:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-12-07 17:27:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6297 transitions. [2019-12-07 17:27:55,518 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6297 transitions. Word has length 1604 [2019-12-07 17:27:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:55,519 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6297 transitions. [2019-12-07 17:27:55,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:27:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6297 transitions. [2019-12-07 17:27:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1636 [2019-12-07 17:27:55,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:55,534 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:55,534 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1212840288, now seen corresponding path program 1 times [2019-12-07 17:27:55,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:55,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887239785] [2019-12-07 17:27:55,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8526 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 8046 trivial. 0 not checked. [2019-12-07 17:27:57,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887239785] [2019-12-07 17:27:57,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:57,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:27:57,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418955145] [2019-12-07 17:27:57,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:27:57,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:27:57,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:27:57,022 INFO L87 Difference]: Start difference. First operand 6056 states and 6297 transitions. Second operand 4 states. [2019-12-07 17:27:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:57,521 INFO L93 Difference]: Finished difference Result 11932 states and 12413 transitions. [2019-12-07 17:27:57,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:27:57,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1635 [2019-12-07 17:27:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:57,526 INFO L225 Difference]: With dead ends: 11932 [2019-12-07 17:27:57,526 INFO L226 Difference]: Without dead ends: 6056 [2019-12-07 17:27:57,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:27:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-12-07 17:27:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2019-12-07 17:27:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-12-07 17:27:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6270 transitions. [2019-12-07 17:27:57,567 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6270 transitions. Word has length 1635 [2019-12-07 17:27:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:57,569 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6270 transitions. [2019-12-07 17:27:57,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:27:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6270 transitions. [2019-12-07 17:27:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1672 [2019-12-07 17:27:57,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:57,591 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:57,591 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1342838487, now seen corresponding path program 1 times [2019-12-07 17:27:57,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:57,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283251623] [2019-12-07 17:27:57,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8572 backedges. 2675 proven. 0 refuted. 0 times theorem prover too weak. 5897 trivial. 0 not checked. [2019-12-07 17:28:00,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283251623] [2019-12-07 17:28:00,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:00,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:28:00,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85895518] [2019-12-07 17:28:00,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:00,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:00,286 INFO L87 Difference]: Start difference. First operand 6056 states and 6270 transitions. Second operand 7 states. [2019-12-07 17:28:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:00,985 INFO L93 Difference]: Finished difference Result 12052 states and 12479 transitions. [2019-12-07 17:28:00,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:28:00,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1671 [2019-12-07 17:28:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:00,990 INFO L225 Difference]: With dead ends: 12052 [2019-12-07 17:28:00,990 INFO L226 Difference]: Without dead ends: 6056 [2019-12-07 17:28:00,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-12-07 17:28:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2019-12-07 17:28:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-12-07 17:28:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6266 transitions. [2019-12-07 17:28:01,030 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6266 transitions. Word has length 1671 [2019-12-07 17:28:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:01,031 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6266 transitions. [2019-12-07 17:28:01,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6266 transitions. [2019-12-07 17:28:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1730 [2019-12-07 17:28:01,046 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:01,047 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:01,047 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:01,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 19375012, now seen corresponding path program 1 times [2019-12-07 17:28:01,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:01,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073917975] [2019-12-07 17:28:01,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 6624 proven. 30 refuted. 0 times theorem prover too weak. 3121 trivial. 0 not checked. [2019-12-07 17:28:03,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073917975] [2019-12-07 17:28:03,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143996359] [2019-12-07 17:28:03,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:03,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:28:03,926 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 2962 proven. 0 refuted. 0 times theorem prover too weak. 6813 trivial. 0 not checked. [2019-12-07 17:28:06,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:28:06,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 17:28:06,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410705556] [2019-12-07 17:28:06,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:06,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:28:06,225 INFO L87 Difference]: Start difference. First operand 6056 states and 6266 transitions. Second operand 4 states. [2019-12-07 17:28:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:06,739 INFO L93 Difference]: Finished difference Result 12288 states and 12719 transitions. [2019-12-07 17:28:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:06,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1729 [2019-12-07 17:28:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:06,743 INFO L225 Difference]: With dead ends: 12288 [2019-12-07 17:28:06,743 INFO L226 Difference]: Without dead ends: 6412 [2019-12-07 17:28:06,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1738 GetRequests, 1729 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:28:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-12-07 17:28:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6056. [2019-12-07 17:28:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-12-07 17:28:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6260 transitions. [2019-12-07 17:28:06,784 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6260 transitions. Word has length 1729 [2019-12-07 17:28:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:06,785 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6260 transitions. [2019-12-07 17:28:06,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6260 transitions. [2019-12-07 17:28:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1818 [2019-12-07 17:28:06,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:06,802 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:07,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:07,003 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1727618608, now seen corresponding path program 1 times [2019-12-07 17:28:07,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:07,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64900392] [2019-12-07 17:28:07,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 2784 proven. 0 refuted. 0 times theorem prover too weak. 8151 trivial. 0 not checked. [2019-12-07 17:28:08,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64900392] [2019-12-07 17:28:08,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:08,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:28:08,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817369392] [2019-12-07 17:28:08,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:28:08,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:28:08,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:08,996 INFO L87 Difference]: Start difference. First operand 6056 states and 6260 transitions. Second operand 5 states. [2019-12-07 17:28:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:09,722 INFO L93 Difference]: Finished difference Result 14246 states and 14781 transitions. [2019-12-07 17:28:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:28:09,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1817 [2019-12-07 17:28:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:09,728 INFO L225 Difference]: With dead ends: 14246 [2019-12-07 17:28:09,728 INFO L226 Difference]: Without dead ends: 8370 [2019-12-07 17:28:09,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 17:28:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8370 states. [2019-12-07 17:28:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8370 to 6768. [2019-12-07 17:28:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6768 states. [2019-12-07 17:28:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 7050 transitions. [2019-12-07 17:28:09,777 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 7050 transitions. Word has length 1817 [2019-12-07 17:28:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:09,778 INFO L462 AbstractCegarLoop]: Abstraction has 6768 states and 7050 transitions. [2019-12-07 17:28:09,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:28:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 7050 transitions. [2019-12-07 17:28:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1961 [2019-12-07 17:28:09,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:09,798 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:09,798 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash 798478165, now seen corresponding path program 1 times [2019-12-07 17:28:09,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:09,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000730130] [2019-12-07 17:28:09,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12664 backedges. 4301 proven. 0 refuted. 0 times theorem prover too weak. 8363 trivial. 0 not checked. [2019-12-07 17:28:13,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000730130] [2019-12-07 17:28:13,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:13,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:28:13,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136900292] [2019-12-07 17:28:13,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:13,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:13,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:13,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:13,383 INFO L87 Difference]: Start difference. First operand 6768 states and 7050 transitions. Second operand 7 states. [2019-12-07 17:28:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:13,918 INFO L93 Difference]: Finished difference Result 13337 states and 13885 transitions. [2019-12-07 17:28:13,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:28:13,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1960 [2019-12-07 17:28:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:13,923 INFO L225 Difference]: With dead ends: 13337 [2019-12-07 17:28:13,923 INFO L226 Difference]: Without dead ends: 6412 [2019-12-07 17:28:13,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-12-07 17:28:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6412. [2019-12-07 17:28:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6412 states. [2019-12-07 17:28:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 6665 transitions. [2019-12-07 17:28:13,969 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 6665 transitions. Word has length 1960 [2019-12-07 17:28:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:13,970 INFO L462 AbstractCegarLoop]: Abstraction has 6412 states and 6665 transitions. [2019-12-07 17:28:13,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 6665 transitions. [2019-12-07 17:28:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1988 [2019-12-07 17:28:13,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:13,991 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:13,991 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:13,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:13,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1196899044, now seen corresponding path program 1 times [2019-12-07 17:28:13,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:13,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867700662] [2019-12-07 17:28:13,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12745 backedges. 4293 proven. 0 refuted. 0 times theorem prover too weak. 8452 trivial. 0 not checked. [2019-12-07 17:28:17,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867700662] [2019-12-07 17:28:17,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:17,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:28:17,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767348616] [2019-12-07 17:28:17,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:17,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:17,646 INFO L87 Difference]: Start difference. First operand 6412 states and 6665 transitions. Second operand 7 states. [2019-12-07 17:28:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:18,252 INFO L93 Difference]: Finished difference Result 12791 states and 13295 transitions. [2019-12-07 17:28:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:28:18,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1987 [2019-12-07 17:28:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:18,262 INFO L225 Difference]: With dead ends: 12791 [2019-12-07 17:28:18,262 INFO L226 Difference]: Without dead ends: 6234 [2019-12-07 17:28:18,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2019-12-07 17:28:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 6234. [2019-12-07 17:28:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2019-12-07 17:28:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6464 transitions. [2019-12-07 17:28:18,319 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6464 transitions. Word has length 1987 [2019-12-07 17:28:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:18,320 INFO L462 AbstractCegarLoop]: Abstraction has 6234 states and 6464 transitions. [2019-12-07 17:28:18,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6464 transitions. [2019-12-07 17:28:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2019 [2019-12-07 17:28:18,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:18,339 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:18,339 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1233211586, now seen corresponding path program 1 times [2019-12-07 17:28:18,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:18,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531740420] [2019-12-07 17:28:18,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 9262 proven. 695 refuted. 0 times theorem prover too weak. 3867 trivial. 0 not checked. [2019-12-07 17:28:23,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531740420] [2019-12-07 17:28:23,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538392861] [2019-12-07 17:28:23,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:24,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 2442 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:28:24,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:24,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 9347 proven. 184 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2019-12-07 17:28:28,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:28:28,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-12-07 17:28:28,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470803306] [2019-12-07 17:28:28,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:28:28,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:28:28,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:28:28,888 INFO L87 Difference]: Start difference. First operand 6234 states and 6464 transitions. Second operand 9 states. [2019-12-07 17:28:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:30,513 INFO L93 Difference]: Finished difference Result 12915 states and 13377 transitions. [2019-12-07 17:28:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:28:30,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2018 [2019-12-07 17:28:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:30,519 INFO L225 Difference]: With dead ends: 12915 [2019-12-07 17:28:30,519 INFO L226 Difference]: Without dead ends: 6683 [2019-12-07 17:28:30,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2029 GetRequests, 2016 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:28:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2019-12-07 17:28:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 5878. [2019-12-07 17:28:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-12-07 17:28:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6023 transitions. [2019-12-07 17:28:30,568 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6023 transitions. Word has length 2018 [2019-12-07 17:28:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:30,569 INFO L462 AbstractCegarLoop]: Abstraction has 5878 states and 6023 transitions. [2019-12-07 17:28:30,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:28:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6023 transitions. [2019-12-07 17:28:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2031 [2019-12-07 17:28:30,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:30,588 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:28:30,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:28:30,789 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1944323812, now seen corresponding path program 1 times [2019-12-07 17:28:30,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:30,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459730876] [2019-12-07 17:28:30,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13982 backedges. 4475 proven. 0 refuted. 0 times theorem prover too weak. 9507 trivial. 0 not checked. [2019-12-07 17:28:34,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459730876] [2019-12-07 17:28:34,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:34,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:34,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480904645] [2019-12-07 17:28:34,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:34,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:34,340 INFO L87 Difference]: Start difference. First operand 5878 states and 6023 transitions. Second operand 4 states. [2019-12-07 17:28:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:34,715 INFO L93 Difference]: Finished difference Result 11588 states and 11869 transitions. [2019-12-07 17:28:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:34,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2030 [2019-12-07 17:28:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:34,719 INFO L225 Difference]: With dead ends: 11588 [2019-12-07 17:28:34,720 INFO L226 Difference]: Without dead ends: 5700 [2019-12-07 17:28:34,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-12-07 17:28:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5700. [2019-12-07 17:28:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-12-07 17:28:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 5833 transitions. [2019-12-07 17:28:34,758 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 5833 transitions. Word has length 2030 [2019-12-07 17:28:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:34,759 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 5833 transitions. [2019-12-07 17:28:34,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 5833 transitions. [2019-12-07 17:28:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2019-12-07 17:28:34,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:34,779 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:34,779 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:34,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2140269625, now seen corresponding path program 1 times [2019-12-07 17:28:34,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:34,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742584487] [2019-12-07 17:28:34,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14529 backedges. 3210 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-12-07 17:28:38,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742584487] [2019-12-07 17:28:38,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:38,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:28:38,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595352032] [2019-12-07 17:28:38,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:28:38,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:38,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:28:38,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:38,856 INFO L87 Difference]: Start difference. First operand 5700 states and 5833 transitions. Second operand 5 states. [2019-12-07 17:28:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:40,060 INFO L93 Difference]: Finished difference Result 11396 states and 11663 transitions. [2019-12-07 17:28:40,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:40,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2119 [2019-12-07 17:28:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:40,061 INFO L225 Difference]: With dead ends: 11396 [2019-12-07 17:28:40,061 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:28:40,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 17:28:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:28:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:28:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:28:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:28:40,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2119 [2019-12-07 17:28:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:40,065 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:28:40,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:28:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:28:40,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:28:40,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:28:40,342 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 412 DAG size of output: 289 [2019-12-07 17:28:40,565 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 412 DAG size of output: 289 [2019-12-07 17:28:41,891 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 250 DAG size of output: 105 [2019-12-07 17:28:43,186 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 250 DAG size of output: 105 [2019-12-07 17:28:43,189 INFO L246 CegarLoopResult]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-12-07 17:28:43,189 INFO L246 CegarLoopResult]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-12-07 17:28:43,189 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-12-07 17:28:43,190 INFO L246 CegarLoopResult]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 17:28:43,191 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,192 INFO L246 CegarLoopResult]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,193 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-12-07 17:28:43,194 INFO L246 CegarLoopResult]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 17:28:43,195 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 17:28:43,196 INFO L246 CegarLoopResult]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,197 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L242 CegarLoopResult]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse14 (<= ~a21~0 6)) (.cse0 (< 11 ~a12~0)) (.cse8 (<= 10 ~a21~0)) (.cse2 (<= ~a15~0 8))) (let ((.cse5 (<= (+ ~a12~0 44) 0)) (.cse7 (= ~a15~0 9)) (.cse17 (or (and .cse0 .cse2 .cse14) (and .cse0 .cse8 .cse2))) (.cse20 (= ~a21~0 6)) (.cse16 (= ~a15~0 5)) (.cse19 (<= ~a12~0 586307)) (.cse4 (= ~a21~0 9)) (.cse21 (= ~a15~0 6)) (.cse12 (let ((.cse23 (div (+ ~a12~0 (- 600066)) 5))) (or (and (let ((.cse22 (+ ~a12~0 4))) (= (* (div .cse22 5) 5) .cse22)) (<= (+ .cse23 13) 0)) (<= (+ .cse23 14) 0)))) (.cse6 (= ~a21~0 8)) (.cse3 (= ~a15~0 7)) (.cse15 (= ~a21~0 10)) (.cse18 (< 80 ~a12~0)) (.cse9 (= ~a15~0 8)) (.cse1 (= ~a24~0 1)) (.cse13 (= ~a21~0 7)) (.cse10 (<= ~a12~0 11)) (.cse11 (< 0 (+ ~a12~0 43)))) (or (and (<= ~a12~0 80) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse4) (and .cse5 .cse1 .cse6 .cse7) (and .cse5 .cse1 .cse6 .cse2) (and .cse5 .cse8 .cse1 .cse2) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse9 .cse1 .cse10 .cse4 .cse11) (and .cse8 .cse1 .cse12 .cse7 .cse11) (and .cse8 .cse1 .cse10 .cse2 .cse11) (and (or (and .cse7 .cse6 .cse11) (and .cse0 .cse13 .cse7)) .cse1 .cse12) (and (<= (+ ~a12~0 9352) 0) .cse2 .cse14) (and .cse5 .cse1 .cse13 .cse2) (and .cse1 .cse15 .cse16 .cse17) (and .cse5 (not .cse3) .cse1 .cse2) (and .cse1 .cse12 .cse7 .cse18 .cse4) (and .cse5 .cse1 .cse2 .cse14) (and .cse5 .cse8 .cse1 .cse7) (and .cse0 .cse1 .cse19 .cse7 .cse14) (and .cse20 .cse1 .cse17 .cse21) (and (or (and .cse0 .cse9 .cse8 .cse1) (and .cse1 .cse17 .cse14)) .cse12) (and .cse20 .cse1 .cse16) (and .cse1 .cse10 .cse2 .cse14 .cse11) (and .cse1 .cse19 .cse4 .cse21) (and .cse0 .cse1 .cse12 .cse6 .cse2) (and .cse3 .cse1 .cse15 .cse18) (and .cse9 .cse1 .cse13 .cse10 .cse11)))) [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L249 CegarLoopResult]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-12-07 17:28:43,198 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L242 CegarLoopResult]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse14 (<= ~a21~0 6)) (.cse0 (< 11 ~a12~0)) (.cse8 (<= 10 ~a21~0)) (.cse2 (<= ~a15~0 8))) (let ((.cse5 (<= (+ ~a12~0 44) 0)) (.cse7 (= ~a15~0 9)) (.cse17 (or (and .cse0 .cse2 .cse14) (and .cse0 .cse8 .cse2))) (.cse20 (= ~a21~0 6)) (.cse16 (= ~a15~0 5)) (.cse19 (<= ~a12~0 586307)) (.cse4 (= ~a21~0 9)) (.cse21 (= ~a15~0 6)) (.cse12 (let ((.cse23 (div (+ ~a12~0 (- 600066)) 5))) (or (and (let ((.cse22 (+ ~a12~0 4))) (= (* (div .cse22 5) 5) .cse22)) (<= (+ .cse23 13) 0)) (<= (+ .cse23 14) 0)))) (.cse6 (= ~a21~0 8)) (.cse3 (= ~a15~0 7)) (.cse15 (= ~a21~0 10)) (.cse18 (< 80 ~a12~0)) (.cse9 (= ~a15~0 8)) (.cse1 (= ~a24~0 1)) (.cse13 (= ~a21~0 7)) (.cse10 (<= ~a12~0 11)) (.cse11 (< 0 (+ ~a12~0 43)))) (or (and (<= ~a12~0 80) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse4) (and .cse5 .cse1 .cse6 .cse7) (and .cse5 .cse1 .cse6 .cse2) (and .cse5 .cse8 .cse1 .cse2) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse9 .cse1 .cse10 .cse4 .cse11) (and .cse8 .cse1 .cse12 .cse7 .cse11) (and .cse8 .cse1 .cse10 .cse2 .cse11) (and (or (and .cse7 .cse6 .cse11) (and .cse0 .cse13 .cse7)) .cse1 .cse12) (and (<= (+ ~a12~0 9352) 0) .cse2 .cse14) (and .cse5 .cse1 .cse13 .cse2) (and .cse1 .cse15 .cse16 .cse17) (and .cse5 (not .cse3) .cse1 .cse2) (and .cse1 .cse12 .cse7 .cse18 .cse4) (and .cse5 .cse1 .cse2 .cse14) (and .cse5 .cse8 .cse1 .cse7) (and .cse0 .cse1 .cse19 .cse7 .cse14) (and .cse20 .cse1 .cse17 .cse21) (and (or (and .cse0 .cse9 .cse8 .cse1) (and .cse1 .cse17 .cse14)) .cse12) (and .cse20 .cse1 .cse16) (and .cse1 .cse10 .cse2 .cse14 .cse11) (and .cse1 .cse19 .cse4 .cse21) (and .cse0 .cse1 .cse12 .cse6 .cse2) (and .cse3 .cse1 .cse15 .cse18) (and .cse9 .cse1 .cse13 .cse10 .cse11)))) [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-12-07 17:28:43,199 INFO L246 CegarLoopResult]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L885(line 885) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,200 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-12-07 17:28:43,201 INFO L246 CegarLoopResult]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 17:28:43,202 INFO L246 CegarLoopResult]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-12-07 17:28:43,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:28:43 BoogieIcfgContainer [2019-12-07 17:28:43,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:28:43,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:28:43,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:28:43,234 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:28:43,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:25" (3/4) ... [2019-12-07 17:28:43,237 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:28:43,253 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:28:43,254 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:28:43,348 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_26137ae5-f34b-4da2-96fe-7d6728f18aef/bin/uautomizer/witness.graphml [2019-12-07 17:28:43,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:28:43,349 INFO L168 Benchmark]: Toolchain (without parser) took 79444.51 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 934.4 MB in the beginning and 897.2 MB in the end (delta: 37.3 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 17:28:43,349 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:28:43,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:43,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.23 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:43,350 INFO L168 Benchmark]: Boogie Preprocessor took 56.16 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:43,350 INFO L168 Benchmark]: RCFGBuilder took 789.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.9 MB in the end (delta: 132.2 MB). Peak memory consumption was 132.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:43,350 INFO L168 Benchmark]: TraceAbstraction took 78039.83 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 956.9 MB in the beginning and 917.2 MB in the end (delta: 39.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 17:28:43,350 INFO L168 Benchmark]: Witness Printer took 114.07 ms. Allocated memory is still 4.0 GB. Free memory was 917.2 MB in the beginning and 897.2 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:43,352 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.23 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.16 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 789.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.9 MB in the end (delta: 132.2 MB). Peak memory consumption was 132.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78039.83 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 956.9 MB in the beginning and 917.2 MB in the end (delta: 39.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 114.07 ms. Allocated memory is still 4.0 GB. Free memory was 917.2 MB in the beginning and 897.2 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a12 <= 80 && 11 < a12) && a24 == 1) && a15 <= 8) || (((a15 == 7 && 11 < a12) && a24 == 1) && a21 == 9)) || (((a12 + 44 <= 0 && a24 == 1) && a21 == 8) && a15 == 9)) || (((a12 + 44 <= 0 && a24 == 1) && a21 == 8) && a15 <= 8)) || (((a12 + 44 <= 0 && 10 <= a21) && a24 == 1) && a15 <= 8)) || (((((!(5 == input) && a15 == 8) && a24 == 1) && a12 <= 11) && a21 == 9) && 0 < a12 + 43)) || ((((10 <= a21 && a24 == 1) && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0)) && a15 == 9) && 0 < a12 + 43)) || ((((10 <= a21 && a24 == 1) && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((((a15 == 9 && a21 == 8) && 0 < a12 + 43) || ((11 < a12 && a21 == 7) && a15 == 9)) && a24 == 1) && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || ((a12 + 9352 <= 0 && a15 <= 8) && a21 <= 6)) || (((a12 + 44 <= 0 && a24 == 1) && a21 == 7) && a15 <= 8)) || (((a24 == 1 && a21 == 10) && a15 == 5) && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8)))) || (((a12 + 44 <= 0 && !(a15 == 7)) && a24 == 1) && a15 <= 8)) || ((((a24 == 1 && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0)) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a12 + 44 <= 0 && a24 == 1) && a15 <= 8) && a21 <= 6)) || (((a12 + 44 <= 0 && 10 <= a21) && a24 == 1) && a15 == 9)) || ((((11 < a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || (((a21 == 6 && a24 == 1) && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8))) && a15 == 6)) || (((((11 < a12 && a15 == 8) && 10 <= a21) && a24 == 1) || ((a24 == 1 && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8))) && a21 <= 6)) && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a12 <= 11) && a15 <= 8) && a21 <= 6) && 0 < a12 + 43)) || (((a24 == 1 && a12 <= 586307) && a21 == 9) && a15 == 6)) || ((((11 < a12 && a24 == 1) && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0)) && a21 == 8) && a15 <= 8)) || (((a15 == 7 && a24 == 1) && a21 == 10) && 80 < a12)) || ((((a15 == 8 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a12 <= 80 && 11 < a12) && a24 == 1) && a15 <= 8) || (((a15 == 7 && 11 < a12) && a24 == 1) && a21 == 9)) || (((a12 + 44 <= 0 && a24 == 1) && a21 == 8) && a15 == 9)) || (((a12 + 44 <= 0 && a24 == 1) && a21 == 8) && a15 <= 8)) || (((a12 + 44 <= 0 && 10 <= a21) && a24 == 1) && a15 <= 8)) || (((((!(5 == input) && a15 == 8) && a24 == 1) && a12 <= 11) && a21 == 9) && 0 < a12 + 43)) || ((((10 <= a21 && a24 == 1) && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0)) && a15 == 9) && 0 < a12 + 43)) || ((((10 <= a21 && a24 == 1) && a12 <= 11) && a15 <= 8) && 0 < a12 + 43)) || (((((a15 == 9 && a21 == 8) && 0 < a12 + 43) || ((11 < a12 && a21 == 7) && a15 == 9)) && a24 == 1) && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || ((a12 + 9352 <= 0 && a15 <= 8) && a21 <= 6)) || (((a12 + 44 <= 0 && a24 == 1) && a21 == 7) && a15 <= 8)) || (((a24 == 1 && a21 == 10) && a15 == 5) && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8)))) || (((a12 + 44 <= 0 && !(a15 == 7)) && a24 == 1) && a15 <= 8)) || ((((a24 == 1 && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0)) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a12 + 44 <= 0 && a24 == 1) && a15 <= 8) && a21 <= 6)) || (((a12 + 44 <= 0 && 10 <= a21) && a24 == 1) && a15 == 9)) || ((((11 < a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || (((a21 == 6 && a24 == 1) && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8))) && a15 == 6)) || (((((11 < a12 && a15 == 8) && 10 <= a21) && a24 == 1) || ((a24 == 1 && (((11 < a12 && a15 <= 8) && a21 <= 6) || ((11 < a12 && 10 <= a21) && a15 <= 8))) && a21 <= 6)) && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a12 <= 11) && a15 <= 8) && a21 <= 6) && 0 < a12 + 43)) || (((a24 == 1 && a12 <= 586307) && a21 == 9) && a15 == 6)) || ((((11 < a12 && a24 == 1) && (((a12 + 4) / 5 * 5 == a12 + 4 && (a12 + -600066) / 5 + 13 <= 0) || (a12 + -600066) / 5 + 14 <= 0)) && a21 == 8) && a15 <= 8)) || (((a15 == 7 && a24 == 1) && a21 == 10) && 80 < a12)) || ((((a15 == 8 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 74.8s, OverallIterations: 26, TraceHistogramMax: 18, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, HoareTripleCheckerStatistics: 1329 SDtfs, 6784 SDslu, 373 SDs, 0 SdLazy, 23913 SolverSat, 2220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9588 GetRequests, 9447 SyntacticMatches, 12 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6768occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 6965 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 98 NumberOfFragments, 1203 HoareAnnotationTreeSize, 3 FomulaSimplifications, 47056 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 29258 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 37508 NumberOfCodeBlocks, 37508 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 37471 ConstructedInterpolants, 0 QuantifiedInterpolants, 170070112 SizeOfPredicates, 20 NumberOfNonLiveVariables, 11640 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 37 InterpolantComputations, 23 PerfectInterpolantSequences, 172138/174003 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...