/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:25:13,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:25:13,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:25:13,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:25:13,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:25:13,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:25:13,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:25:13,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:25:13,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:25:13,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:25:13,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:25:13,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:25:13,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:25:13,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:25:13,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:25:13,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:25:13,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:25:13,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:25:13,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:25:13,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:25:13,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:25:13,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:25:13,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:25:13,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:25:13,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:25:13,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:25:13,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:25:13,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:25:13,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:25:13,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:25:13,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:25:13,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:25:13,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:25:13,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:25:13,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:25:13,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:25:13,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:25:13,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:25:13,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:25:13,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:25:13,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:25:13,831 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:25:13,858 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:25:13,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:25:13,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:25:13,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:25:13,860 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:25:13,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:25:13,860 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:25:13,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:25:13,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:25:13,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:25:13,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:25:13,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:25:13,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:25:13,862 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:25:13,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:25:13,862 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:25:13,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:25:13,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:25:13,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:25:13,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:25:13,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:25:13,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:25:13,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:25:13,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:25:13,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:25:13,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:25:13,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:25:13,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:25:13,865 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:25:13,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:25:14,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:25:14,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:25:14,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:25:14,374 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:25:14,375 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:25:14,376 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2020-09-04 13:25:14,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/993947ce2/317a3c1c790d4ef48a69ead5cb8c493b/FLAGe7b9624ab [2020-09-04 13:25:14,967 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:25:14,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_9.c [2020-09-04 13:25:14,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/993947ce2/317a3c1c790d4ef48a69ead5cb8c493b/FLAGe7b9624ab [2020-09-04 13:25:15,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/993947ce2/317a3c1c790d4ef48a69ead5cb8c493b [2020-09-04 13:25:15,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:25:15,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:25:15,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:25:15,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:25:15,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:25:15,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d876c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15, skipping insertion in model container [2020-09-04 13:25:15,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:25:15,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:25:15,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:25:15,708 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:25:15,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:25:15,767 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:25:15,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15 WrapperNode [2020-09-04 13:25:15,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:25:15,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:25:15,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:25:15,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:25:15,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (1/1) ... [2020-09-04 13:25:15,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:25:15,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:25:15,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:25:15,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:25:15,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:25:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:25:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:25:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:25:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:25:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:25:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:25:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:25:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:25:16,325 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:25:16,326 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:25:16,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:25:16 BoogieIcfgContainer [2020-09-04 13:25:16,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:25:16,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:25:16,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:25:16,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:25:16,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:25:15" (1/3) ... [2020-09-04 13:25:16,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c2daf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:25:16, skipping insertion in model container [2020-09-04 13:25:16,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:25:15" (2/3) ... [2020-09-04 13:25:16,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c2daf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:25:16, skipping insertion in model container [2020-09-04 13:25:16,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:25:16" (3/3) ... [2020-09-04 13:25:16,345 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2020-09-04 13:25:16,375 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:25:16,397 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:25:16,431 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:25:16,470 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:25:16,470 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:25:16,471 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:25:16,471 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:25:16,471 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:25:16,471 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:25:16,471 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:25:16,472 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:25:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-09-04 13:25:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:25:16,500 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:16,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:16,502 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:16,508 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2020-09-04 13:25:16,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:16,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406338083] [2020-09-04 13:25:16,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:16,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:16,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406338083] [2020-09-04 13:25:16,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:16,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:16,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307675425] [2020-09-04 13:25:16,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:16,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:16,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:16,784 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-09-04 13:25:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:16,852 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2020-09-04 13:25:16,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:16,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-04 13:25:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:16,873 INFO L225 Difference]: With dead ends: 81 [2020-09-04 13:25:16,873 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 13:25:16,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 13:25:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-09-04 13:25:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 13:25:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2020-09-04 13:25:16,931 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2020-09-04 13:25:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:16,932 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2020-09-04 13:25:16,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2020-09-04 13:25:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 13:25:16,933 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:16,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:16,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:25:16,934 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2020-09-04 13:25:16,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:16,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463390963] [2020-09-04 13:25:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463390963] [2020-09-04 13:25:17,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57014110] [2020-09-04 13:25:17,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,011 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2020-09-04 13:25:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,044 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2020-09-04 13:25:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-09-04 13:25:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,047 INFO L225 Difference]: With dead ends: 107 [2020-09-04 13:25:17,048 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 13:25:17,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 13:25:17,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-09-04 13:25:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-09-04 13:25:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2020-09-04 13:25:17,060 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2020-09-04 13:25:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,061 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2020-09-04 13:25:17,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2020-09-04 13:25:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:17,062 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:17,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:25:17,063 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,064 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2020-09-04 13:25:17,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167372960] [2020-09-04 13:25:17,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167372960] [2020-09-04 13:25:17,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125799585] [2020-09-04 13:25:17,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,132 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2020-09-04 13:25:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,161 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2020-09-04 13:25:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,163 INFO L225 Difference]: With dead ends: 99 [2020-09-04 13:25:17,164 INFO L226 Difference]: Without dead ends: 69 [2020-09-04 13:25:17,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-09-04 13:25:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2020-09-04 13:25:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-09-04 13:25:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2020-09-04 13:25:17,176 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2020-09-04 13:25:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,176 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2020-09-04 13:25:17,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2020-09-04 13:25:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:17,178 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:17,178 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:25:17,179 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2020-09-04 13:25:17,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422336687] [2020-09-04 13:25:17,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422336687] [2020-09-04 13:25:17,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583157115] [2020-09-04 13:25:17,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,239 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2020-09-04 13:25:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,259 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2020-09-04 13:25:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,262 INFO L225 Difference]: With dead ends: 124 [2020-09-04 13:25:17,262 INFO L226 Difference]: Without dead ends: 122 [2020-09-04 13:25:17,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-09-04 13:25:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2020-09-04 13:25:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 13:25:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2020-09-04 13:25:17,279 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2020-09-04 13:25:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,280 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2020-09-04 13:25:17,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2020-09-04 13:25:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 13:25:17,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:17,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:25:17,285 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2020-09-04 13:25:17,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511379733] [2020-09-04 13:25:17,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511379733] [2020-09-04 13:25:17,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901345929] [2020-09-04 13:25:17,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,359 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2020-09-04 13:25:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,382 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2020-09-04 13:25:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-09-04 13:25:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,385 INFO L225 Difference]: With dead ends: 204 [2020-09-04 13:25:17,385 INFO L226 Difference]: Without dead ends: 124 [2020-09-04 13:25:17,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-09-04 13:25:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2020-09-04 13:25:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-09-04 13:25:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2020-09-04 13:25:17,411 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2020-09-04 13:25:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,411 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2020-09-04 13:25:17,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2020-09-04 13:25:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:17,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:17,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:25:17,414 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2020-09-04 13:25:17,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958117184] [2020-09-04 13:25:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958117184] [2020-09-04 13:25:17,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727398220] [2020-09-04 13:25:17,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,461 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2020-09-04 13:25:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,496 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2020-09-04 13:25:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,499 INFO L225 Difference]: With dead ends: 183 [2020-09-04 13:25:17,499 INFO L226 Difference]: Without dead ends: 126 [2020-09-04 13:25:17,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-09-04 13:25:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2020-09-04 13:25:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-09-04 13:25:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2020-09-04 13:25:17,517 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2020-09-04 13:25:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,518 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2020-09-04 13:25:17,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2020-09-04 13:25:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:17,521 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:17,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:25:17,525 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2020-09-04 13:25:17,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908990108] [2020-09-04 13:25:17,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908990108] [2020-09-04 13:25:17,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863823929] [2020-09-04 13:25:17,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,566 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2020-09-04 13:25:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,604 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2020-09-04 13:25:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,607 INFO L225 Difference]: With dead ends: 228 [2020-09-04 13:25:17,607 INFO L226 Difference]: Without dead ends: 226 [2020-09-04 13:25:17,608 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-09-04 13:25:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2020-09-04 13:25:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-09-04 13:25:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2020-09-04 13:25:17,630 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2020-09-04 13:25:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,630 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2020-09-04 13:25:17,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2020-09-04 13:25:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:25:17,632 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:25:17,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:25:17,637 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2020-09-04 13:25:17,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552058963] [2020-09-04 13:25:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552058963] [2020-09-04 13:25:17,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233752607] [2020-09-04 13:25:17,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,708 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2020-09-04 13:25:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,733 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2020-09-04 13:25:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:25:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,736 INFO L225 Difference]: With dead ends: 392 [2020-09-04 13:25:17,736 INFO L226 Difference]: Without dead ends: 234 [2020-09-04 13:25:17,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-09-04 13:25:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2020-09-04 13:25:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-09-04 13:25:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2020-09-04 13:25:17,765 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2020-09-04 13:25:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,765 INFO L479 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2020-09-04 13:25:17,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2020-09-04 13:25:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:17,767 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,768 INFO L422 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] [2020-09-04 13:25:17,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:25:17,768 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2020-09-04 13:25:17,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155359329] [2020-09-04 13:25:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155359329] [2020-09-04 13:25:17,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172368138] [2020-09-04 13:25:17,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,805 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2020-09-04 13:25:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,824 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2020-09-04 13:25:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,827 INFO L225 Difference]: With dead ends: 348 [2020-09-04 13:25:17,827 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 13:25:17,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 13:25:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2020-09-04 13:25:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-09-04 13:25:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2020-09-04 13:25:17,841 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2020-09-04 13:25:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,842 INFO L479 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2020-09-04 13:25:17,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2020-09-04 13:25:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:17,843 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,843 INFO L422 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] [2020-09-04 13:25:17,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:25:17,844 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,844 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2020-09-04 13:25:17,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553730414] [2020-09-04 13:25:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553730414] [2020-09-04 13:25:17,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599017683] [2020-09-04 13:25:17,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,875 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2020-09-04 13:25:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,896 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2020-09-04 13:25:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,899 INFO L225 Difference]: With dead ends: 428 [2020-09-04 13:25:17,900 INFO L226 Difference]: Without dead ends: 426 [2020-09-04 13:25:17,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-09-04 13:25:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2020-09-04 13:25:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-09-04 13:25:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2020-09-04 13:25:17,914 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2020-09-04 13:25:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:17,914 INFO L479 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2020-09-04 13:25:17,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2020-09-04 13:25:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:25:17,916 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:17,916 INFO L422 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] [2020-09-04 13:25:17,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:25:17,917 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:17,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2020-09-04 13:25:17,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:17,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083515558] [2020-09-04 13:25:17,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:17,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083515558] [2020-09-04 13:25:17,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:17,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:17,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449434254] [2020-09-04 13:25:17,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:17,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,947 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2020-09-04 13:25:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:17,971 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2020-09-04 13:25:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:17,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:25:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:17,975 INFO L225 Difference]: With dead ends: 764 [2020-09-04 13:25:17,975 INFO L226 Difference]: Without dead ends: 450 [2020-09-04 13:25:17,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-09-04 13:25:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2020-09-04 13:25:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-09-04 13:25:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2020-09-04 13:25:18,005 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2020-09-04 13:25:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:18,005 INFO L479 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2020-09-04 13:25:18,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2020-09-04 13:25:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:18,007 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:18,007 INFO L422 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] [2020-09-04 13:25:18,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:25:18,007 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2020-09-04 13:25:18,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:18,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883100296] [2020-09-04 13:25:18,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:18,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883100296] [2020-09-04 13:25:18,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:18,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:18,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291227395] [2020-09-04 13:25:18,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:18,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:18,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:18,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,065 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2020-09-04 13:25:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:18,099 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2020-09-04 13:25:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:18,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:18,104 INFO L225 Difference]: With dead ends: 672 [2020-09-04 13:25:18,104 INFO L226 Difference]: Without dead ends: 458 [2020-09-04 13:25:18,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-09-04 13:25:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2020-09-04 13:25:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-09-04 13:25:18,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2020-09-04 13:25:18,123 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2020-09-04 13:25:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:18,123 INFO L479 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2020-09-04 13:25:18,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2020-09-04 13:25:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:18,127 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:18,127 INFO L422 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] [2020-09-04 13:25:18,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:25:18,128 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2020-09-04 13:25:18,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:18,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345739069] [2020-09-04 13:25:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:18,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345739069] [2020-09-04 13:25:18,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:18,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:18,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689700018] [2020-09-04 13:25:18,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:18,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:18,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,178 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2020-09-04 13:25:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:18,206 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2020-09-04 13:25:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:18,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:18,211 INFO L225 Difference]: With dead ends: 812 [2020-09-04 13:25:18,211 INFO L226 Difference]: Without dead ends: 810 [2020-09-04 13:25:18,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2020-09-04 13:25:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2020-09-04 13:25:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2020-09-04 13:25:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2020-09-04 13:25:18,232 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2020-09-04 13:25:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:18,233 INFO L479 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2020-09-04 13:25:18,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2020-09-04 13:25:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:25:18,234 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:18,234 INFO L422 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] [2020-09-04 13:25:18,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:25:18,235 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2020-09-04 13:25:18,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:18,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460177378] [2020-09-04 13:25:18,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:18,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460177378] [2020-09-04 13:25:18,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:18,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:18,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354713516] [2020-09-04 13:25:18,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:18,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:18,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,278 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2020-09-04 13:25:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:18,308 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2020-09-04 13:25:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:18,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:25:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:18,313 INFO L225 Difference]: With dead ends: 1500 [2020-09-04 13:25:18,314 INFO L226 Difference]: Without dead ends: 874 [2020-09-04 13:25:18,316 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2020-09-04 13:25:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2020-09-04 13:25:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2020-09-04 13:25:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2020-09-04 13:25:18,348 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2020-09-04 13:25:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:18,349 INFO L479 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2020-09-04 13:25:18,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2020-09-04 13:25:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:25:18,351 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:18,351 INFO L422 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] [2020-09-04 13:25:18,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:25:18,351 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2020-09-04 13:25:18,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:18,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447244254] [2020-09-04 13:25:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:18,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447244254] [2020-09-04 13:25:18,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:18,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:18,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636246134] [2020-09-04 13:25:18,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:18,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,385 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2020-09-04 13:25:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:18,414 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2020-09-04 13:25:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:18,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:25:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:18,420 INFO L225 Difference]: With dead ends: 1308 [2020-09-04 13:25:18,420 INFO L226 Difference]: Without dead ends: 890 [2020-09-04 13:25:18,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2020-09-04 13:25:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2020-09-04 13:25:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2020-09-04 13:25:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2020-09-04 13:25:18,453 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2020-09-04 13:25:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:18,454 INFO L479 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2020-09-04 13:25:18,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2020-09-04 13:25:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:25:18,456 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:18,456 INFO L422 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] [2020-09-04 13:25:18,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:25:18,456 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:18,457 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2020-09-04 13:25:18,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:18,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475863230] [2020-09-04 13:25:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:18,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475863230] [2020-09-04 13:25:18,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:18,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:18,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515830864] [2020-09-04 13:25:18,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:18,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:18,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,502 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2020-09-04 13:25:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:18,538 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2020-09-04 13:25:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:18,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:25:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:18,547 INFO L225 Difference]: With dead ends: 1548 [2020-09-04 13:25:18,547 INFO L226 Difference]: Without dead ends: 1546 [2020-09-04 13:25:18,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-09-04 13:25:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2020-09-04 13:25:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2020-09-04 13:25:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2020-09-04 13:25:18,590 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2020-09-04 13:25:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:18,591 INFO L479 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2020-09-04 13:25:18,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2020-09-04 13:25:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:25:18,594 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:18,594 INFO L422 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] [2020-09-04 13:25:18,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:25:18,595 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2020-09-04 13:25:18,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:18,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513324954] [2020-09-04 13:25:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:18,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513324954] [2020-09-04 13:25:18,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:18,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:18,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026499226] [2020-09-04 13:25:18,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:18,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:18,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:18,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,653 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2020-09-04 13:25:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:18,708 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2020-09-04 13:25:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:18,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:25:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:18,719 INFO L225 Difference]: With dead ends: 2956 [2020-09-04 13:25:18,719 INFO L226 Difference]: Without dead ends: 1706 [2020-09-04 13:25:18,724 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-09-04 13:25:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2020-09-04 13:25:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2020-09-04 13:25:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2020-09-04 13:25:18,786 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2020-09-04 13:25:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:18,787 INFO L479 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2020-09-04 13:25:18,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2020-09-04 13:25:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:25:18,790 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:18,790 INFO L422 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] [2020-09-04 13:25:18,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:25:18,791 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2020-09-04 13:25:18,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:18,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315412834] [2020-09-04 13:25:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:18,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315412834] [2020-09-04 13:25:18,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:18,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:18,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376509273] [2020-09-04 13:25:18,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:18,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:18,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:18,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,826 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2020-09-04 13:25:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:18,873 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2020-09-04 13:25:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:18,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:25:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:18,883 INFO L225 Difference]: With dead ends: 2556 [2020-09-04 13:25:18,883 INFO L226 Difference]: Without dead ends: 1738 [2020-09-04 13:25:18,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-09-04 13:25:18,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2020-09-04 13:25:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2020-09-04 13:25:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2020-09-04 13:25:18,945 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2020-09-04 13:25:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:18,946 INFO L479 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2020-09-04 13:25:18,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2020-09-04 13:25:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:25:18,948 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:18,949 INFO L422 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] [2020-09-04 13:25:18,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:25:18,949 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2020-09-04 13:25:18,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:18,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304155701] [2020-09-04 13:25:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:18,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304155701] [2020-09-04 13:25:18,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:18,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:18,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837007392] [2020-09-04 13:25:18,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:18,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:18,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:18,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:18,982 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2020-09-04 13:25:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:19,058 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2020-09-04 13:25:19,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:19,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:25:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:19,079 INFO L225 Difference]: With dead ends: 2956 [2020-09-04 13:25:19,079 INFO L226 Difference]: Without dead ends: 2954 [2020-09-04 13:25:19,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-09-04 13:25:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2020-09-04 13:25:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2020-09-04 13:25:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2020-09-04 13:25:19,209 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2020-09-04 13:25:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:19,210 INFO L479 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2020-09-04 13:25:19,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2020-09-04 13:25:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:25:19,216 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:19,217 INFO L422 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] [2020-09-04 13:25:19,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 13:25:19,217 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2020-09-04 13:25:19,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:19,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732318945] [2020-09-04 13:25:19,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:19,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:19,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732318945] [2020-09-04 13:25:19,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:19,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:19,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244970844] [2020-09-04 13:25:19,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:19,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:19,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:19,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:19,250 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2020-09-04 13:25:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:19,341 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2020-09-04 13:25:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:19,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:25:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:19,358 INFO L225 Difference]: With dead ends: 5836 [2020-09-04 13:25:19,358 INFO L226 Difference]: Without dead ends: 3338 [2020-09-04 13:25:19,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-09-04 13:25:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2020-09-04 13:25:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2020-09-04 13:25:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2020-09-04 13:25:19,480 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2020-09-04 13:25:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:19,481 INFO L479 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2020-09-04 13:25:19,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2020-09-04 13:25:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:25:19,486 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:19,486 INFO L422 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] [2020-09-04 13:25:19,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:25:19,487 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2020-09-04 13:25:19,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:19,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439631249] [2020-09-04 13:25:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:19,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:19,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439631249] [2020-09-04 13:25:19,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:19,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:19,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842184551] [2020-09-04 13:25:19,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:19,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:19,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:19,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:19,514 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2020-09-04 13:25:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:19,586 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2020-09-04 13:25:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:19,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:25:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:19,603 INFO L225 Difference]: With dead ends: 5004 [2020-09-04 13:25:19,603 INFO L226 Difference]: Without dead ends: 3402 [2020-09-04 13:25:19,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2020-09-04 13:25:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2020-09-04 13:25:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2020-09-04 13:25:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2020-09-04 13:25:19,745 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2020-09-04 13:25:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:19,746 INFO L479 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2020-09-04 13:25:19,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2020-09-04 13:25:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:25:19,751 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:19,751 INFO L422 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] [2020-09-04 13:25:19,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 13:25:19,751 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2020-09-04 13:25:19,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:19,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161984196] [2020-09-04 13:25:19,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:19,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:19,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161984196] [2020-09-04 13:25:19,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:19,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:19,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110138937] [2020-09-04 13:25:19,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:19,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:19,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:19,791 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2020-09-04 13:25:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:19,906 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2020-09-04 13:25:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:19,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:25:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:19,957 INFO L225 Difference]: With dead ends: 9804 [2020-09-04 13:25:19,957 INFO L226 Difference]: Without dead ends: 6538 [2020-09-04 13:25:19,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:19,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2020-09-04 13:25:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2020-09-04 13:25:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2020-09-04 13:25:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2020-09-04 13:25:20,181 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2020-09-04 13:25:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:20,181 INFO L479 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2020-09-04 13:25:20,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2020-09-04 13:25:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:25:20,191 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:20,192 INFO L422 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] [2020-09-04 13:25:20,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 13:25:20,192 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2020-09-04 13:25:20,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:20,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276118610] [2020-09-04 13:25:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:20,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:20,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276118610] [2020-09-04 13:25:20,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:20,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:20,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316609569] [2020-09-04 13:25:20,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:20,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:20,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:20,233 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2020-09-04 13:25:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:20,375 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2020-09-04 13:25:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:20,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:25:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:20,394 INFO L225 Difference]: With dead ends: 7052 [2020-09-04 13:25:20,395 INFO L226 Difference]: Without dead ends: 7050 [2020-09-04 13:25:20,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2020-09-04 13:25:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2020-09-04 13:25:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2020-09-04 13:25:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2020-09-04 13:25:20,632 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2020-09-04 13:25:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:20,632 INFO L479 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2020-09-04 13:25:20,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2020-09-04 13:25:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:25:20,648 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:20,648 INFO L422 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] [2020-09-04 13:25:20,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 13:25:20,649 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2020-09-04 13:25:20,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:20,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514112272] [2020-09-04 13:25:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:20,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:20,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514112272] [2020-09-04 13:25:20,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:20,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:20,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644311068] [2020-09-04 13:25:20,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:20,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:20,679 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2020-09-04 13:25:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:20,839 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2020-09-04 13:25:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:20,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-04 13:25:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:20,863 INFO L225 Difference]: With dead ends: 10634 [2020-09-04 13:25:20,863 INFO L226 Difference]: Without dead ends: 10632 [2020-09-04 13:25:20,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2020-09-04 13:25:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2020-09-04 13:25:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2020-09-04 13:25:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2020-09-04 13:25:21,135 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2020-09-04 13:25:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:21,136 INFO L479 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2020-09-04 13:25:21,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2020-09-04 13:25:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:25:21,153 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:21,153 INFO L422 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] [2020-09-04 13:25:21,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 13:25:21,154 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2020-09-04 13:25:21,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:21,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106602014] [2020-09-04 13:25:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:21,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:21,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106602014] [2020-09-04 13:25:21,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:21,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:21,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588431433] [2020-09-04 13:25:21,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:21,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:21,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:21,185 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2020-09-04 13:25:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:21,413 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2020-09-04 13:25:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:21,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-04 13:25:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:21,415 INFO L225 Difference]: With dead ends: 22664 [2020-09-04 13:25:21,415 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:25:21,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:25:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:25:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:25:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:25:21,465 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-09-04 13:25:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:21,466 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:25:21,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:25:21,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:25:21,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 13:25:21,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:25:21,497 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 13:25:21,497 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:21,497 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:21,497 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 13:25:21,497 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:25:21,497 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:25:21,498 INFO L268 CegarLoopResult]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,498 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2020-09-04 13:25:21,498 INFO L268 CegarLoopResult]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,498 INFO L268 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-09-04 13:25:21,498 INFO L268 CegarLoopResult]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,498 INFO L268 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2020-09-04 13:25:21,498 INFO L268 CegarLoopResult]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,499 INFO L268 CegarLoopResult]: For program point L61(lines 61 63) no Hoare annotation was computed. [2020-09-04 13:25:21,499 INFO L268 CegarLoopResult]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,500 INFO L268 CegarLoopResult]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,500 INFO L268 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2020-09-04 13:25:21,500 INFO L271 CegarLoopResult]: At program point L145(lines 5 149) the Hoare annotation is: true [2020-09-04 13:25:21,500 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2020-09-04 13:25:21,500 INFO L268 CegarLoopResult]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,501 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-09-04 13:25:21,501 INFO L268 CegarLoopResult]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,501 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2020-09-04 13:25:21,501 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2020-09-04 13:25:21,501 INFO L268 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2020-09-04 13:25:21,501 INFO L268 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2020-09-04 13:25:21,501 INFO L268 CegarLoopResult]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,502 INFO L268 CegarLoopResult]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,502 INFO L268 CegarLoopResult]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,502 INFO L271 CegarLoopResult]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2020-09-04 13:25:21,502 INFO L268 CegarLoopResult]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,502 INFO L268 CegarLoopResult]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,502 INFO L268 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2020-09-04 13:25:21,502 INFO L268 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-09-04 13:25:21,502 INFO L264 CegarLoopResult]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2020-09-04 13:25:21,503 INFO L268 CegarLoopResult]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,503 INFO L268 CegarLoopResult]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,503 INFO L268 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2020-09-04 13:25:21,503 INFO L268 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-09-04 13:25:21,503 INFO L268 CegarLoopResult]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,503 INFO L268 CegarLoopResult]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2020-09-04 13:25:21,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:25:21 BoogieIcfgContainer [2020-09-04 13:25:21,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:25:21,532 INFO L168 Benchmark]: Toolchain (without parser) took 6219.49 ms. Allocated memory was 139.5 MB in the beginning and 357.6 MB in the end (delta: 218.1 MB). Free memory was 102.6 MB in the beginning and 170.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 149.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:21,533 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:25:21,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.42 ms. Allocated memory is still 139.5 MB. Free memory was 102.4 MB in the beginning and 91.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:21,534 INFO L168 Benchmark]: Boogie Preprocessor took 133.97 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 91.4 MB in the beginning and 179.9 MB in the end (delta: -88.5 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:21,536 INFO L168 Benchmark]: RCFGBuilder took 430.03 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 161.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:21,542 INFO L168 Benchmark]: TraceAbstraction took 5193.36 ms. Allocated memory was 202.4 MB in the beginning and 357.6 MB in the end (delta: 155.2 MB). Free memory was 161.2 MB in the beginning and 170.9 MB in the end (delta: -9.7 MB). Peak memory consumption was 145.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:21,544 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 455.42 ms. Allocated memory is still 139.5 MB. Free memory was 102.4 MB in the beginning and 91.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.97 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 91.4 MB in the beginning and 179.9 MB in the end (delta: -88.5 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 430.03 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 161.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5193.36 ms. Allocated memory was 202.4 MB in the beginning and 357.6 MB in the end (delta: 155.2 MB). Free memory was 161.2 MB in the beginning and 170.9 MB in the end (delta: -9.7 MB). Peak memory consumption was 145.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...