/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 --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 03:36:53,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 03:36:53,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 03:36:53,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 03:36:53,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 03:36:53,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 03:36:53,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 03:36:53,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 03:36:53,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 03:36:53,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 03:36:53,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 03:36:53,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 03:36:53,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 03:36:53,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 03:36:53,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 03:36:53,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 03:36:53,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 03:36:53,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 03:36:53,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 03:36:53,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 03:36:53,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 03:36:53,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 03:36:53,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 03:36:53,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 03:36:53,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 03:36:53,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 03:36:53,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 03:36:53,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 03:36:53,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 03:36:53,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 03:36:53,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 03:36:53,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 03:36:53,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 03:36:53,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 03:36:53,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 03:36:53,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 03:36:53,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 03:36:53,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 03:36:53,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 03:36:53,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 03:36:53,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 03:36:53,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 03:36:54,008 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 03:36:54,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 03:36:54,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 03:36:54,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 03:36:54,011 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 03:36:54,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 03:36:54,012 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 03:36:54,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 03:36:54,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 03:36:54,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 03:36:54,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 03:36:54,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 03:36:54,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 03:36:54,015 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 03:36:54,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 03:36:54,015 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 03:36:54,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 03:36:54,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 03:36:54,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 03:36:54,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 03:36:54,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 03:36:54,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 03:36:54,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 03:36:54,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 03:36:54,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 03:36:54,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 03:36:54,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 03:36:54,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 03:36:54,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 03:36:54,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 03:36:54,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 03:36:54,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 03:36:54,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 03:36:54,323 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 03:36:54,323 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 03:36:54,324 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2020-07-20 03:36:54,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5338fb5/0a2309e01a17457eb3ac7d3fe9d81f08/FLAG4792655c0 [2020-07-20 03:36:54,860 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 03:36:54,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2020-07-20 03:36:54,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5338fb5/0a2309e01a17457eb3ac7d3fe9d81f08/FLAG4792655c0 [2020-07-20 03:36:55,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5338fb5/0a2309e01a17457eb3ac7d3fe9d81f08 [2020-07-20 03:36:55,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 03:36:55,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 03:36:55,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 03:36:55,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 03:36:55,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 03:36:55,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a28978d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55, skipping insertion in model container [2020-07-20 03:36:55,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 03:36:55,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 03:36:55,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:36:55,518 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 03:36:55,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:36:55,586 INFO L208 MainTranslator]: Completed translation [2020-07-20 03:36:55,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55 WrapperNode [2020-07-20 03:36:55,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 03:36:55,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 03:36:55,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 03:36:55,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 03:36:55,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (1/1) ... [2020-07-20 03:36:55,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 03:36:55,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 03:36:55,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 03:36:55,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 03:36:55,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 03:36:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 03:36:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 03:36:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 03:36:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 03:36:55,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 03:36:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 03:36:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 03:36:55,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 03:36:56,099 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 03:36:56,100 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-20 03:36:56,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:36:56 BoogieIcfgContainer [2020-07-20 03:36:56,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 03:36:56,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 03:36:56,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 03:36:56,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 03:36:56,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:36:55" (1/3) ... [2020-07-20 03:36:56,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1853257f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:36:56, skipping insertion in model container [2020-07-20 03:36:56,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:36:55" (2/3) ... [2020-07-20 03:36:56,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1853257f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:36:56, skipping insertion in model container [2020-07-20 03:36:56,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:36:56" (3/3) ... [2020-07-20 03:36:56,117 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2020-07-20 03:36:56,131 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 03:36:56,141 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 03:36:56,176 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 03:36:56,218 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 03:36:56,219 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 03:36:56,219 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 03:36:56,219 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 03:36:56,219 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 03:36:56,219 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 03:36:56,220 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 03:36:56,220 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 03:36:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-20 03:36:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-20 03:36:56,251 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:56,252 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-07-20 03:36:56,253 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:56,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:56,259 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2020-07-20 03:36:56,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:56,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830748795] [2020-07-20 03:36:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:56,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830748795] [2020-07-20 03:36:56,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:56,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:56,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993539167] [2020-07-20 03:36:56,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:56,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:56,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:56,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:56,509 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-20 03:36:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:56,570 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2020-07-20 03:36:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:56,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-20 03:36:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:56,587 INFO L225 Difference]: With dead ends: 87 [2020-07-20 03:36:56,588 INFO L226 Difference]: Without dead ends: 72 [2020-07-20 03:36:56,595 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-07-20 03:36:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-20 03:36:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-07-20 03:36:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-20 03:36:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2020-07-20 03:36:56,673 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2020-07-20 03:36:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:56,674 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2020-07-20 03:36:56,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2020-07-20 03:36:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-20 03:36:56,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:56,677 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-07-20 03:36:56,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 03:36:56,679 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:56,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2020-07-20 03:36:56,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:56,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120562179] [2020-07-20 03:36:56,682 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:56,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120562179] [2020-07-20 03:36:56,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:56,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:56,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344656082] [2020-07-20 03:36:56,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:56,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:56,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:56,826 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2020-07-20 03:36:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:56,876 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2020-07-20 03:36:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:56,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-20 03:36:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:56,880 INFO L225 Difference]: With dead ends: 117 [2020-07-20 03:36:56,880 INFO L226 Difference]: Without dead ends: 72 [2020-07-20 03:36:56,882 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-07-20 03:36:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-20 03:36:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-07-20 03:36:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-20 03:36:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2020-07-20 03:36:56,894 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2020-07-20 03:36:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:56,895 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2020-07-20 03:36:56,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2020-07-20 03:36:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-20 03:36:56,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:56,896 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-07-20 03:36:56,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 03:36:56,897 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2020-07-20 03:36:56,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:56,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961692487] [2020-07-20 03:36:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:56,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961692487] [2020-07-20 03:36:56,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:56,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:56,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612048925] [2020-07-20 03:36:56,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:56,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:56,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:56,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:56,959 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2020-07-20 03:36:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:56,982 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2020-07-20 03:36:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:56,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-20 03:36:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:56,984 INFO L225 Difference]: With dead ends: 108 [2020-07-20 03:36:56,984 INFO L226 Difference]: Without dead ends: 75 [2020-07-20 03:36:56,985 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-07-20 03:36:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-20 03:36:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-07-20 03:36:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-20 03:36:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2020-07-20 03:36:56,996 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2020-07-20 03:36:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:56,997 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2020-07-20 03:36:56,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2020-07-20 03:36:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-20 03:36:56,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:56,998 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-07-20 03:36:56,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 03:36:56,999 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2020-07-20 03:36:57,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361048467] [2020-07-20 03:36:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361048467] [2020-07-20 03:36:57,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163528037] [2020-07-20 03:36:57,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,089 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2020-07-20 03:36:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,120 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2020-07-20 03:36:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-20 03:36:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,123 INFO L225 Difference]: With dead ends: 136 [2020-07-20 03:36:57,123 INFO L226 Difference]: Without dead ends: 134 [2020-07-20 03:36:57,124 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-07-20 03:36:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-20 03:36:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2020-07-20 03:36:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-20 03:36:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2020-07-20 03:36:57,136 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2020-07-20 03:36:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,137 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2020-07-20 03:36:57,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,137 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2020-07-20 03:36:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-20 03:36:57,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,138 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-07-20 03:36:57,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 03:36:57,139 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,139 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2020-07-20 03:36:57,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518057775] [2020-07-20 03:36:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518057775] [2020-07-20 03:36:57,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713839344] [2020-07-20 03:36:57,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,181 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2020-07-20 03:36:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,209 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2020-07-20 03:36:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-20 03:36:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,212 INFO L225 Difference]: With dead ends: 224 [2020-07-20 03:36:57,212 INFO L226 Difference]: Without dead ends: 136 [2020-07-20 03:36:57,213 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-07-20 03:36:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-20 03:36:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2020-07-20 03:36:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-20 03:36:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2020-07-20 03:36:57,227 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2020-07-20 03:36:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,227 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2020-07-20 03:36:57,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2020-07-20 03:36:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 03:36:57,229 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,229 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-07-20 03:36:57,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 03:36:57,230 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2020-07-20 03:36:57,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568740836] [2020-07-20 03:36:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,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-07-20 03:36:57,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568740836] [2020-07-20 03:36:57,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307318875] [2020-07-20 03:36:57,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,279 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2020-07-20 03:36:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,300 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2020-07-20 03:36:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-20 03:36:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,303 INFO L225 Difference]: With dead ends: 201 [2020-07-20 03:36:57,303 INFO L226 Difference]: Without dead ends: 138 [2020-07-20 03:36:57,304 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-07-20 03:36:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-20 03:36:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-20 03:36:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-20 03:36:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2020-07-20 03:36:57,320 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2020-07-20 03:36:57,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,321 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2020-07-20 03:36:57,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2020-07-20 03:36:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 03:36:57,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,336 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-07-20 03:36:57,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 03:36:57,337 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2020-07-20 03:36:57,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613409015] [2020-07-20 03:36:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613409015] [2020-07-20 03:36:57,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335465033] [2020-07-20 03:36:57,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,370 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2020-07-20 03:36:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,390 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2020-07-20 03:36:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-20 03:36:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,392 INFO L225 Difference]: With dead ends: 252 [2020-07-20 03:36:57,393 INFO L226 Difference]: Without dead ends: 250 [2020-07-20 03:36:57,393 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-07-20 03:36:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-07-20 03:36:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2020-07-20 03:36:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-20 03:36:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2020-07-20 03:36:57,407 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2020-07-20 03:36:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,407 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2020-07-20 03:36:57,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2020-07-20 03:36:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 03:36:57,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,409 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-07-20 03:36:57,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 03:36:57,410 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,410 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2020-07-20 03:36:57,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225046616] [2020-07-20 03:36:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225046616] [2020-07-20 03:36:57,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771535119] [2020-07-20 03:36:57,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,440 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2020-07-20 03:36:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,461 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2020-07-20 03:36:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-20 03:36:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,464 INFO L225 Difference]: With dead ends: 432 [2020-07-20 03:36:57,464 INFO L226 Difference]: Without dead ends: 258 [2020-07-20 03:36:57,466 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-07-20 03:36:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-07-20 03:36:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2020-07-20 03:36:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-07-20 03:36:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2020-07-20 03:36:57,481 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2020-07-20 03:36:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,481 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2020-07-20 03:36:57,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2020-07-20 03:36:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-20 03:36:57,483 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,483 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-07-20 03:36:57,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 03:36:57,484 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2020-07-20 03:36:57,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983648085] [2020-07-20 03:36:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983648085] [2020-07-20 03:36:57,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186969940] [2020-07-20 03:36:57,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,513 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2020-07-20 03:36:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,533 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2020-07-20 03:36:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-20 03:36:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,536 INFO L225 Difference]: With dead ends: 384 [2020-07-20 03:36:57,536 INFO L226 Difference]: Without dead ends: 262 [2020-07-20 03:36:57,537 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-07-20 03:36:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-07-20 03:36:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-07-20 03:36:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-07-20 03:36:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2020-07-20 03:36:57,549 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2020-07-20 03:36:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,550 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2020-07-20 03:36:57,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2020-07-20 03:36:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-20 03:36:57,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,552 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-07-20 03:36:57,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 03:36:57,552 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2020-07-20 03:36:57,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233916577] [2020-07-20 03:36:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233916577] [2020-07-20 03:36:57,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640781008] [2020-07-20 03:36:57,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,606 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2020-07-20 03:36:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,641 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2020-07-20 03:36:57,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-20 03:36:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,645 INFO L225 Difference]: With dead ends: 476 [2020-07-20 03:36:57,646 INFO L226 Difference]: Without dead ends: 474 [2020-07-20 03:36:57,646 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-07-20 03:36:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-07-20 03:36:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2020-07-20 03:36:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-07-20 03:36:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2020-07-20 03:36:57,661 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2020-07-20 03:36:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,661 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2020-07-20 03:36:57,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2020-07-20 03:36:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-20 03:36:57,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,663 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-07-20 03:36:57,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 03:36:57,663 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2020-07-20 03:36:57,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163279064] [2020-07-20 03:36:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163279064] [2020-07-20 03:36:57,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185949700] [2020-07-20 03:36:57,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,697 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2020-07-20 03:36:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,744 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2020-07-20 03:36:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-20 03:36:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,750 INFO L225 Difference]: With dead ends: 844 [2020-07-20 03:36:57,751 INFO L226 Difference]: Without dead ends: 498 [2020-07-20 03:36:57,753 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-07-20 03:36:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-07-20 03:36:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2020-07-20 03:36:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-07-20 03:36:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2020-07-20 03:36:57,776 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2020-07-20 03:36:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,777 INFO L479 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2020-07-20 03:36:57,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2020-07-20 03:36:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 03:36:57,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,780 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-07-20 03:36:57,780 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 03:36:57,781 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,781 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2020-07-20 03:36:57,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370201276] [2020-07-20 03:36:57,782 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370201276] [2020-07-20 03:36:57,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575932676] [2020-07-20 03:36:57,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,843 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2020-07-20 03:36:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,868 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2020-07-20 03:36:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-20 03:36:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,872 INFO L225 Difference]: With dead ends: 744 [2020-07-20 03:36:57,872 INFO L226 Difference]: Without dead ends: 506 [2020-07-20 03:36:57,874 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-07-20 03:36:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-07-20 03:36:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2020-07-20 03:36:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-07-20 03:36:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2020-07-20 03:36:57,892 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2020-07-20 03:36:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:57,893 INFO L479 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2020-07-20 03:36:57,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2020-07-20 03:36:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 03:36:57,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:57,894 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-07-20 03:36:57,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-20 03:36:57,895 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:57,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2020-07-20 03:36:57,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:57,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72325234] [2020-07-20 03:36:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:57,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72325234] [2020-07-20 03:36:57,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:57,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:57,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25001395] [2020-07-20 03:36:57,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:57,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:57,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:57,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:57,939 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2020-07-20 03:36:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:57,975 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2020-07-20 03:36:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:57,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-20 03:36:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:57,985 INFO L225 Difference]: With dead ends: 908 [2020-07-20 03:36:57,985 INFO L226 Difference]: Without dead ends: 906 [2020-07-20 03:36:57,986 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-07-20 03:36:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-07-20 03:36:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2020-07-20 03:36:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-07-20 03:36:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2020-07-20 03:36:58,011 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2020-07-20 03:36:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:58,011 INFO L479 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2020-07-20 03:36:58,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2020-07-20 03:36:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 03:36:58,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:58,013 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-07-20 03:36:58,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 03:36:58,014 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:58,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2020-07-20 03:36:58,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:58,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584558544] [2020-07-20 03:36:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:58,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584558544] [2020-07-20 03:36:58,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:58,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:58,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992472344] [2020-07-20 03:36:58,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:58,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:58,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:58,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:58,052 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2020-07-20 03:36:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:58,088 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2020-07-20 03:36:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:58,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-20 03:36:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:58,094 INFO L225 Difference]: With dead ends: 1660 [2020-07-20 03:36:58,094 INFO L226 Difference]: Without dead ends: 970 [2020-07-20 03:36:58,097 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-07-20 03:36:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2020-07-20 03:36:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2020-07-20 03:36:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2020-07-20 03:36:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2020-07-20 03:36:58,137 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2020-07-20 03:36:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:58,137 INFO L479 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2020-07-20 03:36:58,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2020-07-20 03:36:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-20 03:36:58,139 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:58,140 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-07-20 03:36:58,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-20 03:36:58,140 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2020-07-20 03:36:58,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:58,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824228021] [2020-07-20 03:36:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:58,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824228021] [2020-07-20 03:36:58,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:58,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:58,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285292173] [2020-07-20 03:36:58,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:58,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:58,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:58,176 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2020-07-20 03:36:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:58,228 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2020-07-20 03:36:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:58,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-20 03:36:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:58,235 INFO L225 Difference]: With dead ends: 1452 [2020-07-20 03:36:58,236 INFO L226 Difference]: Without dead ends: 986 [2020-07-20 03:36:58,239 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-07-20 03:36:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-07-20 03:36:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2020-07-20 03:36:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-07-20 03:36:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2020-07-20 03:36:58,281 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2020-07-20 03:36:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:58,283 INFO L479 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2020-07-20 03:36:58,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2020-07-20 03:36:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-20 03:36:58,286 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:58,286 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-07-20 03:36:58,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 03:36:58,286 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2020-07-20 03:36:58,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:58,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560285907] [2020-07-20 03:36:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:58,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560285907] [2020-07-20 03:36:58,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:58,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:58,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920512998] [2020-07-20 03:36:58,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:58,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:58,328 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2020-07-20 03:36:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:58,364 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2020-07-20 03:36:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:58,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-20 03:36:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:58,374 INFO L225 Difference]: With dead ends: 1740 [2020-07-20 03:36:58,375 INFO L226 Difference]: Without dead ends: 1738 [2020-07-20 03:36:58,377 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-07-20 03:36:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-07-20 03:36:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2020-07-20 03:36:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2020-07-20 03:36:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2020-07-20 03:36:58,420 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2020-07-20 03:36:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:58,421 INFO L479 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2020-07-20 03:36:58,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2020-07-20 03:36:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-20 03:36:58,425 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:58,425 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-07-20 03:36:58,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-20 03:36:58,426 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:58,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2020-07-20 03:36:58,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:58,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240543508] [2020-07-20 03:36:58,427 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:58,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240543508] [2020-07-20 03:36:58,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:58,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:58,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655733033] [2020-07-20 03:36:58,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:58,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:58,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:58,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:58,452 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2020-07-20 03:36:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:58,502 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2020-07-20 03:36:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:58,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-20 03:36:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:58,513 INFO L225 Difference]: With dead ends: 3276 [2020-07-20 03:36:58,513 INFO L226 Difference]: Without dead ends: 1898 [2020-07-20 03:36:58,517 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-07-20 03:36:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-07-20 03:36:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2020-07-20 03:36:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2020-07-20 03:36:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2020-07-20 03:36:58,577 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2020-07-20 03:36:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:58,578 INFO L479 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2020-07-20 03:36:58,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2020-07-20 03:36:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 03:36:58,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:58,581 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-07-20 03:36:58,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-20 03:36:58,581 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:58,582 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2020-07-20 03:36:58,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:58,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371639524] [2020-07-20 03:36:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:58,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371639524] [2020-07-20 03:36:58,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:58,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:58,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698458104] [2020-07-20 03:36:58,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:58,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:58,611 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2020-07-20 03:36:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:58,657 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2020-07-20 03:36:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:58,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-20 03:36:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:58,667 INFO L225 Difference]: With dead ends: 2844 [2020-07-20 03:36:58,668 INFO L226 Difference]: Without dead ends: 1930 [2020-07-20 03:36:58,670 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-07-20 03:36:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-07-20 03:36:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2020-07-20 03:36:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2020-07-20 03:36:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2020-07-20 03:36:58,727 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2020-07-20 03:36:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:58,728 INFO L479 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2020-07-20 03:36:58,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2020-07-20 03:36:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 03:36:58,730 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:58,730 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-07-20 03:36:58,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-20 03:36:58,731 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:58,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:58,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2020-07-20 03:36:58,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:58,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926662762] [2020-07-20 03:36:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:58,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926662762] [2020-07-20 03:36:58,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:58,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:58,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675632354] [2020-07-20 03:36:58,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:58,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:58,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:58,776 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2020-07-20 03:36:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:58,830 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2020-07-20 03:36:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:58,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-20 03:36:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:58,847 INFO L225 Difference]: With dead ends: 3340 [2020-07-20 03:36:58,847 INFO L226 Difference]: Without dead ends: 3338 [2020-07-20 03:36:58,849 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-07-20 03:36:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-07-20 03:36:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2020-07-20 03:36:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2020-07-20 03:36:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2020-07-20 03:36:58,925 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2020-07-20 03:36:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:58,926 INFO L479 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2020-07-20 03:36:58,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2020-07-20 03:36:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 03:36:58,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:58,930 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-07-20 03:36:58,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-20 03:36:58,931 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:58,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:58,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2020-07-20 03:36:58,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:58,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341009288] [2020-07-20 03:36:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:58,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341009288] [2020-07-20 03:36:58,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:58,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:58,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556144051] [2020-07-20 03:36:58,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:58,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:58,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:58,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:58,952 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2020-07-20 03:36:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:59,026 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2020-07-20 03:36:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:59,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-20 03:36:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:59,045 INFO L225 Difference]: With dead ends: 6476 [2020-07-20 03:36:59,045 INFO L226 Difference]: Without dead ends: 3722 [2020-07-20 03:36:59,052 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-07-20 03:36:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-07-20 03:36:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2020-07-20 03:36:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2020-07-20 03:36:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2020-07-20 03:36:59,191 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2020-07-20 03:36:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:59,191 INFO L479 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2020-07-20 03:36:59,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2020-07-20 03:36:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 03:36:59,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:59,196 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-07-20 03:36:59,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-20 03:36:59,197 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2020-07-20 03:36:59,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:59,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771495071] [2020-07-20 03:36:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:59,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771495071] [2020-07-20 03:36:59,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:59,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:59,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729366052] [2020-07-20 03:36:59,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:59,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:59,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:59,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:59,219 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2020-07-20 03:36:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:59,360 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2020-07-20 03:36:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:59,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-20 03:36:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:59,380 INFO L225 Difference]: With dead ends: 5580 [2020-07-20 03:36:59,380 INFO L226 Difference]: Without dead ends: 3786 [2020-07-20 03:36:59,385 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-07-20 03:36:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2020-07-20 03:36:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2020-07-20 03:36:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2020-07-20 03:36:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2020-07-20 03:36:59,512 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2020-07-20 03:36:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:36:59,512 INFO L479 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2020-07-20 03:36:59,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:36:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2020-07-20 03:36:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 03:36:59,518 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:36:59,518 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-07-20 03:36:59,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-20 03:36:59,518 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:36:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:36:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2020-07-20 03:36:59,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:36:59,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749402352] [2020-07-20 03:36:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:36:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:36:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:36:59,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749402352] [2020-07-20 03:36:59,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:36:59,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:36:59,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069125501] [2020-07-20 03:36:59,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:36:59,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:36:59,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:36:59,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:36:59,546 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2020-07-20 03:36:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:36:59,661 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2020-07-20 03:36:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:36:59,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-20 03:36:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:36:59,692 INFO L225 Difference]: With dead ends: 10956 [2020-07-20 03:36:59,692 INFO L226 Difference]: Without dead ends: 7306 [2020-07-20 03:36:59,701 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-07-20 03:36:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2020-07-20 03:36:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2020-07-20 03:36:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-07-20 03:37:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2020-07-20 03:37:00,002 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2020-07-20 03:37:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:37:00,003 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2020-07-20 03:37:00,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:37:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2020-07-20 03:37:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 03:37:00,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:37:00,014 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-07-20 03:37:00,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-20 03:37:00,014 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:37:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:37:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2020-07-20 03:37:00,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:37:00,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253090517] [2020-07-20 03:37:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:37:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:37:00,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253090517] [2020-07-20 03:37:00,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:37:00,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:37:00,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921191571] [2020-07-20 03:37:00,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:37:00,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:37:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:37:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:37:00,059 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2020-07-20 03:37:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:37:00,203 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2020-07-20 03:37:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:37:00,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-20 03:37:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:37:00,235 INFO L225 Difference]: With dead ends: 8076 [2020-07-20 03:37:00,235 INFO L226 Difference]: Without dead ends: 8074 [2020-07-20 03:37:00,239 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-07-20 03:37:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-07-20 03:37:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2020-07-20 03:37:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-07-20 03:37:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2020-07-20 03:37:00,457 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2020-07-20 03:37:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:37:00,457 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2020-07-20 03:37:00,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:37:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2020-07-20 03:37:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 03:37:00,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:37:00,476 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, 1] [2020-07-20 03:37:00,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-20 03:37:00,476 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:37:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:37:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2020-07-20 03:37:00,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:37:00,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264361148] [2020-07-20 03:37:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:37:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:37:00,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264361148] [2020-07-20 03:37:00,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:37:00,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:37:00,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367368468] [2020-07-20 03:37:00,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:37:00,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:37:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:37:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:37:00,541 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2020-07-20 03:37:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:37:00,862 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2020-07-20 03:37:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:37:00,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-20 03:37:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:37:00,890 INFO L225 Difference]: With dead ends: 12172 [2020-07-20 03:37:00,890 INFO L226 Difference]: Without dead ends: 12170 [2020-07-20 03:37:00,894 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-07-20 03:37:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2020-07-20 03:37:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2020-07-20 03:37:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2020-07-20 03:37:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2020-07-20 03:37:01,171 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2020-07-20 03:37:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:37:01,172 INFO L479 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2020-07-20 03:37:01,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:37:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2020-07-20 03:37:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 03:37:01,192 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:37:01,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, 1, 1] [2020-07-20 03:37:01,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-20 03:37:01,192 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:37:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:37:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2020-07-20 03:37:01,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:37:01,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402536278] [2020-07-20 03:37:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:37:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:37:01,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402536278] [2020-07-20 03:37:01,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:37:01,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:37:01,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186254998] [2020-07-20 03:37:01,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:37:01,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:37:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:37:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:37:01,213 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2020-07-20 03:37:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:37:01,555 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2020-07-20 03:37:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:37:01,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-20 03:37:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:37:01,583 INFO L225 Difference]: With dead ends: 25228 [2020-07-20 03:37:01,584 INFO L226 Difference]: Without dead ends: 14218 [2020-07-20 03:37:01,603 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-07-20 03:37:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2020-07-20 03:37:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2020-07-20 03:37:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2020-07-20 03:37:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2020-07-20 03:37:01,941 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2020-07-20 03:37:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:37:01,941 INFO L479 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2020-07-20 03:37:01,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:37:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2020-07-20 03:37:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-20 03:37:01,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:37:01,959 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, 1, 1] [2020-07-20 03:37:01,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-20 03:37:01,959 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:37:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:37:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2020-07-20 03:37:01,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:37:01,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598624896] [2020-07-20 03:37:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:37:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:37:01,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598624896] [2020-07-20 03:37:01,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:37:01,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:37:01,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283775225] [2020-07-20 03:37:01,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:37:01,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:37:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:37:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:37:01,982 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2020-07-20 03:37:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:37:02,320 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2020-07-20 03:37:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:37:02,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-20 03:37:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:37:02,350 INFO L225 Difference]: With dead ends: 21516 [2020-07-20 03:37:02,350 INFO L226 Difference]: Without dead ends: 14602 [2020-07-20 03:37:02,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-07-20 03:37:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2020-07-20 03:37:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2020-07-20 03:37:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2020-07-20 03:37:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2020-07-20 03:37:02,652 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2020-07-20 03:37:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:37:02,652 INFO L479 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2020-07-20 03:37:02,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:37:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2020-07-20 03:37:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-20 03:37:02,669 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:37:02,669 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, 1, 1] [2020-07-20 03:37:02,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-20 03:37:02,670 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:37:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:37:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2020-07-20 03:37:02,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:37:02,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427319135] [2020-07-20 03:37:02,671 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:37:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:37:02,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427319135] [2020-07-20 03:37:02,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:37:02,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:37:02,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726690374] [2020-07-20 03:37:02,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:37:02,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:37:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:37:02,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:37:02,690 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2020-07-20 03:37:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:37:03,480 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2020-07-20 03:37:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:37:03,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-20 03:37:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:37:03,542 INFO L225 Difference]: With dead ends: 23562 [2020-07-20 03:37:03,542 INFO L226 Difference]: Without dead ends: 23560 [2020-07-20 03:37:03,549 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-07-20 03:37:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2020-07-20 03:37:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2020-07-20 03:37:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2020-07-20 03:37:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2020-07-20 03:37:03,969 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2020-07-20 03:37:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:37:03,969 INFO L479 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2020-07-20 03:37:03,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:37:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2020-07-20 03:37:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-20 03:37:04,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:37:04,004 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, 1, 1] [2020-07-20 03:37:04,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-20 03:37:04,004 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:37:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:37:04,005 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2020-07-20 03:37:04,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:37:04,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53626966] [2020-07-20 03:37:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f505d5a [2020-07-20 03:37:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:37:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:37:04,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53626966] [2020-07-20 03:37:04,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:37:04,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:37:04,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779324655] [2020-07-20 03:37:04,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:37:04,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:37:04,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:37:04,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:37:04,030 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2020-07-20 03:37:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:37:04,469 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2020-07-20 03:37:04,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:37:04,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-20 03:37:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:37:04,470 INFO L225 Difference]: With dead ends: 50184 [2020-07-20 03:37:04,471 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 03:37:04,532 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-07-20 03:37:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 03:37:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 03:37:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 03:37:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 03:37:04,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-07-20 03:37:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:37:04,533 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 03:37:04,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:37:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 03:37:04,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 03:37:04,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-20 03:37:04,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 03:37:04,573 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-20 03:37:04,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 03:37:04,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 03:37:04,574 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-20 03:37:04,574 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 03:37:04,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 03:37:04,574 INFO L271 CegarLoopResult]: At program point L159(lines 5 163) the Hoare annotation is: true [2020-07-20 03:37:04,574 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2020-07-20 03:37:04,574 INFO L268 CegarLoopResult]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,575 INFO L268 CegarLoopResult]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,576 INFO L271 CegarLoopResult]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2020-07-20 03:37:04,576 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2020-07-20 03:37:04,576 INFO L268 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2020-07-20 03:37:04,576 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2020-07-20 03:37:04,576 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2020-07-20 03:37:04,578 INFO L268 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2020-07-20 03:37:04,578 INFO L264 CegarLoopResult]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2020-07-20 03:37:04,578 INFO L268 CegarLoopResult]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,579 INFO L268 CegarLoopResult]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,579 INFO L268 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2020-07-20 03:37:04,579 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-07-20 03:37:04,579 INFO L268 CegarLoopResult]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,579 INFO L268 CegarLoopResult]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,579 INFO L268 CegarLoopResult]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,579 INFO L268 CegarLoopResult]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,579 INFO L268 CegarLoopResult]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2020-07-20 03:37:04,580 INFO L268 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-07-20 03:37:04,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 03:37:04 BoogieIcfgContainer [2020-07-20 03:37:04,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 03:37:04,603 INFO L168 Benchmark]: Toolchain (without parser) took 9365.13 ms. Allocated memory was 139.5 MB in the beginning and 665.3 MB in the end (delta: 525.9 MB). Free memory was 104.3 MB in the beginning and 418.3 MB in the end (delta: -314.0 MB). Peak memory consumption was 211.9 MB. Max. memory is 7.1 GB. [2020-07-20 03:37:04,605 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 03:37:04,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.19 ms. Allocated memory is still 139.5 MB. Free memory was 103.9 MB in the beginning and 93.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-20 03:37:04,611 INFO L168 Benchmark]: Boogie Preprocessor took 131.13 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 93.2 MB in the beginning and 181.1 MB in the end (delta: -87.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-20 03:37:04,611 INFO L168 Benchmark]: RCFGBuilder took 386.20 ms. Allocated memory is still 203.4 MB. Free memory was 181.1 MB in the beginning and 162.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-20 03:37:04,612 INFO L168 Benchmark]: TraceAbstraction took 8492.60 ms. Allocated memory was 203.4 MB in the beginning and 665.3 MB in the end (delta: 461.9 MB). Free memory was 161.4 MB in the beginning and 418.3 MB in the end (delta: -256.9 MB). Peak memory consumption was 205.0 MB. Max. memory is 7.1 GB. [2020-07-20 03:37:04,617 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 349.19 ms. Allocated memory is still 139.5 MB. Free memory was 103.9 MB in the beginning and 93.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.13 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 93.2 MB in the beginning and 181.1 MB in the end (delta: -87.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.20 ms. Allocated memory is still 203.4 MB. Free memory was 181.1 MB in the beginning and 162.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8492.60 ms. Allocated memory was 203.4 MB in the beginning and 665.3 MB in the end (delta: 461.9 MB). Free memory was 161.4 MB in the beginning and 418.3 MB in the end (delta: -256.9 MB). Peak memory consumption was 205.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...