/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:35:20,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:35:20,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:35:20,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:35:20,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:35:20,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:35:20,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:35:20,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:35:20,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:35:20,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:35:20,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:35:20,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:35:20,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:35:20,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:35:20,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:35:20,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:35:20,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:35:20,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:35:20,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:35:20,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:35:20,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:35:20,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:35:20,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:35:20,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:35:20,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:35:20,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:35:20,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:35:20,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:35:20,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:35:20,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:35:20,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:35:20,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:35:20,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:35:20,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:35:20,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:35:20,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:35:20,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:35:20,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:35:20,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:35:20,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:35:20,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:35:20,889 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-23 22:35:20,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:35:20,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:35:20,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:35:20,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:35:20,913 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:35:20,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:35:20,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:35:20,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:35:20,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:35:20,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:35:20,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:35:20,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:35:20,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:35:20,916 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:35:20,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:35:20,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:35:20,916 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:35:20,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:35:20,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:35:20,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:35:20,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:35:20,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:35:20,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:35:20,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:35:20,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:35:20,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:35:20,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:35:20,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:35:20,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:35:20,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:35:21,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:35:21,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:35:21,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:35:21,206 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:35:21,206 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:35:21,207 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:35:21,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42a2277d/6eec663d72464713bdd572e03fa40f11/FLAGe1ec26893 [2019-11-23 22:35:21,852 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:35:21,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:35:21,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42a2277d/6eec663d72464713bdd572e03fa40f11/FLAGe1ec26893 [2019-11-23 22:35:22,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42a2277d/6eec663d72464713bdd572e03fa40f11 [2019-11-23 22:35:22,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:35:22,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:35:22,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:22,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:35:22,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:35:22,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:22" (1/1) ... [2019-11-23 22:35:22,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338eb183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:22, skipping insertion in model container [2019-11-23 22:35:22,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:22" (1/1) ... [2019-11-23 22:35:22,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:35:22,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:35:22,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:22,937 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:35:23,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:35:23,440 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:35:23,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23 WrapperNode [2019-11-23 22:35:23,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:35:23,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:23,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:35:23,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:35:23,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:35:23,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:35:23,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:35:23,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:35:23,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (1/1) ... [2019-11-23 22:35:23,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:35:23,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:35:23,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:35:23,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:35:23,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (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-23 22:35:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:35:23,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:35:25,494 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:35:25,494 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:35:25,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:25 BoogieIcfgContainer [2019-11-23 22:35:25,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:35:25,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:35:25,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:35:25,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:35:25,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:35:22" (1/3) ... [2019-11-23 22:35:25,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc8ce04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:25, skipping insertion in model container [2019-11-23 22:35:25,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:23" (2/3) ... [2019-11-23 22:35:25,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc8ce04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:25, skipping insertion in model container [2019-11-23 22:35:25,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:25" (3/3) ... [2019-11-23 22:35:25,504 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:35:25,514 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:35:25,523 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-23 22:35:25,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-23 22:35:25,579 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:35:25,579 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:35:25,579 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:35:25,579 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:35:25,579 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:35:25,580 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:35:25,580 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:35:25,581 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:35:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-23 22:35:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:35:25,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:25,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:25,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:25,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:25,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1455877833, now seen corresponding path program 1 times [2019-11-23 22:35:25,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:25,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510875992] [2019-11-23 22:35:25,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:26,229 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-23 22:35:26,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510875992] [2019-11-23 22:35:26,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:26,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:26,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232119502] [2019-11-23 22:35:26,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:26,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:26,256 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 3 states. [2019-11-23 22:35:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:26,473 INFO L93 Difference]: Finished difference Result 767 states and 1341 transitions. [2019-11-23 22:35:26,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:26,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 22:35:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:26,501 INFO L225 Difference]: With dead ends: 767 [2019-11-23 22:35:26,501 INFO L226 Difference]: Without dead ends: 612 [2019-11-23 22:35:26,509 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-23 22:35:26,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-11-23 22:35:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-11-23 22:35:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-23 22:35:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 895 transitions. [2019-11-23 22:35:26,596 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 895 transitions. Word has length 150 [2019-11-23 22:35:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:26,597 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 895 transitions. [2019-11-23 22:35:26,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 895 transitions. [2019-11-23 22:35:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:35:26,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:26,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:26,601 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1340171657, now seen corresponding path program 1 times [2019-11-23 22:35:26,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:26,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604002790] [2019-11-23 22:35:26,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:27,044 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-23 22:35:27,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604002790] [2019-11-23 22:35:27,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:27,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:27,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979420479] [2019-11-23 22:35:27,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:27,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:27,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:27,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:27,049 INFO L87 Difference]: Start difference. First operand 610 states and 895 transitions. Second operand 4 states. [2019-11-23 22:35:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:27,221 INFO L93 Difference]: Finished difference Result 1784 states and 2608 transitions. [2019-11-23 22:35:27,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:27,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 22:35:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:27,229 INFO L225 Difference]: With dead ends: 1784 [2019-11-23 22:35:27,230 INFO L226 Difference]: Without dead ends: 1183 [2019-11-23 22:35:27,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-23 22:35:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1156. [2019-11-23 22:35:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-11-23 22:35:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1688 transitions. [2019-11-23 22:35:27,325 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1688 transitions. Word has length 150 [2019-11-23 22:35:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:27,327 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1688 transitions. [2019-11-23 22:35:27,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1688 transitions. [2019-11-23 22:35:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:35:27,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:27,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:27,335 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:27,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1287913931, now seen corresponding path program 1 times [2019-11-23 22:35:27,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:27,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560362864] [2019-11-23 22:35:27,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:27,424 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-23 22:35:27,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560362864] [2019-11-23 22:35:27,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:27,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:27,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139405190] [2019-11-23 22:35:27,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:27,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:27,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:27,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:27,429 INFO L87 Difference]: Start difference. First operand 1156 states and 1688 transitions. Second operand 3 states. [2019-11-23 22:35:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:27,543 INFO L93 Difference]: Finished difference Result 3430 states and 5002 transitions. [2019-11-23 22:35:27,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:27,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 22:35:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:27,557 INFO L225 Difference]: With dead ends: 3430 [2019-11-23 22:35:27,558 INFO L226 Difference]: Without dead ends: 2302 [2019-11-23 22:35:27,560 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-23 22:35:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-11-23 22:35:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 1158. [2019-11-23 22:35:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-11-23 22:35:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1690 transitions. [2019-11-23 22:35:27,633 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1690 transitions. Word has length 151 [2019-11-23 22:35:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:27,633 INFO L462 AbstractCegarLoop]: Abstraction has 1158 states and 1690 transitions. [2019-11-23 22:35:27,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1690 transitions. [2019-11-23 22:35:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:35:27,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:27,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:27,646 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:27,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1852245384, now seen corresponding path program 1 times [2019-11-23 22:35:27,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:27,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662790485] [2019-11-23 22:35:27,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:27,830 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-23 22:35:27,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662790485] [2019-11-23 22:35:27,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:27,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:27,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821489149] [2019-11-23 22:35:27,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:27,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:27,832 INFO L87 Difference]: Start difference. First operand 1158 states and 1690 transitions. Second operand 4 states. [2019-11-23 22:35:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:27,910 INFO L93 Difference]: Finished difference Result 2302 states and 3359 transitions. [2019-11-23 22:35:27,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:27,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 22:35:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:27,917 INFO L225 Difference]: With dead ends: 2302 [2019-11-23 22:35:27,917 INFO L226 Difference]: Without dead ends: 1158 [2019-11-23 22:35:27,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-23 22:35:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2019-11-23 22:35:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-11-23 22:35:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1687 transitions. [2019-11-23 22:35:27,974 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1687 transitions. Word has length 152 [2019-11-23 22:35:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:27,975 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 1687 transitions. [2019-11-23 22:35:27,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1687 transitions. [2019-11-23 22:35:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:35:27,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:27,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:27,978 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1568302179, now seen corresponding path program 1 times [2019-11-23 22:35:27,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:27,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376624237] [2019-11-23 22:35:27,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:28,095 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-23 22:35:28,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376624237] [2019-11-23 22:35:28,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:28,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:28,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928541032] [2019-11-23 22:35:28,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:28,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:28,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:28,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:28,099 INFO L87 Difference]: Start difference. First operand 1157 states and 1687 transitions. Second operand 3 states. [2019-11-23 22:35:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:28,263 INFO L93 Difference]: Finished difference Result 3208 states and 4680 transitions. [2019-11-23 22:35:28,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:28,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:35:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:28,275 INFO L225 Difference]: With dead ends: 3208 [2019-11-23 22:35:28,275 INFO L226 Difference]: Without dead ends: 2243 [2019-11-23 22:35:28,277 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-23 22:35:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2019-11-23 22:35:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2216. [2019-11-23 22:35:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2019-11-23 22:35:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3208 transitions. [2019-11-23 22:35:28,374 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3208 transitions. Word has length 152 [2019-11-23 22:35:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:28,375 INFO L462 AbstractCegarLoop]: Abstraction has 2216 states and 3208 transitions. [2019-11-23 22:35:28,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3208 transitions. [2019-11-23 22:35:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:35:28,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:28,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:28,381 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1171330944, now seen corresponding path program 1 times [2019-11-23 22:35:28,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:28,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756467926] [2019-11-23 22:35:28,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:28,532 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-23 22:35:28,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756467926] [2019-11-23 22:35:28,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:28,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:28,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351125700] [2019-11-23 22:35:28,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:28,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:28,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:28,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:28,535 INFO L87 Difference]: Start difference. First operand 2216 states and 3208 transitions. Second operand 4 states. [2019-11-23 22:35:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:28,659 INFO L93 Difference]: Finished difference Result 3736 states and 5418 transitions. [2019-11-23 22:35:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:28,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 22:35:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:28,671 INFO L225 Difference]: With dead ends: 3736 [2019-11-23 22:35:28,671 INFO L226 Difference]: Without dead ends: 1700 [2019-11-23 22:35:28,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-23 22:35:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2019-11-23 22:35:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-11-23 22:35:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2452 transitions. [2019-11-23 22:35:28,835 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2452 transitions. Word has length 152 [2019-11-23 22:35:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:28,836 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 2452 transitions. [2019-11-23 22:35:28,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2452 transitions. [2019-11-23 22:35:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:35:28,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:28,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:28,841 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash 781372132, now seen corresponding path program 1 times [2019-11-23 22:35:28,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:28,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781598528] [2019-11-23 22:35:28,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:28,960 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-23 22:35:28,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781598528] [2019-11-23 22:35:28,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:28,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:28,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356887352] [2019-11-23 22:35:28,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:28,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:28,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:28,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:28,963 INFO L87 Difference]: Start difference. First operand 1700 states and 2452 transitions. Second operand 3 states. [2019-11-23 22:35:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:29,158 INFO L93 Difference]: Finished difference Result 3988 states and 5881 transitions. [2019-11-23 22:35:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:29,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:35:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:29,172 INFO L225 Difference]: With dead ends: 3988 [2019-11-23 22:35:29,173 INFO L226 Difference]: Without dead ends: 2470 [2019-11-23 22:35:29,180 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-23 22:35:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-11-23 22:35:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2142. [2019-11-23 22:35:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-11-23 22:35:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3173 transitions. [2019-11-23 22:35:29,317 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3173 transitions. Word has length 154 [2019-11-23 22:35:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:29,318 INFO L462 AbstractCegarLoop]: Abstraction has 2142 states and 3173 transitions. [2019-11-23 22:35:29,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3173 transitions. [2019-11-23 22:35:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:35:29,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:29,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:29,323 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1705023188, now seen corresponding path program 1 times [2019-11-23 22:35:29,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:29,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586919591] [2019-11-23 22:35:29,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:29,404 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-23 22:35:29,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586919591] [2019-11-23 22:35:29,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:29,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:29,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554205186] [2019-11-23 22:35:29,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:29,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:29,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:29,407 INFO L87 Difference]: Start difference. First operand 2142 states and 3173 transitions. Second operand 3 states. [2019-11-23 22:35:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:29,671 INFO L93 Difference]: Finished difference Result 5128 states and 7758 transitions. [2019-11-23 22:35:29,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:29,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 22:35:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:29,687 INFO L225 Difference]: With dead ends: 5128 [2019-11-23 22:35:29,687 INFO L226 Difference]: Without dead ends: 3252 [2019-11-23 22:35:29,690 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-23 22:35:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2019-11-23 22:35:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2920. [2019-11-23 22:35:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-11-23 22:35:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4433 transitions. [2019-11-23 22:35:29,869 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4433 transitions. Word has length 156 [2019-11-23 22:35:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:29,869 INFO L462 AbstractCegarLoop]: Abstraction has 2920 states and 4433 transitions. [2019-11-23 22:35:29,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4433 transitions. [2019-11-23 22:35:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:35:29,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:29,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:29,879 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:29,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1816910392, now seen corresponding path program 1 times [2019-11-23 22:35:29,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:29,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330079361] [2019-11-23 22:35:29,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:30,200 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-23 22:35:30,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330079361] [2019-11-23 22:35:30,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:30,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:30,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452899988] [2019-11-23 22:35:30,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:30,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:30,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:30,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:30,211 INFO L87 Difference]: Start difference. First operand 2920 states and 4433 transitions. Second operand 4 states. [2019-11-23 22:35:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:30,722 INFO L93 Difference]: Finished difference Result 7050 states and 11021 transitions. [2019-11-23 22:35:30,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:30,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 22:35:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:30,746 INFO L225 Difference]: With dead ends: 7050 [2019-11-23 22:35:30,746 INFO L226 Difference]: Without dead ends: 5228 [2019-11-23 22:35:30,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2019-11-23 22:35:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5226. [2019-11-23 22:35:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5226 states. [2019-11-23 22:35:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 8026 transitions. [2019-11-23 22:35:31,059 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 8026 transitions. Word has length 157 [2019-11-23 22:35:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:31,060 INFO L462 AbstractCegarLoop]: Abstraction has 5226 states and 8026 transitions. [2019-11-23 22:35:31,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 8026 transitions. [2019-11-23 22:35:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:35:31,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:31,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:31,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash -837981990, now seen corresponding path program 1 times [2019-11-23 22:35:31,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:31,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189315046] [2019-11-23 22:35:31,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:31,245 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-23 22:35:31,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189315046] [2019-11-23 22:35:31,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:31,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:31,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917360431] [2019-11-23 22:35:31,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:31,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:31,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:31,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:31,248 INFO L87 Difference]: Start difference. First operand 5226 states and 8026 transitions. Second operand 4 states. [2019-11-23 22:35:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:31,744 INFO L93 Difference]: Finished difference Result 13662 states and 20979 transitions. [2019-11-23 22:35:31,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:31,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 22:35:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:31,804 INFO L225 Difference]: With dead ends: 13662 [2019-11-23 22:35:31,804 INFO L226 Difference]: Without dead ends: 8463 [2019-11-23 22:35:31,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8463 states. [2019-11-23 22:35:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8463 to 8440. [2019-11-23 22:35:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-11-23 22:35:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 12854 transitions. [2019-11-23 22:35:32,277 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 12854 transitions. Word has length 157 [2019-11-23 22:35:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:32,284 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 12854 transitions. [2019-11-23 22:35:32,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 12854 transitions. [2019-11-23 22:35:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:35:32,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:32,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:32,294 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1379104380, now seen corresponding path program 1 times [2019-11-23 22:35:32,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:32,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626831043] [2019-11-23 22:35:32,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:32,385 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-23 22:35:32,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626831043] [2019-11-23 22:35:32,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:32,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:32,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635767879] [2019-11-23 22:35:32,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:32,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:32,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:32,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:32,388 INFO L87 Difference]: Start difference. First operand 8440 states and 12854 transitions. Second operand 3 states. [2019-11-23 22:35:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:32,963 INFO L93 Difference]: Finished difference Result 21201 states and 32318 transitions. [2019-11-23 22:35:32,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:32,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-23 22:35:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:32,995 INFO L225 Difference]: With dead ends: 21201 [2019-11-23 22:35:32,995 INFO L226 Difference]: Without dead ends: 13145 [2019-11-23 22:35:33,010 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-23 22:35:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13145 states. [2019-11-23 22:35:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13145 to 13124. [2019-11-23 22:35:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13124 states. [2019-11-23 22:35:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13124 states to 13124 states and 19763 transitions. [2019-11-23 22:35:33,699 INFO L78 Accepts]: Start accepts. Automaton has 13124 states and 19763 transitions. Word has length 159 [2019-11-23 22:35:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:33,699 INFO L462 AbstractCegarLoop]: Abstraction has 13124 states and 19763 transitions. [2019-11-23 22:35:33,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 13124 states and 19763 transitions. [2019-11-23 22:35:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:35:33,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:33,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:33,709 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1856649123, now seen corresponding path program 1 times [2019-11-23 22:35:33,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:33,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239017289] [2019-11-23 22:35:33,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:33,778 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-23 22:35:33,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239017289] [2019-11-23 22:35:33,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:33,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:33,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552317622] [2019-11-23 22:35:33,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:33,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:33,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:33,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:33,780 INFO L87 Difference]: Start difference. First operand 13124 states and 19763 transitions. Second operand 3 states. [2019-11-23 22:35:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:34,935 INFO L93 Difference]: Finished difference Result 35006 states and 53434 transitions. [2019-11-23 22:35:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:34,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:35:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:34,990 INFO L225 Difference]: With dead ends: 35006 [2019-11-23 22:35:34,991 INFO L226 Difference]: Without dead ends: 22214 [2019-11-23 22:35:35,017 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-23 22:35:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22214 states. [2019-11-23 22:35:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22214 to 20048. [2019-11-23 22:35:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20048 states. [2019-11-23 22:35:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20048 states to 20048 states and 30874 transitions. [2019-11-23 22:35:36,066 INFO L78 Accepts]: Start accepts. Automaton has 20048 states and 30874 transitions. Word has length 163 [2019-11-23 22:35:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:36,066 INFO L462 AbstractCegarLoop]: Abstraction has 20048 states and 30874 transitions. [2019-11-23 22:35:36,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 20048 states and 30874 transitions. [2019-11-23 22:35:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:35:36,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:36,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:36,076 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:36,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:36,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1193982163, now seen corresponding path program 1 times [2019-11-23 22:35:36,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:36,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081700341] [2019-11-23 22:35:36,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:36,137 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-23 22:35:36,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081700341] [2019-11-23 22:35:36,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:36,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:36,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655473298] [2019-11-23 22:35:36,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:36,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:36,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:36,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:36,140 INFO L87 Difference]: Start difference. First operand 20048 states and 30874 transitions. Second operand 3 states. [2019-11-23 22:35:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:37,608 INFO L93 Difference]: Finished difference Result 57797 states and 89512 transitions. [2019-11-23 22:35:37,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:37,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 22:35:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:37,683 INFO L225 Difference]: With dead ends: 57797 [2019-11-23 22:35:37,683 INFO L226 Difference]: Without dead ends: 39081 [2019-11-23 22:35:37,712 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-23 22:35:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39081 states. [2019-11-23 22:35:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39081 to 39046. [2019-11-23 22:35:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39046 states. [2019-11-23 22:35:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39046 states to 39046 states and 60059 transitions. [2019-11-23 22:35:39,697 INFO L78 Accepts]: Start accepts. Automaton has 39046 states and 60059 transitions. Word has length 164 [2019-11-23 22:35:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:39,698 INFO L462 AbstractCegarLoop]: Abstraction has 39046 states and 60059 transitions. [2019-11-23 22:35:39,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 39046 states and 60059 transitions. [2019-11-23 22:35:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:35:39,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:39,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:39,713 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:39,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:39,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1951177816, now seen corresponding path program 1 times [2019-11-23 22:35:39,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:39,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055043387] [2019-11-23 22:35:39,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:40,054 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-23 22:35:40,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055043387] [2019-11-23 22:35:40,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:40,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:35:40,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537778609] [2019-11-23 22:35:40,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:35:40,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:35:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:40,057 INFO L87 Difference]: Start difference. First operand 39046 states and 60059 transitions. Second operand 8 states. [2019-11-23 22:35:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:46,942 INFO L93 Difference]: Finished difference Result 163465 states and 251614 transitions. [2019-11-23 22:35:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:35:46,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 164 [2019-11-23 22:35:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:47,317 INFO L225 Difference]: With dead ends: 163465 [2019-11-23 22:35:47,317 INFO L226 Difference]: Without dead ends: 124970 [2019-11-23 22:35:47,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:35:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124970 states. [2019-11-23 22:35:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124970 to 66040. [2019-11-23 22:35:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66040 states. [2019-11-23 22:35:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66040 states to 66040 states and 100129 transitions. [2019-11-23 22:35:50,924 INFO L78 Accepts]: Start accepts. Automaton has 66040 states and 100129 transitions. Word has length 164 [2019-11-23 22:35:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:50,924 INFO L462 AbstractCegarLoop]: Abstraction has 66040 states and 100129 transitions. [2019-11-23 22:35:50,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:35:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 66040 states and 100129 transitions. [2019-11-23 22:35:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:35:50,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:50,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:35:50,940 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:50,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:50,941 INFO L82 PathProgramCache]: Analyzing trace with hash -637177356, now seen corresponding path program 1 times [2019-11-23 22:35:50,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:50,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479922373] [2019-11-23 22:35:50,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:51,106 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-23 22:35:51,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479922373] [2019-11-23 22:35:51,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:51,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:51,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417649267] [2019-11-23 22:35:51,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:51,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:51,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:51,108 INFO L87 Difference]: Start difference. First operand 66040 states and 100129 transitions. Second operand 4 states. [2019-11-23 22:35:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:57,137 INFO L93 Difference]: Finished difference Result 183555 states and 277496 transitions. [2019-11-23 22:35:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:57,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-23 22:35:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:57,313 INFO L225 Difference]: With dead ends: 183555 [2019-11-23 22:35:57,313 INFO L226 Difference]: Without dead ends: 117554 [2019-11-23 22:35:57,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117554 states. [2019-11-23 22:36:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117554 to 117511. [2019-11-23 22:36:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117511 states. [2019-11-23 22:36:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117511 states to 117511 states and 175422 transitions. [2019-11-23 22:36:05,063 INFO L78 Accepts]: Start accepts. Automaton has 117511 states and 175422 transitions. Word has length 164 [2019-11-23 22:36:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:05,064 INFO L462 AbstractCegarLoop]: Abstraction has 117511 states and 175422 transitions. [2019-11-23 22:36:05,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 117511 states and 175422 transitions. [2019-11-23 22:36:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 22:36:05,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:05,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:36:05,086 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:05,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1188003318, now seen corresponding path program 1 times [2019-11-23 22:36:05,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:05,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047087418] [2019-11-23 22:36:05,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:05,142 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-23 22:36:05,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047087418] [2019-11-23 22:36:05,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:05,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:05,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254586745] [2019-11-23 22:36:05,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:05,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:05,144 INFO L87 Difference]: Start difference. First operand 117511 states and 175422 transitions. Second operand 3 states. [2019-11-23 22:36:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:17,683 INFO L93 Difference]: Finished difference Result 352335 states and 526011 transitions. [2019-11-23 22:36:17,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:36:17,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-23 22:36:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:17,959 INFO L225 Difference]: With dead ends: 352335 [2019-11-23 22:36:17,959 INFO L226 Difference]: Without dead ends: 234932 [2019-11-23 22:36:18,033 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-23 22:36:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234932 states. [2019-11-23 22:36:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234932 to 117517. [2019-11-23 22:36:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117517 states. [2019-11-23 22:36:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117517 states to 117517 states and 175428 transitions. [2019-11-23 22:36:24,996 INFO L78 Accepts]: Start accepts. Automaton has 117517 states and 175428 transitions. Word has length 165 [2019-11-23 22:36:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:24,996 INFO L462 AbstractCegarLoop]: Abstraction has 117517 states and 175428 transitions. [2019-11-23 22:36:24,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:36:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 117517 states and 175428 transitions. [2019-11-23 22:36:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-23 22:36:25,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:25,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:36:25,016 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:25,016 INFO L82 PathProgramCache]: Analyzing trace with hash -951591691, now seen corresponding path program 1 times [2019-11-23 22:36:25,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:25,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728170541] [2019-11-23 22:36:25,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:25,153 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-23 22:36:25,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728170541] [2019-11-23 22:36:25,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:25,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:36:25,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015534808] [2019-11-23 22:36:25,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:36:25,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:36:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:36:25,155 INFO L87 Difference]: Start difference. First operand 117517 states and 175428 transitions. Second operand 4 states. [2019-11-23 22:36:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:36:32,457 INFO L93 Difference]: Finished difference Result 234996 states and 350804 transitions. [2019-11-23 22:36:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:36:32,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-23 22:36:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:36:32,593 INFO L225 Difference]: With dead ends: 234996 [2019-11-23 22:36:32,593 INFO L226 Difference]: Without dead ends: 117511 [2019-11-23 22:36:32,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:36:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117511 states. [2019-11-23 22:36:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117511 to 117511. [2019-11-23 22:36:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117511 states. [2019-11-23 22:36:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117511 states to 117511 states and 175416 transitions. [2019-11-23 22:36:38,966 INFO L78 Accepts]: Start accepts. Automaton has 117511 states and 175416 transitions. Word has length 166 [2019-11-23 22:36:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:36:38,967 INFO L462 AbstractCegarLoop]: Abstraction has 117511 states and 175416 transitions. [2019-11-23 22:36:38,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:36:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 117511 states and 175416 transitions. [2019-11-23 22:36:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-23 22:36:38,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:36:38,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:36:38,981 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:36:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:36:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 718071364, now seen corresponding path program 1 times [2019-11-23 22:36:38,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:36:38,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531122140] [2019-11-23 22:36:38,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:36:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:36:39,064 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-23 22:36:39,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531122140] [2019-11-23 22:36:39,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:36:39,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:36:39,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907014168] [2019-11-23 22:36:39,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:36:39,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:36:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:36:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:36:39,066 INFO L87 Difference]: Start difference. First operand 117511 states and 175416 transitions. Second operand 3 states.