./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2cbbf56a13532141372a32a461d64a9d1351c0e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:40,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:40,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:40,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:40,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:40,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:40,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:40,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:40,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:40,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:40,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:40,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:40,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:40,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:40,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:40,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:40,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:40,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:40,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:40,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:40,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:40,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:40,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:40,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:40,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:40,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:40,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:40,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:40,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:40,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:40,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:40,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:40,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:40,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:40,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:40,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:40,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:40,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:40,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:40,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:40,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:40,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:40,506 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:40,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:40,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:40,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:40,512 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:40,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:40,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:40,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:40,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:40,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:40,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:40,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:40,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:40,518 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:40,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:40,518 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:40,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:40,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:40,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:40,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:40,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:40,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:40,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:40,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:40,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:40,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:40,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:40,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:40,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:40,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-11-28 15:40:40,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:40,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:40,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:40,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:40,922 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:40,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2019-11-28 15:40:41,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3679e8b20/6075c665cd4248a1bfe18990894c4b17/FLAG508aab49e [2019-11-28 15:40:41,457 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:41,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2019-11-28 15:40:41,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3679e8b20/6075c665cd4248a1bfe18990894c4b17/FLAG508aab49e [2019-11-28 15:40:41,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3679e8b20/6075c665cd4248a1bfe18990894c4b17 [2019-11-28 15:40:41,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:41,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:41,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:41,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:41,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:41,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:41" (1/1) ... [2019-11-28 15:40:41,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5731ad06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:41, skipping insertion in model container [2019-11-28 15:40:41,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:41" (1/1) ... [2019-11-28 15:40:41,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:41,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:42,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:42,108 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:42,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:42,183 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:42,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42 WrapperNode [2019-11-28 15:40:42,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:42,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:42,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:42,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:42,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:42,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:42,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:42,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:42,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... [2019-11-28 15:40:42,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:42,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:42,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:42,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:42,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:42,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:42,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:42,722 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:42,723 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 15:40:42,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:42 BoogieIcfgContainer [2019-11-28 15:40:42,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:42,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:42,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:42,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:42,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:41" (1/3) ... [2019-11-28 15:40:42,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ddc437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:42, skipping insertion in model container [2019-11-28 15:40:42,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:42" (2/3) ... [2019-11-28 15:40:42,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ddc437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:42, skipping insertion in model container [2019-11-28 15:40:42,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:42" (3/3) ... [2019-11-28 15:40:42,734 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-11-28 15:40:42,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:42,755 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:42,769 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:42,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:42,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:42,811 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:42,811 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:42,811 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:42,812 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:42,812 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:42,812 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-28 15:40:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:40:42,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,838 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2043472865, now seen corresponding path program 1 times [2019-11-28 15:40:42,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426992526] [2019-11-28 15:40:42,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426992526] [2019-11-28 15:40:43,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353659785] [2019-11-28 15:40:43,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,059 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-11-28 15:40:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,121 INFO L93 Difference]: Finished difference Result 70 states and 120 transitions. [2019-11-28 15:40:43,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 15:40:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,138 INFO L225 Difference]: With dead ends: 70 [2019-11-28 15:40:43,138 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 15:40:43,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 15:40:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-11-28 15:40:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 15:40:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2019-11-28 15:40:43,180 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 14 [2019-11-28 15:40:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,181 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 69 transitions. [2019-11-28 15:40:43,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2019-11-28 15:40:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:40:43,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,183 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1342408287, now seen corresponding path program 1 times [2019-11-28 15:40:43,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609270744] [2019-11-28 15:40:43,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609270744] [2019-11-28 15:40:43,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850507834] [2019-11-28 15:40:43,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,247 INFO L87 Difference]: Start difference. First operand 38 states and 69 transitions. Second operand 3 states. [2019-11-28 15:40:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,287 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2019-11-28 15:40:43,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 15:40:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,290 INFO L225 Difference]: With dead ends: 93 [2019-11-28 15:40:43,291 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 15:40:43,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 15:40:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-28 15:40:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 15:40:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-11-28 15:40:43,303 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 14 [2019-11-28 15:40:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,304 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-11-28 15:40:43,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-11-28 15:40:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:43,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,305 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1077064620, now seen corresponding path program 1 times [2019-11-28 15:40:43,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393026993] [2019-11-28 15:40:43,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393026993] [2019-11-28 15:40:43,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554096359] [2019-11-28 15:40:43,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,393 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-11-28 15:40:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,445 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-11-28 15:40:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,448 INFO L225 Difference]: With dead ends: 86 [2019-11-28 15:40:43,448 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 15:40:43,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 15:40:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-11-28 15:40:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 15:40:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2019-11-28 15:40:43,458 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 15 [2019-11-28 15:40:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,458 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2019-11-28 15:40:43,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2019-11-28 15:40:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:43,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,460 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1335230058, now seen corresponding path program 1 times [2019-11-28 15:40:43,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737089105] [2019-11-28 15:40:43,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737089105] [2019-11-28 15:40:43,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375878704] [2019-11-28 15:40:43,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,500 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 3 states. [2019-11-28 15:40:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,520 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2019-11-28 15:40:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,522 INFO L225 Difference]: With dead ends: 108 [2019-11-28 15:40:43,522 INFO L226 Difference]: Without dead ends: 106 [2019-11-28 15:40:43,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-28 15:40:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2019-11-28 15:40:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 15:40:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2019-11-28 15:40:43,533 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 15 [2019-11-28 15:40:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,533 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2019-11-28 15:40:43,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2019-11-28 15:40:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:43,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,535 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294636, now seen corresponding path program 1 times [2019-11-28 15:40:43,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054509182] [2019-11-28 15:40:43,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054509182] [2019-11-28 15:40:43,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920818598] [2019-11-28 15:40:43,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,574 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand 3 states. [2019-11-28 15:40:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,601 INFO L93 Difference]: Finished difference Result 180 states and 314 transitions. [2019-11-28 15:40:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,605 INFO L225 Difference]: With dead ends: 180 [2019-11-28 15:40:43,605 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 15:40:43,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 15:40:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-11-28 15:40:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 15:40:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 182 transitions. [2019-11-28 15:40:43,624 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 182 transitions. Word has length 15 [2019-11-28 15:40:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,624 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 182 transitions. [2019-11-28 15:40:43,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 182 transitions. [2019-11-28 15:40:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:43,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,628 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1557326826, now seen corresponding path program 1 times [2019-11-28 15:40:43,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124361289] [2019-11-28 15:40:43,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124361289] [2019-11-28 15:40:43,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153209240] [2019-11-28 15:40:43,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,673 INFO L87 Difference]: Start difference. First operand 106 states and 182 transitions. Second operand 3 states. [2019-11-28 15:40:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,703 INFO L93 Difference]: Finished difference Result 161 states and 273 transitions. [2019-11-28 15:40:43,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,705 INFO L225 Difference]: With dead ends: 161 [2019-11-28 15:40:43,706 INFO L226 Difference]: Without dead ends: 110 [2019-11-28 15:40:43,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-28 15:40:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-11-28 15:40:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 15:40:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 182 transitions. [2019-11-28 15:40:43,718 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 182 transitions. Word has length 16 [2019-11-28 15:40:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,719 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 182 transitions. [2019-11-28 15:40:43,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2019-11-28 15:40:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:43,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,721 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1299161388, now seen corresponding path program 1 times [2019-11-28 15:40:43,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181859399] [2019-11-28 15:40:43,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181859399] [2019-11-28 15:40:43,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291969771] [2019-11-28 15:40:43,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,761 INFO L87 Difference]: Start difference. First operand 108 states and 182 transitions. Second operand 3 states. [2019-11-28 15:40:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,795 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2019-11-28 15:40:43,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,798 INFO L225 Difference]: With dead ends: 308 [2019-11-28 15:40:43,798 INFO L226 Difference]: Without dead ends: 206 [2019-11-28 15:40:43,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-28 15:40:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2019-11-28 15:40:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-28 15:40:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 338 transitions. [2019-11-28 15:40:43,829 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 338 transitions. Word has length 16 [2019-11-28 15:40:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,829 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 338 transitions. [2019-11-28 15:40:43,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 338 transitions. [2019-11-28 15:40:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:43,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,832 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2000225966, now seen corresponding path program 1 times [2019-11-28 15:40:43,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309757261] [2019-11-28 15:40:43,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309757261] [2019-11-28 15:40:43,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50091997] [2019-11-28 15:40:43,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,895 INFO L87 Difference]: Start difference. First operand 204 states and 338 transitions. Second operand 3 states. [2019-11-28 15:40:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,917 INFO L93 Difference]: Finished difference Result 256 states and 428 transitions. [2019-11-28 15:40:43,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,921 INFO L225 Difference]: With dead ends: 256 [2019-11-28 15:40:43,921 INFO L226 Difference]: Without dead ends: 254 [2019-11-28 15:40:43,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-28 15:40:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2019-11-28 15:40:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-28 15:40:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2019-11-28 15:40:43,935 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 16 [2019-11-28 15:40:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,935 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2019-11-28 15:40:43,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2019-11-28 15:40:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:43,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,938 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1619082687, now seen corresponding path program 1 times [2019-11-28 15:40:43,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381036471] [2019-11-28 15:40:43,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381036471] [2019-11-28 15:40:43,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731680635] [2019-11-28 15:40:43,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,976 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand 3 states. [2019-11-28 15:40:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,997 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2019-11-28 15:40:43,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,000 INFO L225 Difference]: With dead ends: 372 [2019-11-28 15:40:44,001 INFO L226 Difference]: Without dead ends: 370 [2019-11-28 15:40:44,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-28 15:40:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 288. [2019-11-28 15:40:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-28 15:40:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 462 transitions. [2019-11-28 15:40:44,017 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 462 transitions. Word has length 17 [2019-11-28 15:40:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,017 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 462 transitions. [2019-11-28 15:40:44,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2019-11-28 15:40:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:44,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:44,020 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash -918018109, now seen corresponding path program 1 times [2019-11-28 15:40:44,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224881992] [2019-11-28 15:40:44,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224881992] [2019-11-28 15:40:44,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9496821] [2019-11-28 15:40:44,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,050 INFO L87 Difference]: Start difference. First operand 288 states and 462 transitions. Second operand 3 states. [2019-11-28 15:40:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,082 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2019-11-28 15:40:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,085 INFO L225 Difference]: With dead ends: 676 [2019-11-28 15:40:44,086 INFO L226 Difference]: Without dead ends: 394 [2019-11-28 15:40:44,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-28 15:40:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2019-11-28 15:40:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-28 15:40:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 618 transitions. [2019-11-28 15:40:44,106 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 618 transitions. Word has length 17 [2019-11-28 15:40:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,107 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 618 transitions. [2019-11-28 15:40:44,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 618 transitions. [2019-11-28 15:40:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:44,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:44,109 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1348259273, now seen corresponding path program 1 times [2019-11-28 15:40:44,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754407016] [2019-11-28 15:40:44,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754407016] [2019-11-28 15:40:44,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376468274] [2019-11-28 15:40:44,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,140 INFO L87 Difference]: Start difference. First operand 392 states and 618 transitions. Second operand 3 states. [2019-11-28 15:40:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,166 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2019-11-28 15:40:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,169 INFO L225 Difference]: With dead ends: 596 [2019-11-28 15:40:44,169 INFO L226 Difference]: Without dead ends: 406 [2019-11-28 15:40:44,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-28 15:40:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2019-11-28 15:40:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-11-28 15:40:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 626 transitions. [2019-11-28 15:40:44,187 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 626 transitions. Word has length 18 [2019-11-28 15:40:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,187 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 626 transitions. [2019-11-28 15:40:44,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 626 transitions. [2019-11-28 15:40:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:44,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:44,189 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1606424711, now seen corresponding path program 1 times [2019-11-28 15:40:44,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633447973] [2019-11-28 15:40:44,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633447973] [2019-11-28 15:40:44,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989344908] [2019-11-28 15:40:44,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,215 INFO L87 Difference]: Start difference. First operand 404 states and 626 transitions. Second operand 3 states. [2019-11-28 15:40:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,240 INFO L93 Difference]: Finished difference Result 712 states and 1116 transitions. [2019-11-28 15:40:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,244 INFO L225 Difference]: With dead ends: 712 [2019-11-28 15:40:44,245 INFO L226 Difference]: Without dead ends: 710 [2019-11-28 15:40:44,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-11-28 15:40:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 580. [2019-11-28 15:40:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-28 15:40:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 874 transitions. [2019-11-28 15:40:44,268 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 874 transitions. Word has length 18 [2019-11-28 15:40:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,268 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 874 transitions. [2019-11-28 15:40:44,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 874 transitions. [2019-11-28 15:40:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:44,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:44,270 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1987478007, now seen corresponding path program 1 times [2019-11-28 15:40:44,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339553026] [2019-11-28 15:40:44,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339553026] [2019-11-28 15:40:44,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408101684] [2019-11-28 15:40:44,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,305 INFO L87 Difference]: Start difference. First operand 580 states and 874 transitions. Second operand 3 states. [2019-11-28 15:40:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,336 INFO L93 Difference]: Finished difference Result 1336 states and 2012 transitions. [2019-11-28 15:40:44,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,341 INFO L225 Difference]: With dead ends: 1336 [2019-11-28 15:40:44,342 INFO L226 Difference]: Without dead ends: 774 [2019-11-28 15:40:44,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-11-28 15:40:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2019-11-28 15:40:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-28 15:40:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1138 transitions. [2019-11-28 15:40:44,372 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1138 transitions. Word has length 18 [2019-11-28 15:40:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,372 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1138 transitions. [2019-11-28 15:40:44,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1138 transitions. [2019-11-28 15:40:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:44,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:44,374 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1740226152, now seen corresponding path program 1 times [2019-11-28 15:40:44,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716475771] [2019-11-28 15:40:44,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716475771] [2019-11-28 15:40:44,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547495151] [2019-11-28 15:40:44,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,399 INFO L87 Difference]: Start difference. First operand 772 states and 1138 transitions. Second operand 3 states. [2019-11-28 15:40:44,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,428 INFO L93 Difference]: Finished difference Result 1160 states and 1700 transitions. [2019-11-28 15:40:44,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,433 INFO L225 Difference]: With dead ends: 1160 [2019-11-28 15:40:44,433 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:40:44,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:40:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-11-28 15:40:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-28 15:40:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1138 transitions. [2019-11-28 15:40:44,462 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1138 transitions. Word has length 19 [2019-11-28 15:40:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,463 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1138 transitions. [2019-11-28 15:40:44,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1138 transitions. [2019-11-28 15:40:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:44,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:44,465 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1482060714, now seen corresponding path program 1 times [2019-11-28 15:40:44,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295162552] [2019-11-28 15:40:44,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295162552] [2019-11-28 15:40:44,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238635572] [2019-11-28 15:40:44,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,487 INFO L87 Difference]: Start difference. First operand 788 states and 1138 transitions. Second operand 3 states. [2019-11-28 15:40:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,522 INFO L93 Difference]: Finished difference Result 1352 states and 1972 transitions. [2019-11-28 15:40:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,531 INFO L225 Difference]: With dead ends: 1352 [2019-11-28 15:40:44,531 INFO L226 Difference]: Without dead ends: 1350 [2019-11-28 15:40:44,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-28 15:40:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1156. [2019-11-28 15:40:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-11-28 15:40:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1618 transitions. [2019-11-28 15:40:44,574 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1618 transitions. Word has length 19 [2019-11-28 15:40:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,574 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1618 transitions. [2019-11-28 15:40:44,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1618 transitions. [2019-11-28 15:40:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:44,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:44,580 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,581 INFO L82 PathProgramCache]: Analyzing trace with hash -780996136, now seen corresponding path program 1 times [2019-11-28 15:40:44,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202218631] [2019-11-28 15:40:44,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202218631] [2019-11-28 15:40:44,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521035892] [2019-11-28 15:40:44,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,616 INFO L87 Difference]: Start difference. First operand 1156 states and 1618 transitions. Second operand 3 states. [2019-11-28 15:40:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,661 INFO L93 Difference]: Finished difference Result 2632 states and 3668 transitions. [2019-11-28 15:40:44,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,668 INFO L225 Difference]: With dead ends: 2632 [2019-11-28 15:40:44,669 INFO L226 Difference]: Without dead ends: 1510 [2019-11-28 15:40:44,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-11-28 15:40:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2019-11-28 15:40:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-11-28 15:40:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2050 transitions. [2019-11-28 15:40:44,727 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2050 transitions. Word has length 19 [2019-11-28 15:40:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,728 INFO L462 AbstractCegarLoop]: Abstraction has 1508 states and 2050 transitions. [2019-11-28 15:40:44,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2050 transitions. [2019-11-28 15:40:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:44,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,732 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] [2019-11-28 15:40:44,732 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1300973822, now seen corresponding path program 1 times [2019-11-28 15:40:44,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42506695] [2019-11-28 15:40:44,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42506695] [2019-11-28 15:40:44,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592495081] [2019-11-28 15:40:44,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,762 INFO L87 Difference]: Start difference. First operand 1508 states and 2050 transitions. Second operand 3 states. [2019-11-28 15:40:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,804 INFO L93 Difference]: Finished difference Result 2264 states and 3060 transitions. [2019-11-28 15:40:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,813 INFO L225 Difference]: With dead ends: 2264 [2019-11-28 15:40:44,814 INFO L226 Difference]: Without dead ends: 1542 [2019-11-28 15:40:44,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-11-28 15:40:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2019-11-28 15:40:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-11-28 15:40:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2050 transitions. [2019-11-28 15:40:44,888 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2050 transitions. Word has length 20 [2019-11-28 15:40:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,889 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2050 transitions. [2019-11-28 15:40:44,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2050 transitions. [2019-11-28 15:40:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:44,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:44,892 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] [2019-11-28 15:40:44,893 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:44,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:44,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1559139260, now seen corresponding path program 1 times [2019-11-28 15:40:44,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:44,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935626878] [2019-11-28 15:40:44,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:44,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935626878] [2019-11-28 15:40:44,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:44,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:44,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857395363] [2019-11-28 15:40:44,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:44,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:44,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,929 INFO L87 Difference]: Start difference. First operand 1540 states and 2050 transitions. Second operand 3 states. [2019-11-28 15:40:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:45,013 INFO L93 Difference]: Finished difference Result 2568 states and 3428 transitions. [2019-11-28 15:40:45,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:45,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:45,032 INFO L225 Difference]: With dead ends: 2568 [2019-11-28 15:40:45,032 INFO L226 Difference]: Without dead ends: 2566 [2019-11-28 15:40:45,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-11-28 15:40:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2308. [2019-11-28 15:40:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-11-28 15:40:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2978 transitions. [2019-11-28 15:40:45,142 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2978 transitions. Word has length 20 [2019-11-28 15:40:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:45,143 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 2978 transitions. [2019-11-28 15:40:45,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2978 transitions. [2019-11-28 15:40:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:45,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:45,150 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] [2019-11-28 15:40:45,151 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2034763458, now seen corresponding path program 1 times [2019-11-28 15:40:45,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:45,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791500312] [2019-11-28 15:40:45,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:45,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791500312] [2019-11-28 15:40:45,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:45,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:45,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524720993] [2019-11-28 15:40:45,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:45,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:45,189 INFO L87 Difference]: Start difference. First operand 2308 states and 2978 transitions. Second operand 3 states. [2019-11-28 15:40:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:45,321 INFO L93 Difference]: Finished difference Result 5192 states and 6628 transitions. [2019-11-28 15:40:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:45,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:45,337 INFO L225 Difference]: With dead ends: 5192 [2019-11-28 15:40:45,338 INFO L226 Difference]: Without dead ends: 2950 [2019-11-28 15:40:45,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-11-28 15:40:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2948. [2019-11-28 15:40:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2019-11-28 15:40:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3650 transitions. [2019-11-28 15:40:45,434 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3650 transitions. Word has length 20 [2019-11-28 15:40:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:45,434 INFO L462 AbstractCegarLoop]: Abstraction has 2948 states and 3650 transitions. [2019-11-28 15:40:45,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3650 transitions. [2019-11-28 15:40:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:45,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:45,439 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] [2019-11-28 15:40:45,439 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1088892845, now seen corresponding path program 1 times [2019-11-28 15:40:45,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:45,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122050461] [2019-11-28 15:40:45,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:45,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122050461] [2019-11-28 15:40:45,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:45,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:45,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013231808] [2019-11-28 15:40:45,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:45,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:45,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:45,460 INFO L87 Difference]: Start difference. First operand 2948 states and 3650 transitions. Second operand 3 states. [2019-11-28 15:40:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:45,528 INFO L93 Difference]: Finished difference Result 4424 states and 5444 transitions. [2019-11-28 15:40:45,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:45,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:45,543 INFO L225 Difference]: With dead ends: 4424 [2019-11-28 15:40:45,544 INFO L226 Difference]: Without dead ends: 3014 [2019-11-28 15:40:45,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-11-28 15:40:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2019-11-28 15:40:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3012 states. [2019-11-28 15:40:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3650 transitions. [2019-11-28 15:40:45,666 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3650 transitions. Word has length 21 [2019-11-28 15:40:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:45,666 INFO L462 AbstractCegarLoop]: Abstraction has 3012 states and 3650 transitions. [2019-11-28 15:40:45,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3650 transitions. [2019-11-28 15:40:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:45,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:45,673 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] [2019-11-28 15:40:45,674 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1347058283, now seen corresponding path program 1 times [2019-11-28 15:40:45,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:45,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390715787] [2019-11-28 15:40:45,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:45,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390715787] [2019-11-28 15:40:45,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:45,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:45,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907310586] [2019-11-28 15:40:45,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:45,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:45,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:45,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:45,702 INFO L87 Difference]: Start difference. First operand 3012 states and 3650 transitions. Second operand 3 states. [2019-11-28 15:40:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:45,834 INFO L93 Difference]: Finished difference Result 4870 states and 5827 transitions. [2019-11-28 15:40:45,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:45,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:45,863 INFO L225 Difference]: With dead ends: 4870 [2019-11-28 15:40:45,863 INFO L226 Difference]: Without dead ends: 4868 [2019-11-28 15:40:45,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2019-11-28 15:40:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4612. [2019-11-28 15:40:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-11-28 15:40:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5442 transitions. [2019-11-28 15:40:46,045 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5442 transitions. Word has length 21 [2019-11-28 15:40:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:46,045 INFO L462 AbstractCegarLoop]: Abstraction has 4612 states and 5442 transitions. [2019-11-28 15:40:46,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5442 transitions. [2019-11-28 15:40:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:46,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:46,056 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] [2019-11-28 15:40:46,056 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:46,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2048122861, now seen corresponding path program 1 times [2019-11-28 15:40:46,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:46,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992104742] [2019-11-28 15:40:46,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:46,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992104742] [2019-11-28 15:40:46,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:46,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:46,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945504970] [2019-11-28 15:40:46,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:46,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:46,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:46,081 INFO L87 Difference]: Start difference. First operand 4612 states and 5442 transitions. Second operand 3 states. [2019-11-28 15:40:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:46,216 INFO L93 Difference]: Finished difference Result 10244 states and 11842 transitions. [2019-11-28 15:40:46,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:46,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:46,217 INFO L225 Difference]: With dead ends: 10244 [2019-11-28 15:40:46,217 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:46,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:46,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:46,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-28 15:40:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:46,229 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:46,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:46,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:46,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:46,250 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-28 15:40:46,251 INFO L242 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-11-28 15:40:46,251 INFO L246 CegarLoopResult]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,251 INFO L246 CegarLoopResult]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,251 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:46,251 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:46,251 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-28 15:40:46,251 INFO L246 CegarLoopResult]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,252 INFO L246 CegarLoopResult]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,252 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-28 15:40:46,252 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-28 15:40:46,252 INFO L246 CegarLoopResult]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,252 INFO L246 CegarLoopResult]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,252 INFO L246 CegarLoopResult]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,252 INFO L246 CegarLoopResult]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,253 INFO L246 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-11-28 15:40:46,253 INFO L246 CegarLoopResult]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,253 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-28 15:40:46,253 INFO L249 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-11-28 15:40:46,253 INFO L246 CegarLoopResult]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,253 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-11-28 15:40:46,253 INFO L246 CegarLoopResult]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,253 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:46,253 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-28 15:40:46,254 INFO L246 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2019-11-28 15:40:46,254 INFO L246 CegarLoopResult]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,254 INFO L249 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-11-28 15:40:46,254 INFO L246 CegarLoopResult]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,254 INFO L246 CegarLoopResult]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,254 INFO L249 CegarLoopResult]: At program point L134(lines 4 135) the Hoare annotation is: true [2019-11-28 15:40:46,254 INFO L246 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2019-11-28 15:40:46,254 INFO L246 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-11-28 15:40:46,255 INFO L246 CegarLoopResult]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-11-28 15:40:46,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:46 BoogieIcfgContainer [2019-11-28 15:40:46,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:46,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:46,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:46,272 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:46,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:42" (3/4) ... [2019-11-28 15:40:46,276 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:46,293 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 15:40:46,293 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:46,404 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:46,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:46,407 INFO L168 Benchmark]: Toolchain (without parser) took 4568.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 960.4 MB in the beginning and 984.2 MB in the end (delta: -23.8 MB). Peak memory consumption was 193.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:46,408 INFO L168 Benchmark]: CDTParser took 1.03 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:46,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.79 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:46,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:46,409 INFO L168 Benchmark]: Boogie Preprocessor took 43.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:46,409 INFO L168 Benchmark]: RCFGBuilder took 347.13 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:46,410 INFO L168 Benchmark]: TraceAbstraction took 3544.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 984.2 MB in the end (delta: 102.5 MB). Peak memory consumption was 196.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:46,410 INFO L168 Benchmark]: Witness Printer took 133.56 ms. Allocated memory is still 1.2 GB. Free memory was 984.2 MB in the beginning and 984.2 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 15:40:46,413 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.79 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 149.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 347.13 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3544.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 984.2 MB in the end (delta: 102.5 MB). Peak memory consumption was 196.9 MB. Max. memory is 11.5 GB. * Witness Printer took 133.56 ms. Allocated memory is still 1.2 GB. Free memory was 984.2 MB in the beginning and 984.2 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Result: SAFE, OverallTime: 3.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 720 SDslu, 942 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4612occurred 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: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 13195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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...