/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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:05:24,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:24,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:24,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:24,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:24,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:24,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:24,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:24,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:24,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:24,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:24,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:24,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:24,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:24,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:24,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:24,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:24,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:24,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:24,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:24,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:24,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:24,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:24,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:24,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:24,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:24,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:24,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:24,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:24,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:24,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:24,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:24,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:24,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:24,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:24,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:24,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:24,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:24,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:24,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:24,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:24,867 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:24,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:24,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:24,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:24,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:24,883 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:24,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:24,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:24,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:24,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:24,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:24,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:24,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:24,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:24,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:24,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:24,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:24,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:24,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:24,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:24,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:24,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:24,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:24,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:24,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:24,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:24,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:24,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:24,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:24,888 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:25,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:25,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:25,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:25,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:25,218 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:25,218 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 01:05:25,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bab4d60/c96ab771a1ca4cadb1ec21efab1fdb72/FLAG0ddba22b3 [2019-11-07 01:05:26,079 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:26,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 01:05:26,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bab4d60/c96ab771a1ca4cadb1ec21efab1fdb72/FLAG0ddba22b3 [2019-11-07 01:05:26,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bab4d60/c96ab771a1ca4cadb1ec21efab1fdb72 [2019-11-07 01:05:26,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:26,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:26,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:26,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:26,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:26,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:26" (1/1) ... [2019-11-07 01:05:26,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620a6772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:26, skipping insertion in model container [2019-11-07 01:05:26,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:26" (1/1) ... [2019-11-07 01:05:26,187 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:26,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:27,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:27,573 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:27,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:27,928 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:27,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27 WrapperNode [2019-11-07 01:05:27,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:27,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:27,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:27,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:27,944 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:27" (1/1) ... [2019-11-07 01:05:27,945 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:27" (1/1) ... [2019-11-07 01:05:28,001 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:27" (1/1) ... [2019-11-07 01:05:28,001 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:27" (1/1) ... [2019-11-07 01:05:28,068 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:27" (1/1) ... [2019-11-07 01:05:28,106 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:27" (1/1) ... [2019-11-07 01:05:28,129 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:27" (1/1) ... [2019-11-07 01:05:28,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:28,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:28,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:28,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:28,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (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:28,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:05:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:28,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:31,403 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:31,404 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:31,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:31 BoogieIcfgContainer [2019-11-07 01:05:31,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:31,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:31,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:31,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:31,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:26" (1/3) ... [2019-11-07 01:05:31,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71355904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:31, skipping insertion in model container [2019-11-07 01:05:31,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (2/3) ... [2019-11-07 01:05:31,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71355904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:31, skipping insertion in model container [2019-11-07 01:05:31,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:31" (3/3) ... [2019-11-07 01:05:31,414 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 01:05:31,430 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:31,446 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-07 01:05:31,464 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-07 01:05:31,530 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:31,530 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:31,530 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:31,530 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:31,530 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:31,531 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:31,531 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:31,531 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-11-07 01:05:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:05:31,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:31,640 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] [2019-11-07 01:05:31,643 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:31,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-11-07 01:05:31,667 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:31,668 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164102156] [2019-11-07 01:05:31,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:32,387 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:32,388 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164102156] [2019-11-07 01:05:32,389 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:32,389 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:32,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577231778] [2019-11-07 01:05:32,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:32,398 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:32,416 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-11-07 01:05:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:34,745 INFO L93 Difference]: Finished difference Result 2483 states and 4339 transitions. [2019-11-07 01:05:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:34,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-11-07 01:05:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:34,772 INFO L225 Difference]: With dead ends: 2483 [2019-11-07 01:05:34,772 INFO L226 Difference]: Without dead ends: 1562 [2019-11-07 01:05:34,780 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:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-11-07 01:05:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1556. [2019-11-07 01:05:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-11-07 01:05:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2098 transitions. [2019-11-07 01:05:34,936 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2098 transitions. Word has length 55 [2019-11-07 01:05:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:34,937 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 2098 transitions. [2019-11-07 01:05:34,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2098 transitions. [2019-11-07 01:05:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:34,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:34,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,944 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-11-07 01:05:34,945 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:34,945 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839166117] [2019-11-07 01:05:34,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:35,145 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:35,145 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839166117] [2019-11-07 01:05:35,146 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:35,146 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:35,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084023667] [2019-11-07 01:05:35,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:35,148 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:35,149 INFO L87 Difference]: Start difference. First operand 1556 states and 2098 transitions. Second operand 6 states. [2019-11-07 01:05:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:36,668 INFO L93 Difference]: Finished difference Result 3394 states and 4672 transitions. [2019-11-07 01:05:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:36,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-07 01:05:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:36,681 INFO L225 Difference]: With dead ends: 3394 [2019-11-07 01:05:36,681 INFO L226 Difference]: Without dead ends: 2302 [2019-11-07 01:05:36,684 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:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-11-07 01:05:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2286. [2019-11-07 01:05:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2019-11-07 01:05:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3132 transitions. [2019-11-07 01:05:36,787 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3132 transitions. Word has length 56 [2019-11-07 01:05:36,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:36,788 INFO L462 AbstractCegarLoop]: Abstraction has 2286 states and 3132 transitions. [2019-11-07 01:05:36,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3132 transitions. [2019-11-07 01:05:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:36,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:36,796 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,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-11-07 01:05:36,798 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:36,799 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708122177] [2019-11-07 01:05:36,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:36,965 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,966 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708122177] [2019-11-07 01:05:36,966 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:36,967 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:36,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474911645] [2019-11-07 01:05:36,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:36,968 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:36,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:36,972 INFO L87 Difference]: Start difference. First operand 2286 states and 3132 transitions. Second operand 6 states. [2019-11-07 01:05:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:38,203 INFO L93 Difference]: Finished difference Result 5902 states and 8156 transitions. [2019-11-07 01:05:38,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:38,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-07 01:05:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:38,226 INFO L225 Difference]: With dead ends: 5902 [2019-11-07 01:05:38,235 INFO L226 Difference]: Without dead ends: 4341 [2019-11-07 01:05:38,240 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:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-11-07 01:05:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4321. [2019-11-07 01:05:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-11-07 01:05:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5977 transitions. [2019-11-07 01:05:38,494 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5977 transitions. Word has length 56 [2019-11-07 01:05:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:38,496 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5977 transitions. [2019-11-07 01:05:38,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5977 transitions. [2019-11-07 01:05:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 01:05:38,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:38,503 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] [2019-11-07 01:05:38,503 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:38,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:38,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-11-07 01:05:38,504 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:38,505 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262839978] [2019-11-07 01:05:38,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:38,776 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:38,776 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262839978] [2019-11-07 01:05:38,777 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:38,777 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:38,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159178421] [2019-11-07 01:05:38,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:38,778 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:38,780 INFO L87 Difference]: Start difference. First operand 4321 states and 5977 transitions. Second operand 9 states. [2019-11-07 01:05:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:42,620 INFO L93 Difference]: Finished difference Result 8366 states and 12155 transitions. [2019-11-07 01:05:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-07 01:05:42,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-11-07 01:05:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:42,661 INFO L225 Difference]: With dead ends: 8366 [2019-11-07 01:05:42,661 INFO L226 Difference]: Without dead ends: 8361 [2019-11-07 01:05:42,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-11-07 01:05:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8361 states. [2019-11-07 01:05:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8361 to 4321. [2019-11-07 01:05:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-11-07 01:05:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5976 transitions. [2019-11-07 01:05:42,934 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5976 transitions. Word has length 57 [2019-11-07 01:05:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:42,936 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5976 transitions. [2019-11-07 01:05:42,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5976 transitions. [2019-11-07 01:05:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 01:05:42,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:42,945 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] [2019-11-07 01:05:42,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-11-07 01:05:42,947 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:42,948 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320042072] [2019-11-07 01:05:42,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:43,170 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:43,170 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320042072] [2019-11-07 01:05:43,170 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:43,170 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:43,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177977019] [2019-11-07 01:05:43,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:43,171 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:43,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:43,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:43,172 INFO L87 Difference]: Start difference. First operand 4321 states and 5976 transitions. Second operand 9 states. [2019-11-07 01:05:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:47,065 INFO L93 Difference]: Finished difference Result 12184 states and 17666 transitions. [2019-11-07 01:05:47,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 01:05:47,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-11-07 01:05:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:47,124 INFO L225 Difference]: With dead ends: 12184 [2019-11-07 01:05:47,124 INFO L226 Difference]: Without dead ends: 11066 [2019-11-07 01:05:47,130 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:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-11-07 01:05:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4321. [2019-11-07 01:05:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-11-07 01:05:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5975 transitions. [2019-11-07 01:05:47,443 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5975 transitions. Word has length 57 [2019-11-07 01:05:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:47,444 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5975 transitions. [2019-11-07 01:05:47,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5975 transitions. [2019-11-07 01:05:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 01:05:47,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:47,451 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] [2019-11-07 01:05:47,451 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-11-07 01:05:47,452 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:47,452 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468460675] [2019-11-07 01:05:47,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:47,657 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:47,657 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468460675] [2019-11-07 01:05:47,658 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:47,658 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:05:47,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869193660] [2019-11-07 01:05:47,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:05:47,659 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:05:47,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:47,659 INFO L87 Difference]: Start difference. First operand 4321 states and 5975 transitions. Second operand 8 states. [2019-11-07 01:05:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:50,677 INFO L93 Difference]: Finished difference Result 9393 states and 13829 transitions. [2019-11-07 01:05:50,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 01:05:50,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-11-07 01:05:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:50,695 INFO L225 Difference]: With dead ends: 9393 [2019-11-07 01:05:50,696 INFO L226 Difference]: Without dead ends: 8067 [2019-11-07 01:05:50,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-07 01:05:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-11-07 01:05:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 4321. [2019-11-07 01:05:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-11-07 01:05:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5974 transitions. [2019-11-07 01:05:51,005 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5974 transitions. Word has length 57 [2019-11-07 01:05:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:51,005 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5974 transitions. [2019-11-07 01:05:51,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:05:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5974 transitions. [2019-11-07 01:05:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:05:51,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:51,010 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:51,010 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-11-07 01:05:51,011 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:51,011 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001617848] [2019-11-07 01:05:51,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:51,079 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:51,079 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001617848] [2019-11-07 01:05:51,079 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:51,079 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:51,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845512220] [2019-11-07 01:05:51,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:51,080 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:51,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:51,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:51,081 INFO L87 Difference]: Start difference. First operand 4321 states and 5974 transitions. Second operand 3 states. [2019-11-07 01:05:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:51,673 INFO L93 Difference]: Finished difference Result 8351 states and 11768 transitions. [2019-11-07 01:05:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:51,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 01:05:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:51,687 INFO L225 Difference]: With dead ends: 8351 [2019-11-07 01:05:51,687 INFO L226 Difference]: Without dead ends: 5831 [2019-11-07 01:05:51,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5831 states. [2019-11-07 01:05:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5831 to 5825. [2019-11-07 01:05:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-11-07 01:05:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7963 transitions. [2019-11-07 01:05:52,063 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7963 transitions. Word has length 58 [2019-11-07 01:05:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:52,063 INFO L462 AbstractCegarLoop]: Abstraction has 5825 states and 7963 transitions. [2019-11-07 01:05:52,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7963 transitions. [2019-11-07 01:05:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:05:52,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:52,070 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:52,070 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-11-07 01:05:52,071 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:52,071 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151218545] [2019-11-07 01:05:52,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:52,151 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:52,151 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151218545] [2019-11-07 01:05:52,151 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:52,152 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:52,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604700350] [2019-11-07 01:05:52,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:52,152 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:52,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:52,153 INFO L87 Difference]: Start difference. First operand 5825 states and 7963 transitions. Second operand 3 states. [2019-11-07 01:05:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:52,813 INFO L93 Difference]: Finished difference Result 9254 states and 13261 transitions. [2019-11-07 01:05:52,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:52,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 01:05:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:52,828 INFO L225 Difference]: With dead ends: 9254 [2019-11-07 01:05:52,828 INFO L226 Difference]: Without dead ends: 6946 [2019-11-07 01:05:52,837 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:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-11-07 01:05:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6354. [2019-11-07 01:05:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6354 states. [2019-11-07 01:05:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 8829 transitions. [2019-11-07 01:05:53,384 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 8829 transitions. Word has length 58 [2019-11-07 01:05:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:53,385 INFO L462 AbstractCegarLoop]: Abstraction has 6354 states and 8829 transitions. [2019-11-07 01:05:53,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 8829 transitions. [2019-11-07 01:05:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:05:53,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:53,390 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:53,391 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-11-07 01:05:53,391 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:53,391 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036651731] [2019-11-07 01:05:53,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:53,457 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,458 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036651731] [2019-11-07 01:05:53,459 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:53,459 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:53,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157238469] [2019-11-07 01:05:53,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:53,460 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:53,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:53,461 INFO L87 Difference]: Start difference. First operand 6354 states and 8829 transitions. Second operand 3 states. [2019-11-07 01:05:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:54,044 INFO L93 Difference]: Finished difference Result 11578 states and 16758 transitions. [2019-11-07 01:05:54,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:54,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 01:05:54,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:54,062 INFO L225 Difference]: With dead ends: 11578 [2019-11-07 01:05:54,062 INFO L226 Difference]: Without dead ends: 8287 [2019-11-07 01:05:54,070 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,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-11-07 01:05:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 7385. [2019-11-07 01:05:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7385 states. [2019-11-07 01:05:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 10353 transitions. [2019-11-07 01:05:54,621 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 10353 transitions. Word has length 58 [2019-11-07 01:05:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:54,621 INFO L462 AbstractCegarLoop]: Abstraction has 7385 states and 10353 transitions. [2019-11-07 01:05:54,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 10353 transitions. [2019-11-07 01:05:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:54,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:54,626 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,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-11-07 01:05:54,627 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:54,628 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550228440] [2019-11-07 01:05:54,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:54,697 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,698 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550228440] [2019-11-07 01:05:54,698 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:54,698 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:54,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605304615] [2019-11-07 01:05:54,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:54,699 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:54,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:54,702 INFO L87 Difference]: Start difference. First operand 7385 states and 10353 transitions. Second operand 3 states. [2019-11-07 01:05:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:55,934 INFO L93 Difference]: Finished difference Result 14377 states and 20411 transitions. [2019-11-07 01:05:55,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:55,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-07 01:05:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:55,959 INFO L225 Difference]: With dead ends: 14377 [2019-11-07 01:05:55,959 INFO L226 Difference]: Without dead ends: 7581 [2019-11-07 01:05:55,981 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,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-11-07 01:05:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 6187. [2019-11-07 01:05:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6187 states. [2019-11-07 01:05:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 8753 transitions. [2019-11-07 01:05:56,444 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 8753 transitions. Word has length 59 [2019-11-07 01:05:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:56,444 INFO L462 AbstractCegarLoop]: Abstraction has 6187 states and 8753 transitions. [2019-11-07 01:05:56,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 8753 transitions. [2019-11-07 01:05:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:56,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:56,449 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:56,449 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-11-07 01:05:56,450 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:56,450 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201890085] [2019-11-07 01:05:56,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:56,508 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,508 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201890085] [2019-11-07 01:05:56,509 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:56,509 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:56,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486100721] [2019-11-07 01:05:56,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:56,510 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:56,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:56,510 INFO L87 Difference]: Start difference. First operand 6187 states and 8753 transitions. Second operand 3 states. [2019-11-07 01:05:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:57,300 INFO L93 Difference]: Finished difference Result 13899 states and 20290 transitions. [2019-11-07 01:05:57,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:57,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-07 01:05:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:57,324 INFO L225 Difference]: With dead ends: 13899 [2019-11-07 01:05:57,324 INFO L226 Difference]: Without dead ends: 8813 [2019-11-07 01:05:57,334 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:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8813 states. [2019-11-07 01:05:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8813 to 7035. [2019-11-07 01:05:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7035 states. [2019-11-07 01:05:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 10173 transitions. [2019-11-07 01:05:58,107 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 10173 transitions. Word has length 59 [2019-11-07 01:05:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:58,107 INFO L462 AbstractCegarLoop]: Abstraction has 7035 states and 10173 transitions. [2019-11-07 01:05:58,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 10173 transitions. [2019-11-07 01:05:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:58,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:58,110 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:58,110 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash 926744535, now seen corresponding path program 1 times [2019-11-07 01:05:58,111 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:58,111 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503085178] [2019-11-07 01:05:58,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:58,166 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:58,166 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503085178] [2019-11-07 01:05:58,166 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:58,167 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:58,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348402733] [2019-11-07 01:05:58,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:58,167 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:58,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:58,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:58,168 INFO L87 Difference]: Start difference. First operand 7035 states and 10173 transitions. Second operand 3 states.