/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:26:53,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:26:53,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:26:53,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:26:53,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:26:53,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:26:53,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:26:53,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:26:53,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:26:53,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:26:53,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:26:53,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:26:53,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:26:53,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:26:53,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:26:53,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:26:53,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:26:53,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:26:53,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:26:53,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:26:53,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:26:53,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:26:53,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:26:53,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:26:53,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:26:53,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:26:53,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:26:53,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:26:53,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:26:53,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:26:53,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:26:53,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:26:53,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:26:53,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:26:53,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:26:53,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:26:53,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:26:53,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:26:53,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:26:53,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:26:53,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:26:53,327 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-11-06 22:26:53,382 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:26:53,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:26:53,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:26:53,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:26:53,386 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:26:53,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:26:53,387 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:26:53,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:26:53,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:26:53,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:26:53,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:26:53,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:26:53,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:26:53,390 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:26:53,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:26:53,390 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:26:53,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:26:53,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:26:53,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:26:53,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:26:53,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:26:53,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:26:53,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:26:53,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:26:53,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:26:53,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:26:53,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:26:53,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:26:53,394 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:26:53,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:26:53,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:26:53,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:26:53,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:26:53,905 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:26:53,906 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:26:53,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2020-11-06 22:26:53,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d019677bc/8e1685320c954c98b2147bf5dcb932d6/FLAG5049eb648 [2020-11-06 22:26:54,539 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:26:54,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2020-11-06 22:26:54,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d019677bc/8e1685320c954c98b2147bf5dcb932d6/FLAG5049eb648 [2020-11-06 22:26:54,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d019677bc/8e1685320c954c98b2147bf5dcb932d6 [2020-11-06 22:26:54,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:26:54,916 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:26:54,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:26:54,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:26:54,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:26:54,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:54" (1/1) ... [2020-11-06 22:26:54,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea99998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:54, skipping insertion in model container [2020-11-06 22:26:54,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:54" (1/1) ... [2020-11-06 22:26:54,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:26:54,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:26:55,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:26:55,269 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:26:55,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:26:55,357 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:26:55,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55 WrapperNode [2020-11-06 22:26:55,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:26:55,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:26:55,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:26:55,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:26:55,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55" (1/1) ... [2020-11-06 22:26:55,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55" (1/1) ... [2020-11-06 22:26:55,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55" (1/1) ... [2020-11-06 22:26:55,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55" (1/1) ... [2020-11-06 22:26:55,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55" (1/1) ... [2020-11-06 22:26:55,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55" (1/1) ... [2020-11-06 22:26:55,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55" (1/1) ... [2020-11-06 22:26:55,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:26:55,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:26:55,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:26:55,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:26:55,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26: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-11-06 22:26:55,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:26:55,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:26:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:26:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:26:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:26:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:26:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:26:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:26:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:26:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:26:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:26:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:26:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:26:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:26:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:26:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:26:56,085 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:26:56,085 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-06 22:26:56,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:56 BoogieIcfgContainer [2020-11-06 22:26:56,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:26:56,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:26:56,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:26:56,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:26:56,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:54" (1/3) ... [2020-11-06 22:26:56,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d72d05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:56, skipping insertion in model container [2020-11-06 22:26:56,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:55" (2/3) ... [2020-11-06 22:26:56,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d72d05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:56, skipping insertion in model container [2020-11-06 22:26:56,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:56" (3/3) ... [2020-11-06 22:26:56,100 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2020-11-06 22:26:56,116 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:26:56,120 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:26:56,134 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:26:56,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:26:56,176 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:26:56,176 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:26:56,176 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:26:56,176 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:26:56,176 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:26:56,177 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:26:56,177 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:26:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-11-06 22:26:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-06 22:26:56,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:56,211 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-11-06 22:26:56,212 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash 270724770, now seen corresponding path program 1 times [2020-11-06 22:26:56,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:56,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930095397] [2020-11-06 22:26:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:56,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:56,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930095397] [2020-11-06 22:26:56,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:56,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:56,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437984910] [2020-11-06 22:26:56,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:56,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:56,701 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2020-11-06 22:26:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:57,124 INFO L93 Difference]: Finished difference Result 86 states and 145 transitions. [2020-11-06 22:26:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:57,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-06 22:26:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:57,138 INFO L225 Difference]: With dead ends: 86 [2020-11-06 22:26:57,138 INFO L226 Difference]: Without dead ends: 67 [2020-11-06 22:26:57,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-06 22:26:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2020-11-06 22:26:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-06 22:26:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 83 transitions. [2020-11-06 22:26:57,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 83 transitions. Word has length 21 [2020-11-06 22:26:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:57,187 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 83 transitions. [2020-11-06 22:26:57,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 83 transitions. [2020-11-06 22:26:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-06 22:26:57,188 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:57,188 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-11-06 22:26:57,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:26:57,189 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash -316081244, now seen corresponding path program 1 times [2020-11-06 22:26:57,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:57,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755215504] [2020-11-06 22:26:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:57,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:57,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755215504] [2020-11-06 22:26:57,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:57,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:57,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231203112] [2020-11-06 22:26:57,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:57,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:57,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:57,324 INFO L87 Difference]: Start difference. First operand 48 states and 83 transitions. Second operand 4 states. [2020-11-06 22:26:57,506 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-06 22:26:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:57,747 INFO L93 Difference]: Finished difference Result 109 states and 195 transitions. [2020-11-06 22:26:57,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:57,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-06 22:26:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:57,750 INFO L225 Difference]: With dead ends: 109 [2020-11-06 22:26:57,750 INFO L226 Difference]: Without dead ends: 67 [2020-11-06 22:26:57,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-06 22:26:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2020-11-06 22:26:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-06 22:26:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2020-11-06 22:26:57,764 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 21 [2020-11-06 22:26:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:57,764 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2020-11-06 22:26:57,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2020-11-06 22:26:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:26:57,766 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:57,766 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-11-06 22:26:57,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:26:57,766 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash -190848284, now seen corresponding path program 1 times [2020-11-06 22:26:57,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:57,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79036688] [2020-11-06 22:26:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:57,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:57,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79036688] [2020-11-06 22:26:57,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:57,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:57,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525872168] [2020-11-06 22:26:57,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:57,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:57,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:57,890 INFO L87 Difference]: Start difference. First operand 66 states and 115 transitions. Second operand 4 states. [2020-11-06 22:26:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:58,162 INFO L93 Difference]: Finished difference Result 101 states and 174 transitions. [2020-11-06 22:26:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:58,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-06 22:26:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:58,164 INFO L225 Difference]: With dead ends: 101 [2020-11-06 22:26:58,165 INFO L226 Difference]: Without dead ends: 70 [2020-11-06 22:26:58,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-06 22:26:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2020-11-06 22:26:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-06 22:26:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 117 transitions. [2020-11-06 22:26:58,178 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 117 transitions. Word has length 22 [2020-11-06 22:26:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:58,178 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 117 transitions. [2020-11-06 22:26:58,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 117 transitions. [2020-11-06 22:26:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:26:58,180 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:58,180 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-11-06 22:26:58,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:26:58,180 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:58,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:58,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1201965534, now seen corresponding path program 1 times [2020-11-06 22:26:58,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:58,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058357545] [2020-11-06 22:26:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:58,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:58,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058357545] [2020-11-06 22:26:58,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:58,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:58,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149634109] [2020-11-06 22:26:58,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:58,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:58,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:58,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:58,308 INFO L87 Difference]: Start difference. First operand 69 states and 117 transitions. Second operand 4 states. [2020-11-06 22:26:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:58,578 INFO L93 Difference]: Finished difference Result 185 states and 326 transitions. [2020-11-06 22:26:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:58,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-06 22:26:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:58,580 INFO L225 Difference]: With dead ends: 185 [2020-11-06 22:26:58,581 INFO L226 Difference]: Without dead ends: 125 [2020-11-06 22:26:58,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-06 22:26:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2020-11-06 22:26:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-06 22:26:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2020-11-06 22:26:58,597 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 214 transitions. Word has length 22 [2020-11-06 22:26:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:58,598 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 214 transitions. [2020-11-06 22:26:58,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 214 transitions. [2020-11-06 22:26:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:26:58,599 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:58,599 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-11-06 22:26:58,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:26:58,600 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash -615159520, now seen corresponding path program 1 times [2020-11-06 22:26:58,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:58,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493186962] [2020-11-06 22:26:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:58,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:58,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493186962] [2020-11-06 22:26:58,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:58,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:58,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812373609] [2020-11-06 22:26:58,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:58,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:58,702 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. Second operand 4 states. [2020-11-06 22:26:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:58,857 INFO L93 Difference]: Finished difference Result 160 states and 277 transitions. [2020-11-06 22:26:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:58,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-06 22:26:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:58,859 INFO L225 Difference]: With dead ends: 160 [2020-11-06 22:26:58,859 INFO L226 Difference]: Without dead ends: 157 [2020-11-06 22:26:58,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-06 22:26:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2020-11-06 22:26:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-06 22:26:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 212 transitions. [2020-11-06 22:26:58,873 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 212 transitions. Word has length 22 [2020-11-06 22:26:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:58,874 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 212 transitions. [2020-11-06 22:26:58,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 212 transitions. [2020-11-06 22:26:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:26:58,875 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:58,875 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-11-06 22:26:58,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:26:58,876 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:58,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1400403119, now seen corresponding path program 1 times [2020-11-06 22:26:58,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:58,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066733964] [2020-11-06 22:26:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:58,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:58,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066733964] [2020-11-06 22:26:58,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:58,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:58,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562867199] [2020-11-06 22:26:58,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:58,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:58,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:58,949 INFO L87 Difference]: Start difference. First operand 124 states and 212 transitions. Second operand 4 states. [2020-11-06 22:26:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:59,141 INFO L93 Difference]: Finished difference Result 228 states and 397 transitions. [2020-11-06 22:26:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:59,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-06 22:26:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:59,144 INFO L225 Difference]: With dead ends: 228 [2020-11-06 22:26:59,144 INFO L226 Difference]: Without dead ends: 225 [2020-11-06 22:26:59,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-11-06 22:26:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 168. [2020-11-06 22:26:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-06 22:26:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 286 transitions. [2020-11-06 22:26:59,161 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 286 transitions. Word has length 23 [2020-11-06 22:26:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:59,161 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 286 transitions. [2020-11-06 22:26:59,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 286 transitions. [2020-11-06 22:26:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:26:59,163 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:59,163 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-11-06 22:26:59,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:26:59,163 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 813597105, now seen corresponding path program 1 times [2020-11-06 22:26:59,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:59,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649688182] [2020-11-06 22:26:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:59,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:59,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649688182] [2020-11-06 22:26:59,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:59,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:59,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492815904] [2020-11-06 22:26:59,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:59,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:59,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:59,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:59,226 INFO L87 Difference]: Start difference. First operand 168 states and 286 transitions. Second operand 4 states. [2020-11-06 22:26:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:59,393 INFO L93 Difference]: Finished difference Result 392 states and 677 transitions. [2020-11-06 22:26:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:59,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-06 22:26:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:59,396 INFO L225 Difference]: With dead ends: 392 [2020-11-06 22:26:59,396 INFO L226 Difference]: Without dead ends: 233 [2020-11-06 22:26:59,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-06 22:26:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2020-11-06 22:26:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-06 22:26:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 392 transitions. [2020-11-06 22:26:59,414 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 392 transitions. Word has length 23 [2020-11-06 22:26:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:59,415 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 392 transitions. [2020-11-06 22:26:59,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 392 transitions. [2020-11-06 22:26:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:26:59,417 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:59,417 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-11-06 22:26:59,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:26:59,417 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash 469463309, now seen corresponding path program 1 times [2020-11-06 22:26:59,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:59,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413959047] [2020-11-06 22:26:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:59,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:59,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413959047] [2020-11-06 22:26:59,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:59,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:59,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720197058] [2020-11-06 22:26:59,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:59,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:59,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:59,504 INFO L87 Difference]: Start difference. First operand 232 states and 392 transitions. Second operand 4 states. [2020-11-06 22:26:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:59,680 INFO L93 Difference]: Finished difference Result 350 states and 591 transitions. [2020-11-06 22:26:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:59,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-06 22:26:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:59,683 INFO L225 Difference]: With dead ends: 350 [2020-11-06 22:26:59,683 INFO L226 Difference]: Without dead ends: 239 [2020-11-06 22:26:59,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-11-06 22:26:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2020-11-06 22:26:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-11-06 22:26:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 396 transitions. [2020-11-06 22:26:59,709 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 396 transitions. Word has length 24 [2020-11-06 22:26:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:59,709 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 396 transitions. [2020-11-06 22:26:59,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 396 transitions. [2020-11-06 22:26:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:26:59,718 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:59,718 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-11-06 22:26:59,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:26:59,719 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash -541653941, now seen corresponding path program 1 times [2020-11-06 22:26:59,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:59,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014029557] [2020-11-06 22:26:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:59,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:59,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014029557] [2020-11-06 22:26:59,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:59,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:59,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207668317] [2020-11-06 22:26:59,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:59,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:59,811 INFO L87 Difference]: Start difference. First operand 238 states and 396 transitions. Second operand 4 states. [2020-11-06 22:26:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:59,999 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2020-11-06 22:27:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:00,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-06 22:27:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:00,004 INFO L225 Difference]: With dead ends: 430 [2020-11-06 22:27:00,005 INFO L226 Difference]: Without dead ends: 427 [2020-11-06 22:27:00,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:00,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-06 22:27:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 330. [2020-11-06 22:27:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-11-06 22:27:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 540 transitions. [2020-11-06 22:27:00,025 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 540 transitions. Word has length 24 [2020-11-06 22:27:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:00,027 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 540 transitions. [2020-11-06 22:27:00,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 540 transitions. [2020-11-06 22:27:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:27:00,031 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:00,031 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-11-06 22:27:00,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:27:00,032 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:00,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:00,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1128459955, now seen corresponding path program 1 times [2020-11-06 22:27:00,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:00,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376403462] [2020-11-06 22:27:00,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:00,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:00,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376403462] [2020-11-06 22:27:00,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:00,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:00,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784179453] [2020-11-06 22:27:00,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:00,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:00,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:00,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:00,092 INFO L87 Difference]: Start difference. First operand 330 states and 540 transitions. Second operand 4 states. [2020-11-06 22:27:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:00,242 INFO L93 Difference]: Finished difference Result 766 states and 1263 transitions. [2020-11-06 22:27:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:00,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-06 22:27:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:00,246 INFO L225 Difference]: With dead ends: 766 [2020-11-06 22:27:00,246 INFO L226 Difference]: Without dead ends: 451 [2020-11-06 22:27:00,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2020-11-06 22:27:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 450. [2020-11-06 22:27:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-06 22:27:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 728 transitions. [2020-11-06 22:27:00,268 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 728 transitions. Word has length 24 [2020-11-06 22:27:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:00,268 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 728 transitions. [2020-11-06 22:27:00,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 728 transitions. [2020-11-06 22:27:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:27:00,269 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:00,270 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-11-06 22:27:00,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:27:00,270 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:00,270 INFO L82 PathProgramCache]: Analyzing trace with hash 395247164, now seen corresponding path program 1 times [2020-11-06 22:27:00,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:00,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875208752] [2020-11-06 22:27:00,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:00,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:00,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875208752] [2020-11-06 22:27:00,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:00,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:00,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35963113] [2020-11-06 22:27:00,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:00,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:00,325 INFO L87 Difference]: Start difference. First operand 450 states and 728 transitions. Second operand 4 states. [2020-11-06 22:27:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:00,521 INFO L93 Difference]: Finished difference Result 674 states and 1087 transitions. [2020-11-06 22:27:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:00,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:27:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:00,527 INFO L225 Difference]: With dead ends: 674 [2020-11-06 22:27:00,527 INFO L226 Difference]: Without dead ends: 459 [2020-11-06 22:27:00,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-11-06 22:27:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2020-11-06 22:27:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-06 22:27:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 728 transitions. [2020-11-06 22:27:00,548 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 728 transitions. Word has length 25 [2020-11-06 22:27:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:00,548 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 728 transitions. [2020-11-06 22:27:00,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 728 transitions. [2020-11-06 22:27:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:27:00,552 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:00,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, 1, 1] [2020-11-06 22:27:00,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:27:00,553 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:00,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash -615870086, now seen corresponding path program 1 times [2020-11-06 22:27:00,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:00,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466305677] [2020-11-06 22:27:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:00,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:00,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466305677] [2020-11-06 22:27:00,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:00,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:00,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011460758] [2020-11-06 22:27:00,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:00,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:00,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:00,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:00,625 INFO L87 Difference]: Start difference. First operand 458 states and 728 transitions. Second operand 4 states. [2020-11-06 22:27:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:00,792 INFO L93 Difference]: Finished difference Result 814 states and 1315 transitions. [2020-11-06 22:27:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:00,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:27:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:00,797 INFO L225 Difference]: With dead ends: 814 [2020-11-06 22:27:00,798 INFO L226 Difference]: Without dead ends: 811 [2020-11-06 22:27:00,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-11-06 22:27:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 650. [2020-11-06 22:27:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-11-06 22:27:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1008 transitions. [2020-11-06 22:27:00,827 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1008 transitions. Word has length 25 [2020-11-06 22:27:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:00,827 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 1008 transitions. [2020-11-06 22:27:00,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1008 transitions. [2020-11-06 22:27:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:27:00,831 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:00,831 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-11-06 22:27:00,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:27:00,831 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1202676100, now seen corresponding path program 1 times [2020-11-06 22:27:00,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:00,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031582207] [2020-11-06 22:27:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:00,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:00,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031582207] [2020-11-06 22:27:00,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:00,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:00,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105927196] [2020-11-06 22:27:00,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:00,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:00,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:00,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:00,902 INFO L87 Difference]: Start difference. First operand 650 states and 1008 transitions. Second operand 4 states. [2020-11-06 22:27:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:01,102 INFO L93 Difference]: Finished difference Result 1502 states and 2339 transitions. [2020-11-06 22:27:01,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:01,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:27:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:01,108 INFO L225 Difference]: With dead ends: 1502 [2020-11-06 22:27:01,108 INFO L226 Difference]: Without dead ends: 875 [2020-11-06 22:27:01,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2020-11-06 22:27:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 874. [2020-11-06 22:27:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2020-11-06 22:27:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1336 transitions. [2020-11-06 22:27:01,155 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1336 transitions. Word has length 25 [2020-11-06 22:27:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:01,156 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1336 transitions. [2020-11-06 22:27:01,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1336 transitions. [2020-11-06 22:27:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:27:01,158 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:01,158 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-11-06 22:27:01,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:27:01,158 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1905442760, now seen corresponding path program 1 times [2020-11-06 22:27:01,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:01,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666186936] [2020-11-06 22:27:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:01,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:01,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-11-06 22:27:01,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666186936] [2020-11-06 22:27:01,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:01,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:01,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056446088] [2020-11-06 22:27:01,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:01,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:01,219 INFO L87 Difference]: Start difference. First operand 874 states and 1336 transitions. Second operand 4 states. [2020-11-06 22:27:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:01,377 INFO L93 Difference]: Finished difference Result 1310 states and 1995 transitions. [2020-11-06 22:27:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:01,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:27:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:01,383 INFO L225 Difference]: With dead ends: 1310 [2020-11-06 22:27:01,383 INFO L226 Difference]: Without dead ends: 891 [2020-11-06 22:27:01,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2020-11-06 22:27:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 890. [2020-11-06 22:27:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2020-11-06 22:27:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1336 transitions. [2020-11-06 22:27:01,424 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1336 transitions. Word has length 26 [2020-11-06 22:27:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:01,424 INFO L481 AbstractCegarLoop]: Abstraction has 890 states and 1336 transitions. [2020-11-06 22:27:01,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1336 transitions. [2020-11-06 22:27:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:27:01,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:01,426 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-11-06 22:27:01,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:27:01,426 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1378407286, now seen corresponding path program 1 times [2020-11-06 22:27:01,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:01,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527125727] [2020-11-06 22:27:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:01,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:01,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527125727] [2020-11-06 22:27:01,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:01,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:01,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046065050] [2020-11-06 22:27:01,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:01,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:01,480 INFO L87 Difference]: Start difference. First operand 890 states and 1336 transitions. Second operand 4 states. [2020-11-06 22:27:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:01,675 INFO L93 Difference]: Finished difference Result 1550 states and 2363 transitions. [2020-11-06 22:27:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:01,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:27:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:01,683 INFO L225 Difference]: With dead ends: 1550 [2020-11-06 22:27:01,683 INFO L226 Difference]: Without dead ends: 1547 [2020-11-06 22:27:01,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2020-11-06 22:27:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1290. [2020-11-06 22:27:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2020-11-06 22:27:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1880 transitions. [2020-11-06 22:27:01,732 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1880 transitions. Word has length 26 [2020-11-06 22:27:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:01,732 INFO L481 AbstractCegarLoop]: Abstraction has 1290 states and 1880 transitions. [2020-11-06 22:27:01,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1880 transitions. [2020-11-06 22:27:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:27:01,735 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:01,735 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-11-06 22:27:01,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:27:01,735 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:01,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash 791601272, now seen corresponding path program 1 times [2020-11-06 22:27:01,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:01,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014397694] [2020-11-06 22:27:01,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:01,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:01,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014397694] [2020-11-06 22:27:01,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:01,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:01,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596224081] [2020-11-06 22:27:01,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:01,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:01,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:01,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:01,788 INFO L87 Difference]: Start difference. First operand 1290 states and 1880 transitions. Second operand 4 states. [2020-11-06 22:27:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:01,964 INFO L93 Difference]: Finished difference Result 2958 states and 4315 transitions. [2020-11-06 22:27:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:01,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:27:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:01,973 INFO L225 Difference]: With dead ends: 2958 [2020-11-06 22:27:01,973 INFO L226 Difference]: Without dead ends: 1707 [2020-11-06 22:27:01,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2020-11-06 22:27:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1706. [2020-11-06 22:27:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2020-11-06 22:27:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2440 transitions. [2020-11-06 22:27:02,047 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2440 transitions. Word has length 26 [2020-11-06 22:27:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:02,048 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 2440 transitions. [2020-11-06 22:27:02,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2440 transitions. [2020-11-06 22:27:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:27:02,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:02,050 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-11-06 22:27:02,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:27:02,051 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:02,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash -212375801, now seen corresponding path program 1 times [2020-11-06 22:27:02,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:02,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323974256] [2020-11-06 22:27:02,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:02,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:02,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323974256] [2020-11-06 22:27:02,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:02,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:02,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591464787] [2020-11-06 22:27:02,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:02,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:02,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:02,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:02,102 INFO L87 Difference]: Start difference. First operand 1706 states and 2440 transitions. Second operand 4 states. [2020-11-06 22:27:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:02,279 INFO L93 Difference]: Finished difference Result 2558 states and 3643 transitions. [2020-11-06 22:27:02,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:02,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:27:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:02,288 INFO L225 Difference]: With dead ends: 2558 [2020-11-06 22:27:02,289 INFO L226 Difference]: Without dead ends: 1739 [2020-11-06 22:27:02,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2020-11-06 22:27:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1738. [2020-11-06 22:27:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2020-11-06 22:27:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2440 transitions. [2020-11-06 22:27:02,359 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2440 transitions. Word has length 27 [2020-11-06 22:27:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:02,359 INFO L481 AbstractCegarLoop]: Abstraction has 1738 states and 2440 transitions. [2020-11-06 22:27:02,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2440 transitions. [2020-11-06 22:27:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:27:02,362 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:02,362 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-11-06 22:27:02,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:27:02,362 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1223493051, now seen corresponding path program 1 times [2020-11-06 22:27:02,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:02,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146241970] [2020-11-06 22:27:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:02,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:02,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146241970] [2020-11-06 22:27:02,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:02,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:02,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106655737] [2020-11-06 22:27:02,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:02,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:02,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:02,433 INFO L87 Difference]: Start difference. First operand 1738 states and 2440 transitions. Second operand 4 states. [2020-11-06 22:27:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:02,647 INFO L93 Difference]: Finished difference Result 2958 states and 4203 transitions. [2020-11-06 22:27:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:02,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:27:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:02,661 INFO L225 Difference]: With dead ends: 2958 [2020-11-06 22:27:02,661 INFO L226 Difference]: Without dead ends: 2955 [2020-11-06 22:27:02,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-11-06 22:27:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2570. [2020-11-06 22:27:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2020-11-06 22:27:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3496 transitions. [2020-11-06 22:27:02,755 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3496 transitions. Word has length 27 [2020-11-06 22:27:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:02,756 INFO L481 AbstractCegarLoop]: Abstraction has 2570 states and 3496 transitions. [2020-11-06 22:27:02,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3496 transitions. [2020-11-06 22:27:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:27:02,760 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:02,760 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-11-06 22:27:02,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:27:02,761 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1810299065, now seen corresponding path program 1 times [2020-11-06 22:27:02,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:02,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528397017] [2020-11-06 22:27:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:02,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:02,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528397017] [2020-11-06 22:27:02,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:02,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:02,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746214072] [2020-11-06 22:27:02,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:02,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:02,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:02,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:02,827 INFO L87 Difference]: Start difference. First operand 2570 states and 3496 transitions. Second operand 4 states. [2020-11-06 22:27:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:03,044 INFO L93 Difference]: Finished difference Result 5838 states and 7915 transitions. [2020-11-06 22:27:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:03,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:27:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:03,059 INFO L225 Difference]: With dead ends: 5838 [2020-11-06 22:27:03,059 INFO L226 Difference]: Without dead ends: 3339 [2020-11-06 22:27:03,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2020-11-06 22:27:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3338. [2020-11-06 22:27:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3338 states. [2020-11-06 22:27:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 4424 transitions. [2020-11-06 22:27:03,239 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 4424 transitions. Word has length 27 [2020-11-06 22:27:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:03,239 INFO L481 AbstractCegarLoop]: Abstraction has 3338 states and 4424 transitions. [2020-11-06 22:27:03,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4424 transitions. [2020-11-06 22:27:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:27:03,244 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:03,244 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-11-06 22:27:03,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-06 22:27:03,245 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash 733102947, now seen corresponding path program 1 times [2020-11-06 22:27:03,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:03,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959003431] [2020-11-06 22:27:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:03,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:03,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959003431] [2020-11-06 22:27:03,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:03,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:03,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745163208] [2020-11-06 22:27:03,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:03,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:03,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:03,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:03,300 INFO L87 Difference]: Start difference. First operand 3338 states and 4424 transitions. Second operand 4 states. [2020-11-06 22:27:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:03,483 INFO L93 Difference]: Finished difference Result 5006 states and 6603 transitions. [2020-11-06 22:27:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:03,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:27:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:03,498 INFO L225 Difference]: With dead ends: 5006 [2020-11-06 22:27:03,498 INFO L226 Difference]: Without dead ends: 3403 [2020-11-06 22:27:03,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2020-11-06 22:27:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3402. [2020-11-06 22:27:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3402 states. [2020-11-06 22:27:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4424 transitions. [2020-11-06 22:27:03,651 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4424 transitions. Word has length 28 [2020-11-06 22:27:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:03,651 INFO L481 AbstractCegarLoop]: Abstraction has 3402 states and 4424 transitions. [2020-11-06 22:27:03,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4424 transitions. [2020-11-06 22:27:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:27:03,656 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:03,656 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-11-06 22:27:03,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-06 22:27:03,657 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:03,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash -278014303, now seen corresponding path program 1 times [2020-11-06 22:27:03,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:03,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961249599] [2020-11-06 22:27:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:03,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:03,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961249599] [2020-11-06 22:27:03,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:03,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:03,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900474902] [2020-11-06 22:27:03,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:03,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:03,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:03,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:03,705 INFO L87 Difference]: Start difference. First operand 3402 states and 4424 transitions. Second operand 4 states. [2020-11-06 22:27:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:03,940 INFO L93 Difference]: Finished difference Result 5646 states and 7371 transitions. [2020-11-06 22:27:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:03,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:27:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:03,965 INFO L225 Difference]: With dead ends: 5646 [2020-11-06 22:27:03,965 INFO L226 Difference]: Without dead ends: 5643 [2020-11-06 22:27:03,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2020-11-06 22:27:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5130. [2020-11-06 22:27:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5130 states. [2020-11-06 22:27:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 6472 transitions. [2020-11-06 22:27:04,144 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 6472 transitions. Word has length 28 [2020-11-06 22:27:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:04,144 INFO L481 AbstractCegarLoop]: Abstraction has 5130 states and 6472 transitions. [2020-11-06 22:27:04,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 6472 transitions. [2020-11-06 22:27:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:27:04,153 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:04,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:27:04,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-06 22:27:04,154 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash -864820317, now seen corresponding path program 1 times [2020-11-06 22:27:04,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:04,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334463475] [2020-11-06 22:27:04,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:04,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:04,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334463475] [2020-11-06 22:27:04,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:04,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:04,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338301332] [2020-11-06 22:27:04,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:04,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:04,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:04,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:04,204 INFO L87 Difference]: Start difference. First operand 5130 states and 6472 transitions. Second operand 4 states. [2020-11-06 22:27:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:04,475 INFO L93 Difference]: Finished difference Result 11534 states and 14411 transitions. [2020-11-06 22:27:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:04,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:27:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:04,488 INFO L225 Difference]: With dead ends: 11534 [2020-11-06 22:27:04,488 INFO L226 Difference]: Without dead ends: 6539 [2020-11-06 22:27:04,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2020-11-06 22:27:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6538. [2020-11-06 22:27:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6538 states. [2020-11-06 22:27:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6538 states to 6538 states and 7944 transitions. [2020-11-06 22:27:04,709 INFO L78 Accepts]: Start accepts. Automaton has 6538 states and 7944 transitions. Word has length 28 [2020-11-06 22:27:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:04,709 INFO L481 AbstractCegarLoop]: Abstraction has 6538 states and 7944 transitions. [2020-11-06 22:27:04,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7944 transitions. [2020-11-06 22:27:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:27:04,718 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:04,719 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-11-06 22:27:04,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-06 22:27:04,719 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:04,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:04,720 INFO L82 PathProgramCache]: Analyzing trace with hash -21816366, now seen corresponding path program 1 times [2020-11-06 22:27:04,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:04,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429477780] [2020-11-06 22:27:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:04,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:04,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429477780] [2020-11-06 22:27:04,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:04,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:04,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448054278] [2020-11-06 22:27:04,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:04,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:04,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:04,803 INFO L87 Difference]: Start difference. First operand 6538 states and 7944 transitions. Second operand 4 states. [2020-11-06 22:27:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:05,095 INFO L93 Difference]: Finished difference Result 9806 states and 11851 transitions. [2020-11-06 22:27:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:05,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:27:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:05,111 INFO L225 Difference]: With dead ends: 9806 [2020-11-06 22:27:05,111 INFO L226 Difference]: Without dead ends: 6667 [2020-11-06 22:27:05,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2020-11-06 22:27:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6666. [2020-11-06 22:27:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2020-11-06 22:27:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 7944 transitions. [2020-11-06 22:27:05,360 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 7944 transitions. Word has length 29 [2020-11-06 22:27:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:05,360 INFO L481 AbstractCegarLoop]: Abstraction has 6666 states and 7944 transitions. [2020-11-06 22:27:05,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 7944 transitions. [2020-11-06 22:27:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:27:05,374 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:05,374 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-11-06 22:27:05,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-06 22:27:05,375 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:05,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1032933616, now seen corresponding path program 1 times [2020-11-06 22:27:05,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:05,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634605637] [2020-11-06 22:27:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:05,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:05,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634605637] [2020-11-06 22:27:05,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:05,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:05,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740899736] [2020-11-06 22:27:05,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:05,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:05,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:05,442 INFO L87 Difference]: Start difference. First operand 6666 states and 7944 transitions. Second operand 4 states. [2020-11-06 22:27:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:05,742 INFO L93 Difference]: Finished difference Result 10765 states and 12682 transitions. [2020-11-06 22:27:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:05,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:27:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:05,762 INFO L225 Difference]: With dead ends: 10765 [2020-11-06 22:27:05,763 INFO L226 Difference]: Without dead ends: 10762 [2020-11-06 22:27:05,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10762 states. [2020-11-06 22:27:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10762 to 10250. [2020-11-06 22:27:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10250 states. [2020-11-06 22:27:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10250 states to 10250 states and 11912 transitions. [2020-11-06 22:27:06,074 INFO L78 Accepts]: Start accepts. Automaton has 10250 states and 11912 transitions. Word has length 29 [2020-11-06 22:27:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:06,075 INFO L481 AbstractCegarLoop]: Abstraction has 10250 states and 11912 transitions. [2020-11-06 22:27:06,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 10250 states and 11912 transitions. [2020-11-06 22:27:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:27:06,090 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:27:06,090 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-11-06 22:27:06,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-06 22:27:06,092 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:27:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:27:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1619739630, now seen corresponding path program 1 times [2020-11-06 22:27:06,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:27:06,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110963886] [2020-11-06 22:27:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:27:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:06,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:27:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:27:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:27:06,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110963886] [2020-11-06 22:27:06,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:27:06,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:27:06,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046094603] [2020-11-06 22:27:06,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:27:06,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:27:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:27:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:27:06,143 INFO L87 Difference]: Start difference. First operand 10250 states and 11912 transitions. Second operand 4 states. [2020-11-06 22:27:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:27:06,497 INFO L93 Difference]: Finished difference Result 22794 states and 25992 transitions. [2020-11-06 22:27:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:27:06,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:27:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:27:06,498 INFO L225 Difference]: With dead ends: 22794 [2020-11-06 22:27:06,499 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:27:06,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:27:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:27:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:27:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:27:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:27:06,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-11-06 22:27:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:27:06,533 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:27:06,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:27:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:27:06,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:27:06,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-06 22:27:06,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:27:21,676 WARN L194 SmtUtils]: Spent 15.11 s on a formula simplification. DAG size of input: 2122 DAG size of output: 32 [2020-11-06 22:27:21,734 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-11-06 22:27:21,735 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-06 22:27:21,735 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-11-06 22:27:21,735 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-06 22:27:21,735 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:27:21,735 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:27:21,736 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:27:21,736 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:27:21,736 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:27:21,736 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:27:21,736 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:27:21,736 INFO L266 CegarLoopResult]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,736 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 6 151) no Hoare annotation was computed. [2020-11-06 22:27:21,736 INFO L266 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2020-11-06 22:27:21,736 INFO L266 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2020-11-06 22:27:21,736 INFO L266 CegarLoopResult]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 6 151) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,737 INFO L266 CegarLoopResult]: For program point L63(lines 63 65) no Hoare annotation was computed. [2020-11-06 22:27:21,738 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 151) the Hoare annotation is: true [2020-11-06 22:27:21,738 INFO L266 CegarLoopResult]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,738 INFO L266 CegarLoopResult]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,738 INFO L266 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-11-06 22:27:21,739 INFO L269 CegarLoopResult]: At program point L147(lines 7 151) the Hoare annotation is: true [2020-11-06 22:27:21,739 INFO L266 CegarLoopResult]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,739 INFO L266 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L269 CegarLoopResult]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,740 INFO L266 CegarLoopResult]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,741 INFO L266 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2020-11-06 22:27:21,741 INFO L266 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2020-11-06 22:27:21,741 INFO L262 CegarLoopResult]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2020-11-06 22:27:21,741 INFO L266 CegarLoopResult]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2020-11-06 22:27:21,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:27:21 BoogieIcfgContainer [2020-11-06 22:27:21,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:27:21,755 INFO L168 Benchmark]: Toolchain (without parser) took 26843.14 ms. Allocated memory was 125.8 MB in the beginning and 707.8 MB in the end (delta: 582.0 MB). Free memory was 101.6 MB in the beginning and 538.3 MB in the end (delta: -436.7 MB). Peak memory consumption was 494.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:21,756 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 125.8 MB. Free memory is still 90.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:27:21,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.23 ms. Allocated memory is still 125.8 MB. Free memory was 101.0 MB in the beginning and 90.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:21,758 INFO L168 Benchmark]: Boogie Preprocessor took 82.36 ms. Allocated memory is still 125.8 MB. Free memory was 90.8 MB in the beginning and 89.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:21,763 INFO L168 Benchmark]: RCFGBuilder took 644.86 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 89.1 MB in the beginning and 127.3 MB in the end (delta: -38.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:21,764 INFO L168 Benchmark]: TraceAbstraction took 25661.88 ms. Allocated memory was 151.0 MB in the beginning and 707.8 MB in the end (delta: 556.8 MB). Free memory was 127.1 MB in the beginning and 538.3 MB in the end (delta: -411.2 MB). Peak memory consumption was 493.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:27:21,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 125.8 MB. Free memory is still 90.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 439.23 ms. Allocated memory is still 125.8 MB. Free memory was 101.0 MB in the beginning and 90.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 82.36 ms. Allocated memory is still 125.8 MB. Free memory was 90.8 MB in the beginning and 89.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 644.86 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 89.1 MB in the beginning and 127.3 MB in the end (delta: -38.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25661.88 ms. Allocated memory was 151.0 MB in the beginning and 707.8 MB in the end (delta: 556.8 MB). Free memory was 127.1 MB in the beginning and 538.3 MB in the end (delta: -411.2 MB). Peak memory consumption was 493.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1967 SDtfs, 2829 SDslu, 194 SDs, 0 SdLazy, 1415 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10250occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 2049 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 32 PreInvPairs, 547 NumberOfFragments, 38 HoareAnnotationTreeSize, 32 FomulaSimplifications, 13725542 FormulaSimplificationTreeSizeReduction, 15.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 90 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 606 ConstructedInterpolants, 0 QuantifiedInterpolants, 45934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...