./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_11.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_11.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 56f043bec3037ec37b4a132611abd4a337934428 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:22,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:22,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:22,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:22,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:22,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:22,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:22,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:22,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:22,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:22,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:22,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:22,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:22,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:22,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:22,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:22,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:22,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:22,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:22,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:22,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:22,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:22,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:22,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:22,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:22,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:22,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:22,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:22,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:22,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:22,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:22,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:22,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:22,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:22,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:22,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:22,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:22,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:22,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:22,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:22,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:22,826 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:22,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:22,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:22,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:22,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:22,869 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:22,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:22,870 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:22,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:22,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:22,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:22,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:22,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:22,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:22,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:22,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:22,871 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:22,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:22,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:22,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:22,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:22,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:22,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:22,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:22,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:22,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:22,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:22,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:22,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:22,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:22,876 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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-11-28 15:40:23,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:23,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:23,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:23,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:23,215 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:23,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2019-11-28 15:40:23,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2206a3ba/35c5b0e7b9ea4c82bc6297b4dd434dcd/FLAG615e23bbb [2019-11-28 15:40:23,767 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:23,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2019-11-28 15:40:23,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2206a3ba/35c5b0e7b9ea4c82bc6297b4dd434dcd/FLAG615e23bbb [2019-11-28 15:40:24,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2206a3ba/35c5b0e7b9ea4c82bc6297b4dd434dcd [2019-11-28 15:40:24,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:24,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:24,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:24,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:24,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:24,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:24" (1/1) ... [2019-11-28 15:40:24,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f492a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:24, skipping insertion in model container [2019-11-28 15:40:24,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:24" (1/1) ... [2019-11-28 15:40:24,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:24,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:24,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:24,409 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:24,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:24,451 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:24,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:24 WrapperNode [2019-11-28 15:40:24,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:24,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:24,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:24,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:24,521 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:24" (1/1) ... [2019-11-28 15:40:24,529 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:24" (1/1) ... [2019-11-28 15:40:24,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:24,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:24,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:24,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:24,561 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:24" (1/1) ... [2019-11-28 15:40:24,562 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:24" (1/1) ... [2019-11-28 15:40:24,563 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:24" (1/1) ... [2019-11-28 15:40:24,563 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:24" (1/1) ... [2019-11-28 15:40:24,567 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:24" (1/1) ... [2019-11-28 15:40:24,573 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:24" (1/1) ... [2019-11-28 15:40:24,575 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:24" (1/1) ... [2019-11-28 15:40:24,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:24,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:24,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:24,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:24,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:24" (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:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:24,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:25,011 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:25,011 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 15:40:25,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:25 BoogieIcfgContainer [2019-11-28 15:40:25,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:25,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:25,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:25,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:25,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:24" (1/3) ... [2019-11-28 15:40:25,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c853328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:25, skipping insertion in model container [2019-11-28 15:40:25,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:24" (2/3) ... [2019-11-28 15:40:25,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c853328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:25, skipping insertion in model container [2019-11-28 15:40:25,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:25" (3/3) ... [2019-11-28 15:40:25,021 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-11-28 15:40:25,028 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:25,034 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:25,045 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:25,070 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:25,070 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:25,070 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:25,071 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:25,071 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:25,071 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:25,071 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:25,072 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-28 15:40:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:25,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,093 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:25,094 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,099 INFO L82 PathProgramCache]: Analyzing trace with hash -233107426, now seen corresponding path program 1 times [2019-11-28 15:40:25,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583942657] [2019-11-28 15:40:25,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,288 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:25,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583942657] [2019-11-28 15:40:25,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013164787] [2019-11-28 15:40:25,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,317 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-11-28 15:40:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,372 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2019-11-28 15:40:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,387 INFO L225 Difference]: With dead ends: 88 [2019-11-28 15:40:25,387 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 15:40:25,390 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:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 15:40:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-11-28 15:40:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 15:40:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2019-11-28 15:40:25,432 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2019-11-28 15:40:25,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,432 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2019-11-28 15:40:25,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2019-11-28 15:40:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:25,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,434 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:25,434 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1244224676, now seen corresponding path program 1 times [2019-11-28 15:40:25,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308588092] [2019-11-28 15:40:25,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,527 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:25,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308588092] [2019-11-28 15:40:25,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770075455] [2019-11-28 15:40:25,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,532 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. [2019-11-28 15:40:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,564 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2019-11-28 15:40:25,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,567 INFO L225 Difference]: With dead ends: 123 [2019-11-28 15:40:25,567 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 15:40:25,568 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:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 15:40:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-28 15:40:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 15:40:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2019-11-28 15:40:25,579 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2019-11-28 15:40:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,579 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2019-11-28 15:40:25,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2019-11-28 15:40:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:25,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,580 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:25,581 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817409, now seen corresponding path program 1 times [2019-11-28 15:40:25,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38490883] [2019-11-28 15:40:25,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,639 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:25,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38490883] [2019-11-28 15:40:25,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837655883] [2019-11-28 15:40:25,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,642 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 3 states. [2019-11-28 15:40:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,682 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2019-11-28 15:40:25,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,688 INFO L225 Difference]: With dead ends: 113 [2019-11-28 15:40:25,688 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 15:40:25,689 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:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 15:40:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-11-28 15:40:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 15:40:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2019-11-28 15:40:25,712 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2019-11-28 15:40:25,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,712 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2019-11-28 15:40:25,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2019-11-28 15:40:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:25,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,714 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:25,714 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash 83953731, now seen corresponding path program 1 times [2019-11-28 15:40:25,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067424903] [2019-11-28 15:40:25,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,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:25,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067424903] [2019-11-28 15:40:25,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331813724] [2019-11-28 15:40:25,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,763 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand 3 states. [2019-11-28 15:40:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,792 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2019-11-28 15:40:25,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,795 INFO L225 Difference]: With dead ends: 144 [2019-11-28 15:40:25,795 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 15:40:25,796 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:25,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 15:40:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2019-11-28 15:40:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 15:40:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2019-11-28 15:40:25,809 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2019-11-28 15:40:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,809 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2019-11-28 15:40:25,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2019-11-28 15:40:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:25,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,811 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:25,811 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash -927163519, now seen corresponding path program 1 times [2019-11-28 15:40:25,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309593293] [2019-11-28 15:40:25,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,880 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:25,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309593293] [2019-11-28 15:40:25,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705931687] [2019-11-28 15:40:25,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,885 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand 3 states. [2019-11-28 15:40:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,914 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2019-11-28 15:40:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,916 INFO L225 Difference]: With dead ends: 240 [2019-11-28 15:40:25,916 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 15:40:25,917 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:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 15:40:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-11-28 15:40:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-28 15:40:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2019-11-28 15:40:25,940 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2019-11-28 15:40:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,940 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2019-11-28 15:40:25,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2019-11-28 15:40:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:25,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,944 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:25,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1692188271, now seen corresponding path program 1 times [2019-11-28 15:40:25,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971074624] [2019-11-28 15:40:25,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,019 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:26,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971074624] [2019-11-28 15:40:26,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043665552] [2019-11-28 15:40:26,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,023 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand 3 states. [2019-11-28 15:40:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,057 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2019-11-28 15:40:26,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,060 INFO L225 Difference]: With dead ends: 215 [2019-11-28 15:40:26,060 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 15:40:26,061 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:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 15:40:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-28 15:40:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 15:40:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2019-11-28 15:40:26,081 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2019-11-28 15:40:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,081 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2019-11-28 15:40:26,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2019-11-28 15:40:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:26,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,083 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:26,084 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1322915347, now seen corresponding path program 1 times [2019-11-28 15:40:26,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878394994] [2019-11-28 15:40:26,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,117 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:26,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878394994] [2019-11-28 15:40:26,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854492925] [2019-11-28 15:40:26,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,120 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand 3 states. [2019-11-28 15:40:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,162 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2019-11-28 15:40:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,166 INFO L225 Difference]: With dead ends: 416 [2019-11-28 15:40:26,166 INFO L226 Difference]: Without dead ends: 278 [2019-11-28 15:40:26,168 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:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-28 15:40:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-11-28 15:40:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-28 15:40:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2019-11-28 15:40:26,191 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2019-11-28 15:40:26,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,191 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2019-11-28 15:40:26,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2019-11-28 15:40:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:26,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,194 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:26,194 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1960934699, now seen corresponding path program 1 times [2019-11-28 15:40:26,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944685613] [2019-11-28 15:40:26,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,221 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:26,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944685613] [2019-11-28 15:40:26,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716131184] [2019-11-28 15:40:26,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,223 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand 3 states. [2019-11-28 15:40:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,243 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2019-11-28 15:40:26,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,246 INFO L225 Difference]: With dead ends: 352 [2019-11-28 15:40:26,247 INFO L226 Difference]: Without dead ends: 350 [2019-11-28 15:40:26,247 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:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-28 15:40:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2019-11-28 15:40:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-28 15:40:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2019-11-28 15:40:26,260 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2019-11-28 15:40:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,260 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2019-11-28 15:40:26,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2019-11-28 15:40:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:26,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,263 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:26,263 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1939083498, now seen corresponding path program 1 times [2019-11-28 15:40:26,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194531991] [2019-11-28 15:40:26,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,300 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:26,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194531991] [2019-11-28 15:40:26,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309460098] [2019-11-28 15:40:26,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,303 INFO L87 Difference]: Start difference. First operand 276 states and 478 transitions. Second operand 3 states. [2019-11-28 15:40:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,328 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2019-11-28 15:40:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,334 INFO L225 Difference]: With dead ends: 516 [2019-11-28 15:40:26,334 INFO L226 Difference]: Without dead ends: 514 [2019-11-28 15:40:26,335 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:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-28 15:40:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2019-11-28 15:40:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-28 15:40:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2019-11-28 15:40:26,354 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2019-11-28 15:40:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,355 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2019-11-28 15:40:26,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2019-11-28 15:40:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:26,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,357 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:26,358 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1344766548, now seen corresponding path program 1 times [2019-11-28 15:40:26,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992025257] [2019-11-28 15:40:26,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,398 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:26,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992025257] [2019-11-28 15:40:26,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973640751] [2019-11-28 15:40:26,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,402 INFO L87 Difference]: Start difference. First operand 384 states and 654 transitions. Second operand 3 states. [2019-11-28 15:40:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,436 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2019-11-28 15:40:26,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,441 INFO L225 Difference]: With dead ends: 916 [2019-11-28 15:40:26,442 INFO L226 Difference]: Without dead ends: 538 [2019-11-28 15:40:26,443 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:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-28 15:40:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-11-28 15:40:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-28 15:40:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2019-11-28 15:40:26,477 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2019-11-28 15:40:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,480 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2019-11-28 15:40:26,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2019-11-28 15:40:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:26,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,483 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:26,484 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,484 INFO L82 PathProgramCache]: Analyzing trace with hash 18167752, now seen corresponding path program 1 times [2019-11-28 15:40:26,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119077933] [2019-11-28 15:40:26,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,534 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:26,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119077933] [2019-11-28 15:40:26,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729756210] [2019-11-28 15:40:26,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,538 INFO L87 Difference]: Start difference. First operand 536 states and 906 transitions. Second operand 3 states. [2019-11-28 15:40:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,572 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2019-11-28 15:40:26,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,576 INFO L225 Difference]: With dead ends: 812 [2019-11-28 15:40:26,577 INFO L226 Difference]: Without dead ends: 550 [2019-11-28 15:40:26,579 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:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-28 15:40:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-28 15:40:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-28 15:40:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2019-11-28 15:40:26,599 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2019-11-28 15:40:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,601 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2019-11-28 15:40:26,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2019-11-28 15:40:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:26,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,605 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:26,605 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1261695926, now seen corresponding path program 1 times [2019-11-28 15:40:26,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350089892] [2019-11-28 15:40:26,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,642 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:26,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350089892] [2019-11-28 15:40:26,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764794149] [2019-11-28 15:40:26,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,646 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand 3 states. [2019-11-28 15:40:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,678 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2019-11-28 15:40:26,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,687 INFO L225 Difference]: With dead ends: 1000 [2019-11-28 15:40:26,687 INFO L226 Difference]: Without dead ends: 998 [2019-11-28 15:40:26,689 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:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-11-28 15:40:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2019-11-28 15:40:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-28 15:40:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2019-11-28 15:40:26,718 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2019-11-28 15:40:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,719 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2019-11-28 15:40:26,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2019-11-28 15:40:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:26,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,723 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:26,724 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2022154120, now seen corresponding path program 1 times [2019-11-28 15:40:26,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208487486] [2019-11-28 15:40:26,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,766 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:26,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208487486] [2019-11-28 15:40:26,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868453794] [2019-11-28 15:40:26,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,768 INFO L87 Difference]: Start difference. First operand 772 states and 1258 transitions. Second operand 3 states. [2019-11-28 15:40:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,813 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2019-11-28 15:40:26,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,821 INFO L225 Difference]: With dead ends: 1816 [2019-11-28 15:40:26,821 INFO L226 Difference]: Without dead ends: 1062 [2019-11-28 15:40:26,823 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:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-28 15:40:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2019-11-28 15:40:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-28 15:40:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2019-11-28 15:40:26,862 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2019-11-28 15:40:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,862 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2019-11-28 15:40:26,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2019-11-28 15:40:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:26,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,867 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash -457653655, now seen corresponding path program 1 times [2019-11-28 15:40:26,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810913510] [2019-11-28 15:40:26,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,914 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:26,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810913510] [2019-11-28 15:40:26,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417781873] [2019-11-28 15:40:26,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,920 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 transitions. Second operand 3 states. [2019-11-28 15:40:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,951 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2019-11-28 15:40:26,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,962 INFO L225 Difference]: With dead ends: 1592 [2019-11-28 15:40:26,963 INFO L226 Difference]: Without dead ends: 1078 [2019-11-28 15:40:26,966 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:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-11-28 15:40:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2019-11-28 15:40:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-28 15:40:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2019-11-28 15:40:27,017 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2019-11-28 15:40:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,018 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2019-11-28 15:40:27,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2019-11-28 15:40:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:27,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,021 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1737517333, now seen corresponding path program 1 times [2019-11-28 15:40:27,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251531449] [2019-11-28 15:40:27,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,066 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:27,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251531449] [2019-11-28 15:40:27,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563991] [2019-11-28 15:40:27,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,069 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. Second operand 3 states. [2019-11-28 15:40:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,123 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2019-11-28 15:40:27,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,135 INFO L225 Difference]: With dead ends: 1928 [2019-11-28 15:40:27,136 INFO L226 Difference]: Without dead ends: 1926 [2019-11-28 15:40:27,138 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:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-28 15:40:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2019-11-28 15:40:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-11-28 15:40:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2019-11-28 15:40:27,204 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2019-11-28 15:40:27,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,207 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2019-11-28 15:40:27,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2019-11-28 15:40:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:27,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,213 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1546332713, now seen corresponding path program 1 times [2019-11-28 15:40:27,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114921242] [2019-11-28 15:40:27,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,246 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:27,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114921242] [2019-11-28 15:40:27,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139213166] [2019-11-28 15:40:27,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,252 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 transitions. Second operand 3 states. [2019-11-28 15:40:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,319 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2019-11-28 15:40:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,335 INFO L225 Difference]: With dead ends: 3592 [2019-11-28 15:40:27,335 INFO L226 Difference]: Without dead ends: 2086 [2019-11-28 15:40:27,339 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:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-11-28 15:40:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2019-11-28 15:40:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-11-28 15:40:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2019-11-28 15:40:27,420 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2019-11-28 15:40:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,420 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2019-11-28 15:40:27,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2019-11-28 15:40:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:27,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,424 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752253, now seen corresponding path program 1 times [2019-11-28 15:40:27,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697359083] [2019-11-28 15:40:27,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,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:27,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697359083] [2019-11-28 15:40:27,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360025744] [2019-11-28 15:40:27,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,462 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 transitions. Second operand 3 states. [2019-11-28 15:40:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,509 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2019-11-28 15:40:27,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,521 INFO L225 Difference]: With dead ends: 3128 [2019-11-28 15:40:27,522 INFO L226 Difference]: Without dead ends: 2118 [2019-11-28 15:40:27,525 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:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-28 15:40:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2019-11-28 15:40:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-11-28 15:40:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2019-11-28 15:40:27,592 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2019-11-28 15:40:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,592 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2019-11-28 15:40:27,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2019-11-28 15:40:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:27,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,597 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 691888575, now seen corresponding path program 1 times [2019-11-28 15:40:27,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495233488] [2019-11-28 15:40:27,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,620 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:27,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495233488] [2019-11-28 15:40:27,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165388824] [2019-11-28 15:40:27,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,623 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 transitions. Second operand 3 states. [2019-11-28 15:40:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,732 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2019-11-28 15:40:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,751 INFO L225 Difference]: With dead ends: 3720 [2019-11-28 15:40:27,751 INFO L226 Difference]: Without dead ends: 3718 [2019-11-28 15:40:27,752 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:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-28 15:40:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2019-11-28 15:40:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-11-28 15:40:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2019-11-28 15:40:27,844 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2019-11-28 15:40:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,845 INFO L462 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2019-11-28 15:40:27,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2019-11-28 15:40:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:27,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,850 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,850 INFO L82 PathProgramCache]: Analyzing trace with hash -319228675, now seen corresponding path program 1 times [2019-11-28 15:40:27,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238807025] [2019-11-28 15:40:27,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,873 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:27,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238807025] [2019-11-28 15:40:27,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887046392] [2019-11-28 15:40:27,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,875 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 transitions. Second operand 3 states. [2019-11-28 15:40:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,952 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2019-11-28 15:40:27,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,971 INFO L225 Difference]: With dead ends: 7112 [2019-11-28 15:40:27,972 INFO L226 Difference]: Without dead ends: 4102 [2019-11-28 15:40:27,976 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:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-28 15:40:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2019-11-28 15:40:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-11-28 15:40:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2019-11-28 15:40:28,094 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2019-11-28 15:40:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,094 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2019-11-28 15:40:28,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2019-11-28 15:40:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:28,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:28,101 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash -26075586, now seen corresponding path program 1 times [2019-11-28 15:40:28,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499878125] [2019-11-28 15:40:28,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,122 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:28,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499878125] [2019-11-28 15:40:28,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885739775] [2019-11-28 15:40:28,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,124 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 transitions. Second operand 3 states. [2019-11-28 15:40:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,197 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2019-11-28 15:40:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,240 INFO L225 Difference]: With dead ends: 6152 [2019-11-28 15:40:28,241 INFO L226 Difference]: Without dead ends: 4166 [2019-11-28 15:40:28,245 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:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-11-28 15:40:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2019-11-28 15:40:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-11-28 15:40:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2019-11-28 15:40:28,364 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2019-11-28 15:40:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,364 INFO L462 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2019-11-28 15:40:28,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2019-11-28 15:40:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:28,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:28,370 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1305939264, now seen corresponding path program 1 times [2019-11-28 15:40:28,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057650073] [2019-11-28 15:40:28,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,400 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:28,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057650073] [2019-11-28 15:40:28,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064981186] [2019-11-28 15:40:28,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,404 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 transitions. Second operand 3 states. [2019-11-28 15:40:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,521 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2019-11-28 15:40:28,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,538 INFO L225 Difference]: With dead ends: 7176 [2019-11-28 15:40:28,538 INFO L226 Difference]: Without dead ends: 7174 [2019-11-28 15:40:28,543 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:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-11-28 15:40:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2019-11-28 15:40:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6148 states. [2019-11-28 15:40:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2019-11-28 15:40:28,682 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2019-11-28 15:40:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,683 INFO L462 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2019-11-28 15:40:28,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2019-11-28 15:40:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:28,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:28,692 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1977910782, now seen corresponding path program 1 times [2019-11-28 15:40:28,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638954562] [2019-11-28 15:40:28,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,713 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:28,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638954562] [2019-11-28 15:40:28,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106570463] [2019-11-28 15:40:28,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,715 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 transitions. Second operand 3 states. [2019-11-28 15:40:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,824 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2019-11-28 15:40:28,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,840 INFO L225 Difference]: With dead ends: 14088 [2019-11-28 15:40:28,840 INFO L226 Difference]: Without dead ends: 8070 [2019-11-28 15:40:28,849 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:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2019-11-28 15:40:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2019-11-28 15:40:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8068 states. [2019-11-28 15:40:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2019-11-28 15:40:29,078 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2019-11-28 15:40:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:29,078 INFO L462 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2019-11-28 15:40:29,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2019-11-28 15:40:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:29,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:29,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:29,090 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:29,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1829196110, now seen corresponding path program 1 times [2019-11-28 15:40:29,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:29,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833318656] [2019-11-28 15:40:29,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,114 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:29,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833318656] [2019-11-28 15:40:29,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:29,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:29,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622407788] [2019-11-28 15:40:29,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:29,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:29,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,117 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 transitions. Second operand 3 states. [2019-11-28 15:40:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:29,271 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2019-11-28 15:40:29,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:29,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:29,287 INFO L225 Difference]: With dead ends: 12104 [2019-11-28 15:40:29,287 INFO L226 Difference]: Without dead ends: 8198 [2019-11-28 15:40:29,294 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:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-11-28 15:40:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2019-11-28 15:40:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-11-28 15:40:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2019-11-28 15:40:29,481 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2019-11-28 15:40:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:29,481 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2019-11-28 15:40:29,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2019-11-28 15:40:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:29,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:29,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:29,491 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:29,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1185907508, now seen corresponding path program 1 times [2019-11-28 15:40:29,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:29,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60632040] [2019-11-28 15:40:29,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,517 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:29,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60632040] [2019-11-28 15:40:29,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:29,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:29,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768721842] [2019-11-28 15:40:29,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:29,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:29,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,519 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 transitions. Second operand 3 states. [2019-11-28 15:40:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:29,660 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2019-11-28 15:40:29,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:29,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:29,687 INFO L225 Difference]: With dead ends: 13832 [2019-11-28 15:40:29,687 INFO L226 Difference]: Without dead ends: 13830 [2019-11-28 15:40:29,694 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:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-11-28 15:40:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2019-11-28 15:40:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2019-11-28 15:40:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2019-11-28 15:40:29,932 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2019-11-28 15:40:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:29,932 INFO L462 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2019-11-28 15:40:29,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2019-11-28 15:40:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:29,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:29,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:29,949 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash 174790258, now seen corresponding path program 1 times [2019-11-28 15:40:29,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:29,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380131682] [2019-11-28 15:40:29,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,969 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:29,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380131682] [2019-11-28 15:40:29,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:29,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:29,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436546891] [2019-11-28 15:40:29,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:29,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:29,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:29,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,971 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 transitions. Second operand 3 states. [2019-11-28 15:40:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:30,143 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2019-11-28 15:40:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:30,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:30,173 INFO L225 Difference]: With dead ends: 27912 [2019-11-28 15:40:30,173 INFO L226 Difference]: Without dead ends: 15878 [2019-11-28 15:40:30,194 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:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2019-11-28 15:40:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2019-11-28 15:40:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2019-11-28 15:40:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2019-11-28 15:40:30,625 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2019-11-28 15:40:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:30,625 INFO L462 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2019-11-28 15:40:30,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2019-11-28 15:40:30,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:30,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:30,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:30,644 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:30,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1891357165, now seen corresponding path program 1 times [2019-11-28 15:40:30,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:30,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687990168] [2019-11-28 15:40:30,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:30,663 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:30,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687990168] [2019-11-28 15:40:30,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:30,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:30,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122738726] [2019-11-28 15:40:30,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:30,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:30,665 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 transitions. Second operand 3 states. [2019-11-28 15:40:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:30,822 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2019-11-28 15:40:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:30,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:30,851 INFO L225 Difference]: With dead ends: 23816 [2019-11-28 15:40:30,851 INFO L226 Difference]: Without dead ends: 16134 [2019-11-28 15:40:30,862 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:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-11-28 15:40:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2019-11-28 15:40:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-11-28 15:40:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2019-11-28 15:40:31,163 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2019-11-28 15:40:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:31,164 INFO L462 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2019-11-28 15:40:31,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2019-11-28 15:40:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:31,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:31,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:31,181 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:31,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:31,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1123746453, now seen corresponding path program 1 times [2019-11-28 15:40:31,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:31,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533271664] [2019-11-28 15:40:31,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:31,199 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:31,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533271664] [2019-11-28 15:40:31,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:31,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:31,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44336577] [2019-11-28 15:40:31,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:31,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:31,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:31,201 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 transitions. Second operand 3 states. [2019-11-28 15:40:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:31,415 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2019-11-28 15:40:31,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:31,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:31,462 INFO L225 Difference]: With dead ends: 26632 [2019-11-28 15:40:31,463 INFO L226 Difference]: Without dead ends: 26630 [2019-11-28 15:40:31,471 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:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2019-11-28 15:40:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2019-11-28 15:40:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24580 states. [2019-11-28 15:40:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2019-11-28 15:40:32,121 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2019-11-28 15:40:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:32,121 INFO L462 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2019-11-28 15:40:32,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2019-11-28 15:40:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:32,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:32,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:32,162 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:32,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash 112629203, now seen corresponding path program 1 times [2019-11-28 15:40:32,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:32,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433020745] [2019-11-28 15:40:32,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:32,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:32,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433020745] [2019-11-28 15:40:32,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:32,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:32,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858185602] [2019-11-28 15:40:32,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:32,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:32,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:32,189 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 transitions. Second operand 3 states. [2019-11-28 15:40:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:32,484 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2019-11-28 15:40:32,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:32,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:32,521 INFO L225 Difference]: With dead ends: 55304 [2019-11-28 15:40:32,521 INFO L226 Difference]: Without dead ends: 31238 [2019-11-28 15:40:32,552 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:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2019-11-28 15:40:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2019-11-28 15:40:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31236 states. [2019-11-28 15:40:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2019-11-28 15:40:33,186 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2019-11-28 15:40:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:33,187 INFO L462 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2019-11-28 15:40:33,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2019-11-28 15:40:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:33,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:33,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:33,369 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash 476617767, now seen corresponding path program 1 times [2019-11-28 15:40:33,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:33,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094807486] [2019-11-28 15:40:33,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:33,389 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:33,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094807486] [2019-11-28 15:40:33,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:33,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:33,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617870912] [2019-11-28 15:40:33,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:33,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:33,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:33,391 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 transitions. Second operand 3 states. [2019-11-28 15:40:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:33,642 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2019-11-28 15:40:33,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:33,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:33,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:33,679 INFO L225 Difference]: With dead ends: 46856 [2019-11-28 15:40:33,679 INFO L226 Difference]: Without dead ends: 31750 [2019-11-28 15:40:33,695 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:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2019-11-28 15:40:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2019-11-28 15:40:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-11-28 15:40:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2019-11-28 15:40:34,237 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2019-11-28 15:40:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:34,237 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2019-11-28 15:40:34,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2019-11-28 15:40:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:34,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:34,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:34,258 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash -803245911, now seen corresponding path program 1 times [2019-11-28 15:40:34,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:34,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721125180] [2019-11-28 15:40:34,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:34,278 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:34,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721125180] [2019-11-28 15:40:34,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:34,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:34,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244005263] [2019-11-28 15:40:34,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:34,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:34,280 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 transitions. Second operand 3 states. [2019-11-28 15:40:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:34,876 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2019-11-28 15:40:34,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:34,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:34,911 INFO L225 Difference]: With dead ends: 92166 [2019-11-28 15:40:34,911 INFO L226 Difference]: Without dead ends: 31748 [2019-11-28 15:40:34,940 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:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2019-11-28 15:40:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2019-11-28 15:40:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-11-28 15:40:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2019-11-28 15:40:35,349 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2019-11-28 15:40:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:35,349 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2019-11-28 15:40:35,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2019-11-28 15:40:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:35,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:35,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:35,365 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:35,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:35,365 INFO L82 PathProgramCache]: Analyzing trace with hash 207871339, now seen corresponding path program 1 times [2019-11-28 15:40:35,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:35,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159335685] [2019-11-28 15:40:35,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:35,388 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:35,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159335685] [2019-11-28 15:40:35,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:35,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:35,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284470516] [2019-11-28 15:40:35,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:35,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:35,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:35,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:35,390 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 transitions. Second operand 3 states. [2019-11-28 15:40:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:35,582 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2019-11-28 15:40:35,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:35,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:35,583 INFO L225 Difference]: With dead ends: 31748 [2019-11-28 15:40:35,583 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:35,596 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:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:35,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-11-28 15:40:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:35,597 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:35,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:35,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:35,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:35,624 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-28 15:40:35,624 INFO L249 CegarLoopResult]: At program point L176(lines 4 177) the Hoare annotation is: true [2019-11-28 15:40:35,625 INFO L246 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-28 15:40:35,625 INFO L246 CegarLoopResult]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-28 15:40:35,625 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-28 15:40:35,625 INFO L242 CegarLoopResult]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-11-28 15:40:35,625 INFO L246 CegarLoopResult]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,625 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:35,625 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:35,625 INFO L246 CegarLoopResult]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,625 INFO L246 CegarLoopResult]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,626 INFO L246 CegarLoopResult]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,627 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-28 15:40:35,628 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-28 15:40:35,629 INFO L246 CegarLoopResult]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,629 INFO L246 CegarLoopResult]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,629 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-28 15:40:35,629 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-11-28 15:40:35,630 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-28 15:40:35,630 INFO L249 CegarLoopResult]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-11-28 15:40:35,630 INFO L246 CegarLoopResult]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,630 INFO L246 CegarLoopResult]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,630 INFO L246 CegarLoopResult]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,630 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:35,631 INFO L246 CegarLoopResult]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,631 INFO L246 CegarLoopResult]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,631 INFO L246 CegarLoopResult]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,631 INFO L246 CegarLoopResult]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,631 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-28 15:40:35,632 INFO L246 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-28 15:40:35,632 INFO L246 CegarLoopResult]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,632 INFO L246 CegarLoopResult]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-11-28 15:40:35,632 INFO L249 CegarLoopResult]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-11-28 15:40:35,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:35 BoogieIcfgContainer [2019-11-28 15:40:35,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:35,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:35,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:35,648 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:35,649 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:25" (3/4) ... [2019-11-28 15:40:35,653 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:35,671 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 15:40:35,671 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:35,786 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:35,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:35,788 INFO L168 Benchmark]: Toolchain (without parser) took 11667.54 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -331.1 MB). Peak memory consumption was 683.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:35,789 INFO L168 Benchmark]: CDTParser took 0.23 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:35,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.42 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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:35,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:35,790 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:35,791 INFO L168 Benchmark]: RCFGBuilder took 434.55 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:35,791 INFO L168 Benchmark]: TraceAbstraction took 10633.50 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 885.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -202.0 MB). Peak memory consumption was 683.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:35,792 INFO L168 Benchmark]: Witness Printer took 138.38 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:35,795 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 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 330.42 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 99.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 434.55 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10633.50 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 885.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -202.0 MB). Peak memory consumption was 683.0 MB. Max. memory is 11.5 GB. * Witness Printer took 138.38 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 42 locations, 1 error locations. Result: SAFE, OverallTime: 10.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2722 SDtfs, 1400 SDslu, 1804 SDs, 0 SdLazy, 163 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31748occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 31360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...