/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:05:28,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:28,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:29,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:29,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:29,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:29,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:29,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:29,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:29,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:29,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:29,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:29,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:29,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:29,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:29,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:29,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:29,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:29,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:29,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:29,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:29,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:29,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:29,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:29,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:29,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:29,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:29,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:29,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:29,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:29,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:29,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:29,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:29,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:29,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:29,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:29,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:29,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:29,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:29,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:29,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:29,066 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 [2019-11-07 01:05:29,098 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:29,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:29,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:29,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:29,105 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:29,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:29,105 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:29,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:29,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:29,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:29,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:29,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:29,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:29,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:29,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:29,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:29,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:29,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:29,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:29,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:29,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:29,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:29,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:29,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:29,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:29,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:29,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:29,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:29,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:05:29,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:29,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:29,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:29,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:29,407 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:29,408 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-07 01:05:29,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2301ce1ba/54a5cf166bca4d24ae2d41f65e92697b/FLAG0ec23c601 [2019-11-07 01:05:30,270 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:30,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-07 01:05:30,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2301ce1ba/54a5cf166bca4d24ae2d41f65e92697b/FLAG0ec23c601 [2019-11-07 01:05:30,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2301ce1ba/54a5cf166bca4d24ae2d41f65e92697b [2019-11-07 01:05:30,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:30,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:30,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:30,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:30,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:30,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf87aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30, skipping insertion in model container [2019-11-07 01:05:30,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:30,562 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:31,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:31,737 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:32,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:32,142 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:32,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32 WrapperNode [2019-11-07 01:05:32,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:32,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:32,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:32,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:32,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (1/1) ... [2019-11-07 01:05:32,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:32,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:32,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:32,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:32,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:32,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:32,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:32,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:32,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:32,494 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:32,495 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:32,496 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:32,497 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:32,497 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:32,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:32,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:35,983 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:35,984 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:35,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:35 BoogieIcfgContainer [2019-11-07 01:05:35,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:35,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:35,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:35,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:35,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:30" (1/3) ... [2019-11-07 01:05:35,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76885e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:35, skipping insertion in model container [2019-11-07 01:05:35,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:32" (2/3) ... [2019-11-07 01:05:35,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76885e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:35, skipping insertion in model container [2019-11-07 01:05:35,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:35" (3/3) ... [2019-11-07 01:05:35,999 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-07 01:05:36,010 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:36,038 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-07 01:05:36,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-07 01:05:36,104 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:36,104 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:36,104 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:36,104 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:36,105 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:36,105 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:36,105 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:36,105 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states. [2019-11-07 01:05:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:36,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:36,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-07 01:05:36,229 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1212138476, now seen corresponding path program 1 times [2019-11-07 01:05:36,242 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:36,242 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825190224] [2019-11-07 01:05:36,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:36,879 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825190224] [2019-11-07 01:05:36,880 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:36,880 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:36,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840410269] [2019-11-07 01:05:36,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:36,890 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:36,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:36,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:36,910 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand 6 states. [2019-11-07 01:05:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:38,739 INFO L93 Difference]: Finished difference Result 2390 states and 4093 transitions. [2019-11-07 01:05:38,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:38,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-07 01:05:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:38,768 INFO L225 Difference]: With dead ends: 2390 [2019-11-07 01:05:38,768 INFO L226 Difference]: Without dead ends: 1617 [2019-11-07 01:05:38,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-11-07 01:05:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1594. [2019-11-07 01:05:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-11-07 01:05:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2070 transitions. [2019-11-07 01:05:38,969 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2070 transitions. Word has length 56 [2019-11-07 01:05:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:38,970 INFO L462 AbstractCegarLoop]: Abstraction has 1594 states and 2070 transitions. [2019-11-07 01:05:38,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2070 transitions. [2019-11-07 01:05:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:38,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:38,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-07 01:05:38,976 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:38,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1633149148, now seen corresponding path program 1 times [2019-11-07 01:05:38,977 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:38,977 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147196773] [2019-11-07 01:05:38,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:39,164 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147196773] [2019-11-07 01:05:39,165 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:39,165 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:39,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561748119] [2019-11-07 01:05:39,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:39,168 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:39,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:39,170 INFO L87 Difference]: Start difference. First operand 1594 states and 2070 transitions. Second operand 6 states. [2019-11-07 01:05:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:40,388 INFO L93 Difference]: Finished difference Result 3490 states and 4654 transitions. [2019-11-07 01:05:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:40,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-07 01:05:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:40,403 INFO L225 Difference]: With dead ends: 3490 [2019-11-07 01:05:40,403 INFO L226 Difference]: Without dead ends: 2530 [2019-11-07 01:05:40,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-11-07 01:05:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2514. [2019-11-07 01:05:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-11-07 01:05:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3354 transitions. [2019-11-07 01:05:40,512 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3354 transitions. Word has length 56 [2019-11-07 01:05:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:40,512 INFO L462 AbstractCegarLoop]: Abstraction has 2514 states and 3354 transitions. [2019-11-07 01:05:40,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3354 transitions. [2019-11-07 01:05:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:40,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:40,516 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-07 01:05:40,517 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:40,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash -755922083, now seen corresponding path program 1 times [2019-11-07 01:05:40,517 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:40,518 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958575880] [2019-11-07 01:05:40,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:40,720 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958575880] [2019-11-07 01:05:40,721 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:40,721 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:40,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355162268] [2019-11-07 01:05:40,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:40,723 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:40,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:40,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:40,724 INFO L87 Difference]: Start difference. First operand 2514 states and 3354 transitions. Second operand 5 states. [2019-11-07 01:05:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:42,088 INFO L93 Difference]: Finished difference Result 5219 states and 7042 transitions. [2019-11-07 01:05:42,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:42,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-07 01:05:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:42,118 INFO L225 Difference]: With dead ends: 5219 [2019-11-07 01:05:42,119 INFO L226 Difference]: Without dead ends: 3904 [2019-11-07 01:05:42,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:05:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2019-11-07 01:05:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3898. [2019-11-07 01:05:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-11-07 01:05:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5174 transitions. [2019-11-07 01:05:42,483 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5174 transitions. Word has length 56 [2019-11-07 01:05:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:42,486 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5174 transitions. [2019-11-07 01:05:42,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5174 transitions. [2019-11-07 01:05:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:05:42,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:42,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1] [2019-11-07 01:05:42,492 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash -418972447, now seen corresponding path program 1 times [2019-11-07 01:05:42,493 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:42,494 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015200746] [2019-11-07 01:05:42,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:42,816 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015200746] [2019-11-07 01:05:42,817 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:42,817 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:05:42,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907966157] [2019-11-07 01:05:42,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:05:42,818 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:42,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:05:42,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:42,819 INFO L87 Difference]: Start difference. First operand 3898 states and 5174 transitions. Second operand 8 states. [2019-11-07 01:05:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:45,119 INFO L93 Difference]: Finished difference Result 8917 states and 12719 transitions. [2019-11-07 01:05:45,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 01:05:45,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-07 01:05:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:45,156 INFO L225 Difference]: With dead ends: 8917 [2019-11-07 01:05:45,156 INFO L226 Difference]: Without dead ends: 7575 [2019-11-07 01:05:45,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-07 01:05:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7575 states. [2019-11-07 01:05:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7575 to 3898. [2019-11-07 01:05:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-11-07 01:05:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5173 transitions. [2019-11-07 01:05:45,413 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5173 transitions. Word has length 58 [2019-11-07 01:05:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:45,414 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5173 transitions. [2019-11-07 01:05:45,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:05:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5173 transitions. [2019-11-07 01:05:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:05:45,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:45,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1] [2019-11-07 01:05:45,420 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1952539007, now seen corresponding path program 1 times [2019-11-07 01:05:45,421 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:45,422 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311636945] [2019-11-07 01:05:45,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:45,760 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311636945] [2019-11-07 01:05:45,760 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:45,760 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:45,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415291976] [2019-11-07 01:05:45,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:45,762 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:45,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:45,765 INFO L87 Difference]: Start difference. First operand 3898 states and 5173 transitions. Second operand 9 states. [2019-11-07 01:05:46,002 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-11-07 01:05:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:49,426 INFO L93 Difference]: Finished difference Result 8308 states and 11719 transitions. [2019-11-07 01:05:49,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-07 01:05:49,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-11-07 01:05:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:49,462 INFO L225 Difference]: With dead ends: 8308 [2019-11-07 01:05:49,463 INFO L226 Difference]: Without dead ends: 8302 [2019-11-07 01:05:49,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-11-07 01:05:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8302 states. [2019-11-07 01:05:49,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8302 to 3898. [2019-11-07 01:05:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-11-07 01:05:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5172 transitions. [2019-11-07 01:05:49,771 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5172 transitions. Word has length 58 [2019-11-07 01:05:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:49,772 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5172 transitions. [2019-11-07 01:05:49,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5172 transitions. [2019-11-07 01:05:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:05:49,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:49,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1] [2019-11-07 01:05:49,780 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash -215970595, now seen corresponding path program 1 times [2019-11-07 01:05:49,781 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:49,781 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513349559] [2019-11-07 01:05:49,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:50,058 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513349559] [2019-11-07 01:05:50,059 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:50,059 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:50,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299180322] [2019-11-07 01:05:50,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:50,060 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:50,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:50,061 INFO L87 Difference]: Start difference. First operand 3898 states and 5172 transitions. Second operand 9 states. [2019-11-07 01:05:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:53,313 INFO L93 Difference]: Finished difference Result 10341 states and 14551 transitions. [2019-11-07 01:05:53,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 01:05:53,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-11-07 01:05:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:53,343 INFO L225 Difference]: With dead ends: 10341 [2019-11-07 01:05:53,343 INFO L226 Difference]: Without dead ends: 9285 [2019-11-07 01:05:53,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-11-07 01:05:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2019-11-07 01:05:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 3898. [2019-11-07 01:05:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-11-07 01:05:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5171 transitions. [2019-11-07 01:05:53,635 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5171 transitions. Word has length 58 [2019-11-07 01:05:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:53,637 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 5171 transitions. [2019-11-07 01:05:53,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5171 transitions. [2019-11-07 01:05:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:53,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:53,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2019-11-07 01:05:53,648 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash 834918715, now seen corresponding path program 1 times [2019-11-07 01:05:53,652 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:53,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613969535] [2019-11-07 01:05:53,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:53,770 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613969535] [2019-11-07 01:05:53,771 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:53,771 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:53,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414557061] [2019-11-07 01:05:53,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:53,772 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:53,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:53,772 INFO L87 Difference]: Start difference. First operand 3898 states and 5171 transitions. Second operand 3 states. [2019-11-07 01:05:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:54,342 INFO L93 Difference]: Finished difference Result 5770 states and 8000 transitions. [2019-11-07 01:05:54,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:54,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-07 01:05:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:54,360 INFO L225 Difference]: With dead ends: 5770 [2019-11-07 01:05:54,360 INFO L226 Difference]: Without dead ends: 4287 [2019-11-07 01:05:54,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-11-07 01:05:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3971. [2019-11-07 01:05:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-11-07 01:05:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5314 transitions. [2019-11-07 01:05:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5314 transitions. Word has length 59 [2019-11-07 01:05:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:54,689 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 5314 transitions. [2019-11-07 01:05:54,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5314 transitions. [2019-11-07 01:05:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:54,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:54,693 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2019-11-07 01:05:54,693 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:54,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:54,694 INFO L82 PathProgramCache]: Analyzing trace with hash 132280932, now seen corresponding path program 1 times [2019-11-07 01:05:54,694 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:54,694 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302907666] [2019-11-07 01:05:54,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:54,802 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302907666] [2019-11-07 01:05:54,803 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:54,803 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:54,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999136307] [2019-11-07 01:05:54,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:54,804 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:54,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:54,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:54,805 INFO L87 Difference]: Start difference. First operand 3971 states and 5314 transitions. Second operand 3 states. [2019-11-07 01:05:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:55,477 INFO L93 Difference]: Finished difference Result 6729 states and 9451 transitions. [2019-11-07 01:05:55,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:55,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-07 01:05:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:55,492 INFO L225 Difference]: With dead ends: 6729 [2019-11-07 01:05:55,493 INFO L226 Difference]: Without dead ends: 4943 [2019-11-07 01:05:55,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2019-11-07 01:05:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4463. [2019-11-07 01:05:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4463 states. [2019-11-07 01:05:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 6066 transitions. [2019-11-07 01:05:55,946 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 6066 transitions. Word has length 59 [2019-11-07 01:05:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:55,947 INFO L462 AbstractCegarLoop]: Abstraction has 4463 states and 6066 transitions. [2019-11-07 01:05:55,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 6066 transitions. [2019-11-07 01:05:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:55,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:55,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2019-11-07 01:05:55,951 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1642469980, now seen corresponding path program 1 times [2019-11-07 01:05:55,952 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:55,952 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599635778] [2019-11-07 01:05:55,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:56,061 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599635778] [2019-11-07 01:05:56,062 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:56,062 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:56,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226981199] [2019-11-07 01:05:56,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:56,063 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:56,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:56,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:56,064 INFO L87 Difference]: Start difference. First operand 4463 states and 6066 transitions. Second operand 3 states. [2019-11-07 01:05:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:56,691 INFO L93 Difference]: Finished difference Result 8919 states and 12582 transitions. [2019-11-07 01:05:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:56,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-07 01:05:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:56,706 INFO L225 Difference]: With dead ends: 8919 [2019-11-07 01:05:56,706 INFO L226 Difference]: Without dead ends: 5699 [2019-11-07 01:05:56,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2019-11-07 01:05:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5697. [2019-11-07 01:05:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-11-07 01:05:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7848 transitions. [2019-11-07 01:05:57,412 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7848 transitions. Word has length 59 [2019-11-07 01:05:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:57,416 INFO L462 AbstractCegarLoop]: Abstraction has 5697 states and 7848 transitions. [2019-11-07 01:05:57,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7848 transitions. [2019-11-07 01:05:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:05:57,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:57,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1] [2019-11-07 01:05:57,426 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:57,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash 11887072, now seen corresponding path program 1 times [2019-11-07 01:05:57,427 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:57,427 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073805130] [2019-11-07 01:05:57,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:57,528 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073805130] [2019-11-07 01:05:57,528 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:57,528 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:57,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631050460] [2019-11-07 01:05:57,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:57,529 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:57,530 INFO L87 Difference]: Start difference. First operand 5697 states and 7848 transitions. Second operand 3 states. [2019-11-07 01:05:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:58,553 INFO L93 Difference]: Finished difference Result 13367 states and 18972 transitions. [2019-11-07 01:05:58,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:58,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:05:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:58,573 INFO L225 Difference]: With dead ends: 13367 [2019-11-07 01:05:58,574 INFO L226 Difference]: Without dead ends: 8543 [2019-11-07 01:05:58,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2019-11-07 01:05:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 6757. [2019-11-07 01:05:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-11-07 01:05:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 9505 transitions. [2019-11-07 01:05:59,292 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 9505 transitions. Word has length 60 [2019-11-07 01:05:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:59,292 INFO L462 AbstractCegarLoop]: Abstraction has 6757 states and 9505 transitions. [2019-11-07 01:05:59,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 9505 transitions. [2019-11-07 01:05:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:05:59,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:59,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1] [2019-11-07 01:05:59,295 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:59,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:59,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2065078364, now seen corresponding path program 1 times [2019-11-07 01:05:59,296 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:59,296 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809953549] [2019-11-07 01:05:59,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:59,368 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809953549] [2019-11-07 01:05:59,368 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:59,368 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:59,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031174604] [2019-11-07 01:05:59,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:59,369 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:59,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:59,370 INFO L87 Difference]: Start difference. First operand 6757 states and 9505 transitions. Second operand 3 states. [2019-11-07 01:06:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:00,647 INFO L93 Difference]: Finished difference Result 17110 states and 24518 transitions. [2019-11-07 01:06:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:00,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:06:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:00,665 INFO L225 Difference]: With dead ends: 17110 [2019-11-07 01:06:00,665 INFO L226 Difference]: Without dead ends: 10944 [2019-11-07 01:06:00,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2019-11-07 01:06:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 8515. [2019-11-07 01:06:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2019-11-07 01:06:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 12125 transitions. [2019-11-07 01:06:01,486 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 12125 transitions. Word has length 60 [2019-11-07 01:06:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:01,486 INFO L462 AbstractCegarLoop]: Abstraction has 8515 states and 12125 transitions. [2019-11-07 01:06:01,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 12125 transitions. [2019-11-07 01:06:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:06:01,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:01,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1] [2019-11-07 01:06:01,490 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:01,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1780702045, now seen corresponding path program 1 times [2019-11-07 01:06:01,491 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:01,491 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408562941] [2019-11-07 01:06:01,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat