/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:31:30,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:31:30,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:31:30,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:31:30,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:31:30,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:31:30,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:31:30,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:31:30,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:31:30,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:31:30,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:31:30,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:31:30,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:31:30,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:31:30,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:31:30,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:31:30,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:31:30,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:31:30,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:31:30,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:31:30,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:31:30,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:31:30,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:31:30,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:31:30,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:31:30,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:31:30,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:31:30,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:31:30,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:31:30,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:31:30,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:31:30,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:31:30,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:31:30,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:31:30,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:31:30,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:31:30,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:31:30,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:31:30,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:31:30,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:31:30,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:31:30,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:31:30,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:31:30,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:31:30,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:31:30,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:31:30,455 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:31:30,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:31:30,455 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:31:30,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:31:30,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:31:30,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:31:30,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:31:30,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:31:30,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:31:30,456 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:31:30,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:31:30,457 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:31:30,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:31:30,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:31:30,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:31:30,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:31:30,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:31:30,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:31:30,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:31:30,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:31:30,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:31:30,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:31:30,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:31:30,459 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:31:30,459 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:31:30,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:31:30,460 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:31:30,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:31:30,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:31:30,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:31:30,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:31:30,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:31:30,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:31:30,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2019-12-27 19:31:30,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ef944ca/9721f1d86bc4474d94ec47b750ddd4b4/FLAGd42e22767 [2019-12-27 19:31:31,384 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:31:31,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2019-12-27 19:31:31,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ef944ca/9721f1d86bc4474d94ec47b750ddd4b4/FLAGd42e22767 [2019-12-27 19:31:31,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ef944ca/9721f1d86bc4474d94ec47b750ddd4b4 [2019-12-27 19:31:31,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:31:31,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:31:31,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:31:31,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:31:31,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:31:31,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:31:31" (1/1) ... [2019-12-27 19:31:31,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb1c669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:31, skipping insertion in model container [2019-12-27 19:31:31,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:31:31" (1/1) ... [2019-12-27 19:31:31,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:31:31,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:31:32,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:31:32,259 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:31:32,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:31:32,411 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:31:32,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32 WrapperNode [2019-12-27 19:31:32,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:31:32,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:31:32,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:31:32,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:31:32,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:31:32,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:31:32,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:31:32,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:31:32,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... [2019-12-27 19:31:32,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:31:32,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:31:32,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:31:32,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:31:32,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:31:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 19:31:32,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 19:31:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:31:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:31:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:31:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:31:32,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:31:32,549 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:31:32,799 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:31:32,799 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-27 19:31:32,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:31:32 BoogieIcfgContainer [2019-12-27 19:31:32,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:31:32,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:31:32,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:31:32,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:31:32,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:31:31" (1/3) ... [2019-12-27 19:31:32,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7adf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:31:32, skipping insertion in model container [2019-12-27 19:31:32,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:31:32" (2/3) ... [2019-12-27 19:31:32,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7adf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:31:32, skipping insertion in model container [2019-12-27 19:31:32,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:31:32" (3/3) ... [2019-12-27 19:31:32,817 INFO L109 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2019-12-27 19:31:32,832 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:31:32,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:31:32,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 19:31:32,854 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:31:32,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,893 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,895 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,895 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,896 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,899 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,899 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,903 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,903 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,904 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,908 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,908 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,909 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,909 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,909 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,909 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:32,925 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 19:31:32,942 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:31:32,942 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:31:32,943 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:31:32,943 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:31:32,943 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:31:32,943 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:31:32,943 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:31:32,943 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:31:32,955 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions [2019-12-27 19:31:32,957 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions [2019-12-27 19:31:32,993 INFO L132 PetriNetUnfolder]: 3/41 cut-off events. [2019-12-27 19:31:32,994 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:31:32,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-27 19:31:33,001 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions [2019-12-27 19:31:33,015 INFO L132 PetriNetUnfolder]: 3/41 cut-off events. [2019-12-27 19:31:33,015 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:31:33,016 INFO L76 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-27 19:31:33,018 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 240 [2019-12-27 19:31:33,019 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:31:33,666 INFO L206 etLargeBlockEncoding]: Checked pairs total: 160 [2019-12-27 19:31:33,667 INFO L214 etLargeBlockEncoding]: Total number of compositions: 29 [2019-12-27 19:31:33,670 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 9 places, 8 transitions [2019-12-27 19:31:33,678 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 19 states. [2019-12-27 19:31:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-12-27 19:31:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 19:31:33,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:33,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 19:31:33,688 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:33,694 INFO L82 PathProgramCache]: Analyzing trace with hash 4687879, now seen corresponding path program 1 times [2019-12-27 19:31:33,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:33,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851136206] [2019-12-27 19:31:33,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:33,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851136206] [2019-12-27 19:31:33,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:33,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:31:33,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871672604] [2019-12-27 19:31:33,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:33,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:33,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 19:31:33,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:33,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:33,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 19:31:33,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:33,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 19:31:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:31:33,903 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-12-27 19:31:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:33,907 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-12-27 19:31:33,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 19:31:33,908 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-27 19:31:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:33,914 INFO L225 Difference]: With dead ends: 11 [2019-12-27 19:31:33,914 INFO L226 Difference]: Without dead ends: 11 [2019-12-27 19:31:33,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:31:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-12-27 19:31:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-12-27 19:31:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-27 19:31:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-12-27 19:31:33,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 4 [2019-12-27 19:31:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:33,944 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-12-27 19:31:33,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 19:31:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-12-27 19:31:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 19:31:33,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:33,945 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-27 19:31:33,945 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash 210024220, now seen corresponding path program 1 times [2019-12-27 19:31:33,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:33,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087727274] [2019-12-27 19:31:33,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:34,005 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:31:34,005 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:31:34,007 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:31:34,007 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 19:31:34,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,016 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,016 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,017 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,017 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,018 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,019 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,019 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,020 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,020 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,020 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,020 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,024 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:34,027 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 19:31:34,028 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:31:34,028 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:31:34,028 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:31:34,028 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:31:34,028 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:31:34,029 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:31:34,029 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:31:34,029 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:31:34,031 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions [2019-12-27 19:31:34,031 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions [2019-12-27 19:31:34,064 INFO L132 PetriNetUnfolder]: 5/63 cut-off events. [2019-12-27 19:31:34,064 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 19:31:34,068 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2019-12-27 19:31:34,072 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions [2019-12-27 19:31:34,101 INFO L132 PetriNetUnfolder]: 5/63 cut-off events. [2019-12-27 19:31:34,101 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 19:31:34,103 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2019-12-27 19:31:34,106 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 792 [2019-12-27 19:31:34,106 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:31:34,680 INFO L206 etLargeBlockEncoding]: Checked pairs total: 964 [2019-12-27 19:31:34,680 INFO L214 etLargeBlockEncoding]: Total number of compositions: 35 [2019-12-27 19:31:34,680 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 13 transitions [2019-12-27 19:31:34,685 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100 states. [2019-12-27 19:31:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-12-27 19:31:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:31:34,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:34,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:31:34,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash 238718261, now seen corresponding path program 1 times [2019-12-27 19:31:34,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:34,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612397193] [2019-12-27 19:31:34,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:34,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612397193] [2019-12-27 19:31:34,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:34,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:34,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162427773] [2019-12-27 19:31:34,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:34,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:34,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:31:34,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:34,770 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:34,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:34,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:34,771 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2019-12-27 19:31:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:34,803 INFO L93 Difference]: Finished difference Result 96 states and 197 transitions. [2019-12-27 19:31:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:34,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 19:31:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:34,808 INFO L225 Difference]: With dead ends: 96 [2019-12-27 19:31:34,808 INFO L226 Difference]: Without dead ends: 96 [2019-12-27 19:31:34,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-27 19:31:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2019-12-27 19:31:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-27 19:31:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 180 transitions. [2019-12-27 19:31:34,826 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 180 transitions. Word has length 5 [2019-12-27 19:31:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:34,827 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 180 transitions. [2019-12-27 19:31:34,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 180 transitions. [2019-12-27 19:31:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:31:34,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:34,828 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:34,828 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:34,829 INFO L82 PathProgramCache]: Analyzing trace with hash -885466150, now seen corresponding path program 1 times [2019-12-27 19:31:34,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:34,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987687502] [2019-12-27 19:31:34,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:34,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987687502] [2019-12-27 19:31:34,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:34,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:34,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077384047] [2019-12-27 19:31:34,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:34,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:34,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 19:31:34,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:34,876 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:34,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:34,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:34,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:34,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:34,879 INFO L87 Difference]: Start difference. First operand 84 states and 180 transitions. Second operand 3 states. [2019-12-27 19:31:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:34,910 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2019-12-27 19:31:34,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:34,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 19:31:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:34,916 INFO L225 Difference]: With dead ends: 84 [2019-12-27 19:31:34,919 INFO L226 Difference]: Without dead ends: 84 [2019-12-27 19:31:34,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-27 19:31:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2019-12-27 19:31:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-27 19:31:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2019-12-27 19:31:34,943 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 8 [2019-12-27 19:31:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:34,947 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2019-12-27 19:31:34,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2019-12-27 19:31:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:34,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:34,948 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:34,949 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:34,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:34,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1678754413, now seen corresponding path program 1 times [2019-12-27 19:31:34,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:34,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465723261] [2019-12-27 19:31:34,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 19:31:35,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465723261] [2019-12-27 19:31:35,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:35,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:35,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005501575] [2019-12-27 19:31:35,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:35,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:35,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:35,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:35,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:31:35,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:35,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:35,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:35,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:35,041 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 4 states. [2019-12-27 19:31:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:35,060 INFO L93 Difference]: Finished difference Result 68 states and 136 transitions. [2019-12-27 19:31:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:35,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:35,064 INFO L225 Difference]: With dead ends: 68 [2019-12-27 19:31:35,064 INFO L226 Difference]: Without dead ends: 68 [2019-12-27 19:31:35,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:31:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-27 19:31:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-12-27 19:31:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-27 19:31:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 129 transitions. [2019-12-27 19:31:35,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 129 transitions. Word has length 9 [2019-12-27 19:31:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:35,073 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 129 transitions. [2019-12-27 19:31:35,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 129 transitions. [2019-12-27 19:31:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:35,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:35,074 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-12-27 19:31:35,074 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:35,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1679727603, now seen corresponding path program 1 times [2019-12-27 19:31:35,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:35,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216173111] [2019-12-27 19:31:35,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:35,124 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:31:35,125 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:31:35,125 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:31:35,125 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 19:31:35,133 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,133 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,133 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,133 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,134 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,134 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,134 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,135 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,135 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,135 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,135 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,135 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,136 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,138 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,138 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,138 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,138 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,139 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,139 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,139 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,141 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,141 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,141 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,142 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,142 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,143 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,143 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,143 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,143 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,143 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,143 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,144 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,145 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,145 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,151 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:35,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 19:31:35,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:31:35,156 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:31:35,156 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:31:35,157 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:31:35,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:31:35,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:31:35,157 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:31:35,157 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:31:35,159 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 59 transitions [2019-12-27 19:31:35,159 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions [2019-12-27 19:31:35,191 INFO L132 PetriNetUnfolder]: 7/85 cut-off events. [2019-12-27 19:31:35,191 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 19:31:35,193 INFO L76 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2019-12-27 19:31:35,200 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions [2019-12-27 19:31:35,214 INFO L132 PetriNetUnfolder]: 7/85 cut-off events. [2019-12-27 19:31:35,214 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 19:31:35,216 INFO L76 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2019-12-27 19:31:35,219 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1656 [2019-12-27 19:31:35,219 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:31:35,866 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2078 [2019-12-27 19:31:35,867 INFO L214 etLargeBlockEncoding]: Total number of compositions: 45 [2019-12-27 19:31:35,867 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 17 transitions [2019-12-27 19:31:35,898 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 404 states. [2019-12-27 19:31:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states. [2019-12-27 19:31:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:31:35,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:35,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:31:35,900 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:35,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash 353939392, now seen corresponding path program 1 times [2019-12-27 19:31:35,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:35,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151836585] [2019-12-27 19:31:35,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:35,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151836585] [2019-12-27 19:31:35,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:35,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:35,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369240386] [2019-12-27 19:31:35,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:35,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:35,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:31:35,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:35,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:35,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:35,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:35,943 INFO L87 Difference]: Start difference. First operand 404 states. Second operand 3 states. [2019-12-27 19:31:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:36,003 INFO L93 Difference]: Finished difference Result 447 states and 1247 transitions. [2019-12-27 19:31:36,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:36,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 19:31:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:36,010 INFO L225 Difference]: With dead ends: 447 [2019-12-27 19:31:36,010 INFO L226 Difference]: Without dead ends: 447 [2019-12-27 19:31:36,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-27 19:31:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 378. [2019-12-27 19:31:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-27 19:31:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1099 transitions. [2019-12-27 19:31:36,053 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1099 transitions. Word has length 5 [2019-12-27 19:31:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:36,053 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 1099 transitions. [2019-12-27 19:31:36,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1099 transitions. [2019-12-27 19:31:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:31:36,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:36,054 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:36,054 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash -36478308, now seen corresponding path program 1 times [2019-12-27 19:31:36,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:36,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235282887] [2019-12-27 19:31:36,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:36,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235282887] [2019-12-27 19:31:36,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:36,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:36,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305154331] [2019-12-27 19:31:36,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:36,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:36,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 19:31:36,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:36,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:36,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:36,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:36,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:36,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:36,079 INFO L87 Difference]: Start difference. First operand 378 states and 1099 transitions. Second operand 3 states. [2019-12-27 19:31:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:36,108 INFO L93 Difference]: Finished difference Result 486 states and 1356 transitions. [2019-12-27 19:31:36,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:36,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 19:31:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:36,116 INFO L225 Difference]: With dead ends: 486 [2019-12-27 19:31:36,116 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 19:31:36,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 19:31:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 412. [2019-12-27 19:31:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-27 19:31:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1196 transitions. [2019-12-27 19:31:36,148 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1196 transitions. Word has length 8 [2019-12-27 19:31:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:36,148 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 1196 transitions. [2019-12-27 19:31:36,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1196 transitions. [2019-12-27 19:31:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:36,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:36,149 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:36,149 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:36,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1917227077, now seen corresponding path program 1 times [2019-12-27 19:31:36,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:36,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758832747] [2019-12-27 19:31:36,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:36,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758832747] [2019-12-27 19:31:36,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:36,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:36,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1818294862] [2019-12-27 19:31:36,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:36,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:36,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:36,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:36,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:36,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:36,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:36,189 INFO L87 Difference]: Start difference. First operand 412 states and 1196 transitions. Second operand 4 states. [2019-12-27 19:31:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:36,230 INFO L93 Difference]: Finished difference Result 338 states and 962 transitions. [2019-12-27 19:31:36,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:36,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:36,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:36,237 INFO L225 Difference]: With dead ends: 338 [2019-12-27 19:31:36,237 INFO L226 Difference]: Without dead ends: 338 [2019-12-27 19:31:36,238 INFO L631 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-12-27 19:31:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-27 19:31:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 283. [2019-12-27 19:31:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-27 19:31:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 793 transitions. [2019-12-27 19:31:36,251 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 793 transitions. Word has length 9 [2019-12-27 19:31:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:36,252 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 793 transitions. [2019-12-27 19:31:36,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 793 transitions. [2019-12-27 19:31:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:36,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:36,253 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:36,253 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:36,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1130826520, now seen corresponding path program 1 times [2019-12-27 19:31:36,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:36,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749547963] [2019-12-27 19:31:36,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:36,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749547963] [2019-12-27 19:31:36,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:36,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:36,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957205800] [2019-12-27 19:31:36,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:36,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:36,282 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:36,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:36,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:36,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:36,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:36,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:36,283 INFO L87 Difference]: Start difference. First operand 283 states and 793 transitions. Second operand 4 states. [2019-12-27 19:31:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:36,311 INFO L93 Difference]: Finished difference Result 233 states and 641 transitions. [2019-12-27 19:31:36,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:36,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:36,314 INFO L225 Difference]: With dead ends: 233 [2019-12-27 19:31:36,314 INFO L226 Difference]: Without dead ends: 233 [2019-12-27 19:31:36,314 INFO L631 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-12-27 19:31:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-27 19:31:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 183. [2019-12-27 19:31:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-27 19:31:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 489 transitions. [2019-12-27 19:31:36,323 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 489 transitions. Word has length 9 [2019-12-27 19:31:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:36,323 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 489 transitions. [2019-12-27 19:31:36,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 489 transitions. [2019-12-27 19:31:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:31:36,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:36,324 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:36,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:36,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:36,325 INFO L82 PathProgramCache]: Analyzing trace with hash -197280631, now seen corresponding path program 1 times [2019-12-27 19:31:36,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:36,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895750613] [2019-12-27 19:31:36,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:31:36,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895750613] [2019-12-27 19:31:36,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:36,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:36,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507291233] [2019-12-27 19:31:36,346 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:36,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:36,348 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:31:36,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:36,348 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:36,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:36,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:36,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:36,350 INFO L87 Difference]: Start difference. First operand 183 states and 489 transitions. Second operand 3 states. [2019-12-27 19:31:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:36,375 INFO L93 Difference]: Finished difference Result 243 states and 634 transitions. [2019-12-27 19:31:36,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:36,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 19:31:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:36,378 INFO L225 Difference]: With dead ends: 243 [2019-12-27 19:31:36,378 INFO L226 Difference]: Without dead ends: 243 [2019-12-27 19:31:36,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-27 19:31:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2019-12-27 19:31:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-27 19:31:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 570 transitions. [2019-12-27 19:31:36,387 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 570 transitions. Word has length 11 [2019-12-27 19:31:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:36,388 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 570 transitions. [2019-12-27 19:31:36,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 570 transitions. [2019-12-27 19:31:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:31:36,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:36,390 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:36,390 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1820731179, now seen corresponding path program 1 times [2019-12-27 19:31:36,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:36,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240581052] [2019-12-27 19:31:36,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:31:36,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240581052] [2019-12-27 19:31:36,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:36,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:36,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1231494858] [2019-12-27 19:31:36,417 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:36,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:36,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 19 transitions. [2019-12-27 19:31:36,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:36,420 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:36,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:36,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:36,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:36,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:36,421 INFO L87 Difference]: Start difference. First operand 211 states and 570 transitions. Second operand 4 states. [2019-12-27 19:31:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:36,445 INFO L93 Difference]: Finished difference Result 179 states and 474 transitions. [2019-12-27 19:31:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:36,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 19:31:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:36,447 INFO L225 Difference]: With dead ends: 179 [2019-12-27 19:31:36,447 INFO L226 Difference]: Without dead ends: 179 [2019-12-27 19:31:36,448 INFO L631 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-12-27 19:31:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-27 19:31:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2019-12-27 19:31:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-27 19:31:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 378 transitions. [2019-12-27 19:31:36,453 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 378 transitions. Word has length 12 [2019-12-27 19:31:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:36,454 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 378 transitions. [2019-12-27 19:31:36,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 378 transitions. [2019-12-27 19:31:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:31:36,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:36,455 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-12-27 19:31:36,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1820837778, now seen corresponding path program 1 times [2019-12-27 19:31:36,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:36,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899989237] [2019-12-27 19:31:36,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:36,475 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:31:36,475 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:31:36,475 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:31:36,476 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 19:31:36,483 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,483 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,483 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,484 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,484 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,484 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,485 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,485 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,485 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,485 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,485 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,486 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,486 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,486 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,486 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,486 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,486 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,487 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,487 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,487 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,487 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,487 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,488 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,488 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,488 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,488 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,488 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,489 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,489 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,489 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,489 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,489 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,489 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,489 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,490 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,490 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,490 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,490 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,490 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,491 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,491 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,491 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,491 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,491 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,492 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,492 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,492 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,492 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,492 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,492 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,493 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,493 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,493 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,493 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,494 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,494 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,494 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,495 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,495 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,507 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,507 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,510 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,510 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,510 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,513 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,513 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,513 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,513 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,513 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,514 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:36,519 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:31:36,520 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:31:36,520 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:31:36,520 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:31:36,520 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:31:36,520 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:31:36,520 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:31:36,520 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:31:36,520 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:31:36,524 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 72 transitions [2019-12-27 19:31:36,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions [2019-12-27 19:31:36,552 INFO L132 PetriNetUnfolder]: 9/107 cut-off events. [2019-12-27 19:31:36,553 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 19:31:36,556 INFO L76 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2019-12-27 19:31:36,561 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions [2019-12-27 19:31:36,593 INFO L132 PetriNetUnfolder]: 9/107 cut-off events. [2019-12-27 19:31:36,594 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 19:31:36,596 INFO L76 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2019-12-27 19:31:36,601 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 19:31:36,601 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:31:37,368 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3472 [2019-12-27 19:31:37,369 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 19:31:37,369 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 23 transitions [2019-12-27 19:31:37,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2020 states. [2019-12-27 19:31:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states. [2019-12-27 19:31:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:31:37,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:37,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:31:37,462 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash 491318823, now seen corresponding path program 1 times [2019-12-27 19:31:37,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:37,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90213902] [2019-12-27 19:31:37,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:37,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90213902] [2019-12-27 19:31:37,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:37,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:37,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [507413669] [2019-12-27 19:31:37,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:37,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:37,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:31:37,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:37,482 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:37,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:37,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:37,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:37,483 INFO L87 Difference]: Start difference. First operand 2020 states. Second operand 3 states. [2019-12-27 19:31:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:37,539 INFO L93 Difference]: Finished difference Result 2352 states and 8424 transitions. [2019-12-27 19:31:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:37,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 19:31:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:37,560 INFO L225 Difference]: With dead ends: 2352 [2019-12-27 19:31:37,561 INFO L226 Difference]: Without dead ends: 2352 [2019-12-27 19:31:37,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2019-12-27 19:31:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1967. [2019-12-27 19:31:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 19:31:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7298 transitions. [2019-12-27 19:31:37,742 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7298 transitions. Word has length 5 [2019-12-27 19:31:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:37,742 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7298 transitions. [2019-12-27 19:31:37,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7298 transitions. [2019-12-27 19:31:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:31:37,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:37,743 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:37,744 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash -487037178, now seen corresponding path program 1 times [2019-12-27 19:31:37,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:37,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447009393] [2019-12-27 19:31:37,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:37,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447009393] [2019-12-27 19:31:37,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:37,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:37,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [931901801] [2019-12-27 19:31:37,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:37,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:37,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 19:31:37,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:37,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:37,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:37,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:37,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:37,768 INFO L87 Difference]: Start difference. First operand 1967 states and 7298 transitions. Second operand 3 states. [2019-12-27 19:31:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:37,858 INFO L93 Difference]: Finished difference Result 2953 states and 10780 transitions. [2019-12-27 19:31:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:37,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 19:31:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:37,894 INFO L225 Difference]: With dead ends: 2953 [2019-12-27 19:31:37,895 INFO L226 Difference]: Without dead ends: 2953 [2019-12-27 19:31:37,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2019-12-27 19:31:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2223. [2019-12-27 19:31:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-12-27 19:31:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 8283 transitions. [2019-12-27 19:31:38,024 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 8283 transitions. Word has length 8 [2019-12-27 19:31:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:38,025 INFO L462 AbstractCegarLoop]: Abstraction has 2223 states and 8283 transitions. [2019-12-27 19:31:38,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 8283 transitions. [2019-12-27 19:31:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:38,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:38,025 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:38,026 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1358722116, now seen corresponding path program 1 times [2019-12-27 19:31:38,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:38,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615438060] [2019-12-27 19:31:38,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:38,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615438060] [2019-12-27 19:31:38,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:38,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:38,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1596328319] [2019-12-27 19:31:38,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:38,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:38,073 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:38,073 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:38,073 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:38,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:38,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:38,075 INFO L87 Difference]: Start difference. First operand 2223 states and 8283 transitions. Second operand 4 states. [2019-12-27 19:31:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:38,133 INFO L93 Difference]: Finished difference Result 1779 states and 6526 transitions. [2019-12-27 19:31:38,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:38,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:38,149 INFO L225 Difference]: With dead ends: 1779 [2019-12-27 19:31:38,149 INFO L226 Difference]: Without dead ends: 1779 [2019-12-27 19:31:38,150 INFO L631 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-12-27 19:31:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-27 19:31:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1414. [2019-12-27 19:31:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-27 19:31:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 5095 transitions. [2019-12-27 19:31:38,216 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 5095 transitions. Word has length 9 [2019-12-27 19:31:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:38,216 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 5095 transitions. [2019-12-27 19:31:38,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 5095 transitions. [2019-12-27 19:31:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:38,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:38,217 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:38,218 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2081718434, now seen corresponding path program 1 times [2019-12-27 19:31:38,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:38,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053462337] [2019-12-27 19:31:38,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:38,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053462337] [2019-12-27 19:31:38,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:38,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:38,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1692461850] [2019-12-27 19:31:38,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:38,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:38,256 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:38,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:38,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:38,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:38,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:38,258 INFO L87 Difference]: Start difference. First operand 1414 states and 5095 transitions. Second operand 4 states. [2019-12-27 19:31:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:38,305 INFO L93 Difference]: Finished difference Result 1187 states and 4236 transitions. [2019-12-27 19:31:38,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:38,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:38,315 INFO L225 Difference]: With dead ends: 1187 [2019-12-27 19:31:38,316 INFO L226 Difference]: Without dead ends: 1187 [2019-12-27 19:31:38,316 INFO L631 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-12-27 19:31:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-12-27 19:31:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 960. [2019-12-27 19:31:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-27 19:31:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 3377 transitions. [2019-12-27 19:31:38,356 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 3377 transitions. Word has length 9 [2019-12-27 19:31:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:38,356 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 3377 transitions. [2019-12-27 19:31:38,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 3377 transitions. [2019-12-27 19:31:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:31:38,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:38,357 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:38,357 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1050664949, now seen corresponding path program 1 times [2019-12-27 19:31:38,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:38,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348818392] [2019-12-27 19:31:38,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:31:38,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348818392] [2019-12-27 19:31:38,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:38,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:38,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099399949] [2019-12-27 19:31:38,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:38,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:38,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:31:38,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:38,384 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:38,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:38,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:38,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:38,385 INFO L87 Difference]: Start difference. First operand 960 states and 3377 transitions. Second operand 3 states. [2019-12-27 19:31:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:38,431 INFO L93 Difference]: Finished difference Result 1395 states and 4813 transitions. [2019-12-27 19:31:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:38,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 19:31:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:38,445 INFO L225 Difference]: With dead ends: 1395 [2019-12-27 19:31:38,445 INFO L226 Difference]: Without dead ends: 1395 [2019-12-27 19:31:38,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2019-12-27 19:31:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1174. [2019-12-27 19:31:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-12-27 19:31:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4190 transitions. [2019-12-27 19:31:38,572 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4190 transitions. Word has length 11 [2019-12-27 19:31:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:38,572 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 4190 transitions. [2019-12-27 19:31:38,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4190 transitions. [2019-12-27 19:31:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:31:38,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:38,573 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:38,573 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:38,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1789126636, now seen corresponding path program 1 times [2019-12-27 19:31:38,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:38,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48338416] [2019-12-27 19:31:38,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:31:38,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48338416] [2019-12-27 19:31:38,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:38,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:38,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38077284] [2019-12-27 19:31:38,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:38,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:38,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 19 transitions. [2019-12-27 19:31:38,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:38,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:38,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:38,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:38,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:38,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:38,607 INFO L87 Difference]: Start difference. First operand 1174 states and 4190 transitions. Second operand 4 states. [2019-12-27 19:31:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:38,652 INFO L93 Difference]: Finished difference Result 953 states and 3346 transitions. [2019-12-27 19:31:38,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:38,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 19:31:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:38,673 INFO L225 Difference]: With dead ends: 953 [2019-12-27 19:31:38,673 INFO L226 Difference]: Without dead ends: 953 [2019-12-27 19:31:38,673 INFO L631 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-12-27 19:31:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-12-27 19:31:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 732. [2019-12-27 19:31:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-12-27 19:31:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2502 transitions. [2019-12-27 19:31:38,701 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2502 transitions. Word has length 12 [2019-12-27 19:31:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:38,702 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 2502 transitions. [2019-12-27 19:31:38,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2502 transitions. [2019-12-27 19:31:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:31:38,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:38,703 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:38,703 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1243568347, now seen corresponding path program 1 times [2019-12-27 19:31:38,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:38,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588431197] [2019-12-27 19:31:38,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:31:38,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588431197] [2019-12-27 19:31:38,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:38,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:38,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810977565] [2019-12-27 19:31:38,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:38,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:38,733 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:31:38,733 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:38,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:38,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:38,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:38,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:38,736 INFO L87 Difference]: Start difference. First operand 732 states and 2502 transitions. Second operand 3 states. [2019-12-27 19:31:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:38,778 INFO L93 Difference]: Finished difference Result 1008 states and 3409 transitions. [2019-12-27 19:31:38,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:38,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 19:31:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:38,790 INFO L225 Difference]: With dead ends: 1008 [2019-12-27 19:31:38,791 INFO L226 Difference]: Without dead ends: 1008 [2019-12-27 19:31:38,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-27 19:31:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 868. [2019-12-27 19:31:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-27 19:31:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 3016 transitions. [2019-12-27 19:31:38,822 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 3016 transitions. Word has length 14 [2019-12-27 19:31:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:38,823 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 3016 transitions. [2019-12-27 19:31:38,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 3016 transitions. [2019-12-27 19:31:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:31:38,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:38,824 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:38,824 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -104085370, now seen corresponding path program 1 times [2019-12-27 19:31:38,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:38,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071149255] [2019-12-27 19:31:38,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:31:38,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071149255] [2019-12-27 19:31:38,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:38,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:38,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498914386] [2019-12-27 19:31:38,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:38,863 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:38,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 19:31:38,866 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:38,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:38,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:38,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:38,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:38,868 INFO L87 Difference]: Start difference. First operand 868 states and 3016 transitions. Second operand 4 states. [2019-12-27 19:31:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:38,902 INFO L93 Difference]: Finished difference Result 728 states and 2483 transitions. [2019-12-27 19:31:38,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:38,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 19:31:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:38,912 INFO L225 Difference]: With dead ends: 728 [2019-12-27 19:31:38,913 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 19:31:38,913 INFO L631 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-12-27 19:31:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 19:31:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 588. [2019-12-27 19:31:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-27 19:31:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1950 transitions. [2019-12-27 19:31:38,933 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1950 transitions. Word has length 15 [2019-12-27 19:31:38,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:38,933 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1950 transitions. [2019-12-27 19:31:38,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1950 transitions. [2019-12-27 19:31:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:31:38,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:38,935 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:38,935 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:31:38,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:38,936 INFO L82 PathProgramCache]: Analyzing trace with hash -104215289, now seen corresponding path program 1 times [2019-12-27 19:31:38,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:38,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639991826] [2019-12-27 19:31:38,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:38,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:31:38,969 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:31:38,969 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:31:38,970 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 19:31:38,979 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,980 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,980 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,980 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,990 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,992 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,992 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,995 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,995 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,995 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,995 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,995 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,996 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,997 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,997 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,997 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,997 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,998 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,998 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,999 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:38,999 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,000 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,000 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,000 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,000 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:39,004 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 19:31:39,004 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:31:39,004 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:31:39,004 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:31:39,005 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:31:39,005 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:31:39,005 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:31:39,005 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:31:39,005 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:31:39,006 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions [2019-12-27 19:31:39,006 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions [2019-12-27 19:31:39,027 INFO L132 PetriNetUnfolder]: 11/129 cut-off events. [2019-12-27 19:31:39,028 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 19:31:39,030 INFO L76 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-27 19:31:39,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions [2019-12-27 19:31:39,055 INFO L132 PetriNetUnfolder]: 11/129 cut-off events. [2019-12-27 19:31:39,055 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 19:31:39,057 INFO L76 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-27 19:31:39,065 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4320 [2019-12-27 19:31:39,065 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:31:39,953 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5838 [2019-12-27 19:31:39,953 INFO L214 etLargeBlockEncoding]: Total number of compositions: 65 [2019-12-27 19:31:39,954 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 25 transitions [2019-12-27 19:31:40,353 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6484 states. [2019-12-27 19:31:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states. [2019-12-27 19:31:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:31:40,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:40,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:31:40,354 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 652705188, now seen corresponding path program 1 times [2019-12-27 19:31:40,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:40,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415517427] [2019-12-27 19:31:40,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:40,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415517427] [2019-12-27 19:31:40,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:40,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:40,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123582743] [2019-12-27 19:31:40,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:40,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:40,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:31:40,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:40,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:40,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:40,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:40,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:40,369 INFO L87 Difference]: Start difference. First operand 6484 states. Second operand 3 states. [2019-12-27 19:31:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:40,472 INFO L93 Difference]: Finished difference Result 7629 states and 32588 transitions. [2019-12-27 19:31:40,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:40,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 19:31:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:40,513 INFO L225 Difference]: With dead ends: 7629 [2019-12-27 19:31:40,514 INFO L226 Difference]: Without dead ends: 7629 [2019-12-27 19:31:40,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7629 states. [2019-12-27 19:31:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7629 to 6366. [2019-12-27 19:31:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6366 states. [2019-12-27 19:31:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6366 states to 6366 states and 28029 transitions. [2019-12-27 19:31:40,980 INFO L78 Accepts]: Start accepts. Automaton has 6366 states and 28029 transitions. Word has length 5 [2019-12-27 19:31:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:40,980 INFO L462 AbstractCegarLoop]: Abstraction has 6366 states and 28029 transitions. [2019-12-27 19:31:40,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6366 states and 28029 transitions. [2019-12-27 19:31:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:31:40,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:40,981 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:40,982 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:40,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:40,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1277107584, now seen corresponding path program 1 times [2019-12-27 19:31:40,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:40,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813779360] [2019-12-27 19:31:40,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:41,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813779360] [2019-12-27 19:31:41,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:41,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:41,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2004424469] [2019-12-27 19:31:41,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:41,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:41,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 19:31:41,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:41,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:41,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:41,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:41,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:41,022 INFO L87 Difference]: Start difference. First operand 6366 states and 28029 transitions. Second operand 3 states. [2019-12-27 19:31:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:41,152 INFO L93 Difference]: Finished difference Result 9120 states and 39254 transitions. [2019-12-27 19:31:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:41,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 19:31:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:41,216 INFO L225 Difference]: With dead ends: 9120 [2019-12-27 19:31:41,216 INFO L226 Difference]: Without dead ends: 9120 [2019-12-27 19:31:41,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2019-12-27 19:31:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 7564. [2019-12-27 19:31:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-12-27 19:31:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 33556 transitions. [2019-12-27 19:31:42,171 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 33556 transitions. Word has length 8 [2019-12-27 19:31:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:42,172 INFO L462 AbstractCegarLoop]: Abstraction has 7564 states and 33556 transitions. [2019-12-27 19:31:42,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 33556 transitions. [2019-12-27 19:31:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:42,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:42,174 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:42,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash 935631175, now seen corresponding path program 1 times [2019-12-27 19:31:42,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:42,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602730448] [2019-12-27 19:31:42,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:42,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602730448] [2019-12-27 19:31:42,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:42,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:42,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373208544] [2019-12-27 19:31:42,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:42,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:42,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:42,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:42,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:42,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:42,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:42,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:42,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:42,204 INFO L87 Difference]: Start difference. First operand 7564 states and 33556 transitions. Second operand 4 states. [2019-12-27 19:31:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:42,282 INFO L93 Difference]: Finished difference Result 6008 states and 26302 transitions. [2019-12-27 19:31:42,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:42,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:42,311 INFO L225 Difference]: With dead ends: 6008 [2019-12-27 19:31:42,311 INFO L226 Difference]: Without dead ends: 6008 [2019-12-27 19:31:42,311 INFO L631 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-12-27 19:31:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2019-12-27 19:31:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 4771. [2019-12-27 19:31:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-12-27 19:31:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 20598 transitions. [2019-12-27 19:31:42,615 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 20598 transitions. Word has length 9 [2019-12-27 19:31:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:42,616 INFO L462 AbstractCegarLoop]: Abstraction has 4771 states and 20598 transitions. [2019-12-27 19:31:42,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 20598 transitions. [2019-12-27 19:31:42,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:42,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:42,616 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:42,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash 935633007, now seen corresponding path program 1 times [2019-12-27 19:31:42,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:42,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124304646] [2019-12-27 19:31:42,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:42,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124304646] [2019-12-27 19:31:42,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:42,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:42,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643615575] [2019-12-27 19:31:42,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:42,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:42,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:42,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:42,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:31:42,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:42,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:42,649 INFO L87 Difference]: Start difference. First operand 4771 states and 20598 transitions. Second operand 4 states. [2019-12-27 19:31:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:42,710 INFO L93 Difference]: Finished difference Result 3827 states and 16326 transitions. [2019-12-27 19:31:42,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:42,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:42,727 INFO L225 Difference]: With dead ends: 3827 [2019-12-27 19:31:42,727 INFO L226 Difference]: Without dead ends: 3827 [2019-12-27 19:31:42,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-12-27 19:31:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2019-12-27 19:31:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2883. [2019-12-27 19:31:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-12-27 19:31:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 12054 transitions. [2019-12-27 19:31:42,846 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 12054 transitions. Word has length 9 [2019-12-27 19:31:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:42,846 INFO L462 AbstractCegarLoop]: Abstraction has 2883 states and 12054 transitions. [2019-12-27 19:31:42,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 12054 transitions. [2019-12-27 19:31:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:31:42,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:42,847 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:42,847 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:42,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1346541726, now seen corresponding path program 1 times [2019-12-27 19:31:42,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:42,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737193870] [2019-12-27 19:31:42,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:31:42,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737193870] [2019-12-27 19:31:42,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:42,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:42,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470850840] [2019-12-27 19:31:42,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:42,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:42,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:31:42,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:42,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:42,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:42,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:42,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:42,871 INFO L87 Difference]: Start difference. First operand 2883 states and 12054 transitions. Second operand 3 states. [2019-12-27 19:31:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:42,927 INFO L93 Difference]: Finished difference Result 4275 states and 17545 transitions. [2019-12-27 19:31:42,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:42,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 19:31:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:42,946 INFO L225 Difference]: With dead ends: 4275 [2019-12-27 19:31:42,946 INFO L226 Difference]: Without dead ends: 4275 [2019-12-27 19:31:42,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-12-27 19:31:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3574. [2019-12-27 19:31:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-12-27 19:31:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 15125 transitions. [2019-12-27 19:31:43,056 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 15125 transitions. Word has length 11 [2019-12-27 19:31:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:43,056 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 15125 transitions. [2019-12-27 19:31:43,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 15125 transitions. [2019-12-27 19:31:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:31:43,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:43,057 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:43,057 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1206877661, now seen corresponding path program 1 times [2019-12-27 19:31:43,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:43,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095423578] [2019-12-27 19:31:43,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:31:43,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095423578] [2019-12-27 19:31:43,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:43,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:43,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [552226728] [2019-12-27 19:31:43,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:43,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:43,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 19 transitions. [2019-12-27 19:31:43,084 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:43,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:43,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:43,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:43,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:43,085 INFO L87 Difference]: Start difference. First operand 3574 states and 15125 transitions. Second operand 4 states. [2019-12-27 19:31:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:43,135 INFO L93 Difference]: Finished difference Result 2873 states and 12004 transitions. [2019-12-27 19:31:43,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:43,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 19:31:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:43,149 INFO L225 Difference]: With dead ends: 2873 [2019-12-27 19:31:43,150 INFO L226 Difference]: Without dead ends: 2873 [2019-12-27 19:31:43,150 INFO L631 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-12-27 19:31:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2019-12-27 19:31:43,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2172. [2019-12-27 19:31:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2019-12-27 19:31:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 8883 transitions. [2019-12-27 19:31:43,214 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 8883 transitions. Word has length 12 [2019-12-27 19:31:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:43,214 INFO L462 AbstractCegarLoop]: Abstraction has 2172 states and 8883 transitions. [2019-12-27 19:31:43,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 8883 transitions. [2019-12-27 19:31:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:31:43,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:43,215 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:43,215 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:43,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:43,216 INFO L82 PathProgramCache]: Analyzing trace with hash -315974263, now seen corresponding path program 1 times [2019-12-27 19:31:43,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:43,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459168327] [2019-12-27 19:31:43,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:31:43,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459168327] [2019-12-27 19:31:43,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:43,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:43,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378351317] [2019-12-27 19:31:43,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:43,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:43,233 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:31:43,233 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:43,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:43,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:43,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:43,234 INFO L87 Difference]: Start difference. First operand 2172 states and 8883 transitions. Second operand 3 states. [2019-12-27 19:31:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:43,277 INFO L93 Difference]: Finished difference Result 3177 states and 12799 transitions. [2019-12-27 19:31:43,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:43,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 19:31:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:43,289 INFO L225 Difference]: With dead ends: 3177 [2019-12-27 19:31:43,290 INFO L226 Difference]: Without dead ends: 3177 [2019-12-27 19:31:43,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2019-12-27 19:31:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2671. [2019-12-27 19:31:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2019-12-27 19:31:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 11075 transitions. [2019-12-27 19:31:43,376 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 11075 transitions. Word has length 14 [2019-12-27 19:31:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:43,376 INFO L462 AbstractCegarLoop]: Abstraction has 2671 states and 11075 transitions. [2019-12-27 19:31:43,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 11075 transitions. [2019-12-27 19:31:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:31:43,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:43,378 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:43,378 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:43,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:43,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1205265918, now seen corresponding path program 1 times [2019-12-27 19:31:43,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:43,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316475567] [2019-12-27 19:31:43,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:31:43,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316475567] [2019-12-27 19:31:43,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:43,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:43,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1726095194] [2019-12-27 19:31:43,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:43,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:43,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 19:31:43,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:43,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:43,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:43,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:43,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:43,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:43,407 INFO L87 Difference]: Start difference. First operand 2671 states and 11075 transitions. Second operand 4 states. [2019-12-27 19:31:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:43,523 INFO L93 Difference]: Finished difference Result 2165 states and 8845 transitions. [2019-12-27 19:31:43,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:43,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 19:31:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:43,532 INFO L225 Difference]: With dead ends: 2165 [2019-12-27 19:31:43,533 INFO L226 Difference]: Without dead ends: 2165 [2019-12-27 19:31:43,533 INFO L631 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-12-27 19:31:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2019-12-27 19:31:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1659. [2019-12-27 19:31:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-12-27 19:31:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 6615 transitions. [2019-12-27 19:31:43,587 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 6615 transitions. Word has length 15 [2019-12-27 19:31:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:43,587 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 6615 transitions. [2019-12-27 19:31:43,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 6615 transitions. [2019-12-27 19:31:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:31:43,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:43,589 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:43,589 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1240295411, now seen corresponding path program 1 times [2019-12-27 19:31:43,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:43,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798508129] [2019-12-27 19:31:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 19:31:43,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798508129] [2019-12-27 19:31:43,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:43,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:43,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079635861] [2019-12-27 19:31:43,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:43,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:43,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:31:43,610 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:43,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:43,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:43,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:43,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:43,611 INFO L87 Difference]: Start difference. First operand 1659 states and 6615 transitions. Second operand 3 states. [2019-12-27 19:31:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:43,649 INFO L93 Difference]: Finished difference Result 2295 states and 9088 transitions. [2019-12-27 19:31:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:43,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 19:31:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:43,659 INFO L225 Difference]: With dead ends: 2295 [2019-12-27 19:31:43,659 INFO L226 Difference]: Without dead ends: 2295 [2019-12-27 19:31:43,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-12-27 19:31:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1975. [2019-12-27 19:31:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-27 19:31:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 8000 transitions. [2019-12-27 19:31:43,711 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 8000 transitions. Word has length 17 [2019-12-27 19:31:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:43,711 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 8000 transitions. [2019-12-27 19:31:43,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 8000 transitions. [2019-12-27 19:31:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:31:43,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:43,714 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:43,714 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:43,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:43,714 INFO L82 PathProgramCache]: Analyzing trace with hash -205702466, now seen corresponding path program 1 times [2019-12-27 19:31:43,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:43,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288123985] [2019-12-27 19:31:43,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:31:43,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:31:43,734 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:31:43,734 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:31:43,734 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 19:31:43,744 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,745 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,745 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,745 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,745 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,746 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,746 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,746 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,747 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,747 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,747 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,747 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,748 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,748 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,749 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,749 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,749 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,749 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,749 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,750 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,750 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,752 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,752 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,752 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,752 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,752 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,752 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,753 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,753 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,753 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,754 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,754 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,754 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,754 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,754 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,754 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,754 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,755 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,755 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,755 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,755 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,755 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,755 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,756 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,756 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,757 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,757 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,757 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,757 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,757 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,757 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,757 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,770 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,770 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,770 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,770 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,771 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,771 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,773 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,773 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,773 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,773 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,774 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,774 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:31:43,775 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 19:31:43,776 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:31:43,776 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:31:43,776 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:31:43,776 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:31:43,776 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:31:43,776 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:31:43,777 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:31:43,777 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:31:43,778 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 98 transitions [2019-12-27 19:31:43,778 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions [2019-12-27 19:31:43,804 INFO L132 PetriNetUnfolder]: 13/151 cut-off events. [2019-12-27 19:31:43,804 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 19:31:43,807 INFO L76 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-27 19:31:43,819 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions [2019-12-27 19:31:43,840 INFO L132 PetriNetUnfolder]: 13/151 cut-off events. [2019-12-27 19:31:43,840 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 19:31:43,844 INFO L76 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-27 19:31:43,854 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 6120 [2019-12-27 19:31:43,854 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:31:44,731 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8349 [2019-12-27 19:31:44,731 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2019-12-27 19:31:44,731 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 31 transitions [2019-12-27 19:31:48,415 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32404 states. [2019-12-27 19:31:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 32404 states. [2019-12-27 19:31:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:31:48,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:48,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:31:48,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash 837410524, now seen corresponding path program 1 times [2019-12-27 19:31:48,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:48,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955088844] [2019-12-27 19:31:48,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:48,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955088844] [2019-12-27 19:31:48,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:48,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:48,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995289436] [2019-12-27 19:31:48,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:48,429 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:48,430 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:31:48,430 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:48,430 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:48,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:48,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:48,431 INFO L87 Difference]: Start difference. First operand 32404 states. Second operand 3 states. [2019-12-27 19:31:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:48,898 INFO L93 Difference]: Finished difference Result 38316 states and 194259 transitions. [2019-12-27 19:31:48,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:48,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 19:31:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:49,080 INFO L225 Difference]: With dead ends: 38316 [2019-12-27 19:31:49,081 INFO L226 Difference]: Without dead ends: 38316 [2019-12-27 19:31:49,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38316 states. [2019-12-27 19:31:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38316 to 31940. [2019-12-27 19:31:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31940 states. [2019-12-27 19:31:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31940 states to 31940 states and 166174 transitions. [2019-12-27 19:31:51,803 INFO L78 Accepts]: Start accepts. Automaton has 31940 states and 166174 transitions. Word has length 5 [2019-12-27 19:31:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:51,803 INFO L462 AbstractCegarLoop]: Abstraction has 31940 states and 166174 transitions. [2019-12-27 19:31:51,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 31940 states and 166174 transitions. [2019-12-27 19:31:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:31:51,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:51,804 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:51,804 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1966218909, now seen corresponding path program 1 times [2019-12-27 19:31:51,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:51,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134141213] [2019-12-27 19:31:51,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:51,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134141213] [2019-12-27 19:31:51,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:51,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:51,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883701457] [2019-12-27 19:31:51,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:51,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:51,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 19:31:51,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:51,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:51,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:51,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:51,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:51,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:51,824 INFO L87 Difference]: Start difference. First operand 31940 states and 166174 transitions. Second operand 3 states. [2019-12-27 19:31:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:52,106 INFO L93 Difference]: Finished difference Result 46178 states and 235622 transitions. [2019-12-27 19:31:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:52,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 19:31:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:52,301 INFO L225 Difference]: With dead ends: 46178 [2019-12-27 19:31:52,301 INFO L226 Difference]: Without dead ends: 46178 [2019-12-27 19:31:52,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:31:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46178 states. [2019-12-27 19:31:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46178 to 38236. [2019-12-27 19:31:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38236 states. [2019-12-27 19:31:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38236 states to 38236 states and 200230 transitions. [2019-12-27 19:31:55,934 INFO L78 Accepts]: Start accepts. Automaton has 38236 states and 200230 transitions. Word has length 8 [2019-12-27 19:31:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:55,935 INFO L462 AbstractCegarLoop]: Abstraction has 38236 states and 200230 transitions. [2019-12-27 19:31:55,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:31:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 38236 states and 200230 transitions. [2019-12-27 19:31:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:55,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:55,935 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:55,935 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1411123806, now seen corresponding path program 1 times [2019-12-27 19:31:55,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:55,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938724141] [2019-12-27 19:31:55,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:31:55,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938724141] [2019-12-27 19:31:55,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:55,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:55,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289485582] [2019-12-27 19:31:55,966 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:55,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:55,967 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:55,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:55,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:55,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:55,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:55,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:55,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:55,969 INFO L87 Difference]: Start difference. First operand 38236 states and 200230 transitions. Second operand 4 states. [2019-12-27 19:31:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:56,284 INFO L93 Difference]: Finished difference Result 30294 states and 156896 transitions. [2019-12-27 19:31:56,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:56,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:57,074 INFO L225 Difference]: With dead ends: 30294 [2019-12-27 19:31:57,074 INFO L226 Difference]: Without dead ends: 30294 [2019-12-27 19:31:57,074 INFO L631 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-12-27 19:31:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30294 states. [2019-12-27 19:31:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30294 to 23950. [2019-12-27 19:31:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23950 states. [2019-12-27 19:31:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23950 states to 23950 states and 122597 transitions. [2019-12-27 19:31:57,805 INFO L78 Accepts]: Start accepts. Automaton has 23950 states and 122597 transitions. Word has length 9 [2019-12-27 19:31:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:57,806 INFO L462 AbstractCegarLoop]: Abstraction has 23950 states and 122597 transitions. [2019-12-27 19:31:57,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 23950 states and 122597 transitions. [2019-12-27 19:31:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:31:57,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:57,807 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:57,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 823246975, now seen corresponding path program 1 times [2019-12-27 19:31:57,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:57,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081704642] [2019-12-27 19:31:57,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:31:57,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081704642] [2019-12-27 19:31:57,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:57,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:31:57,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810380954] [2019-12-27 19:31:57,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:57,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:57,836 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:31:57,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:57,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:57,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:31:57,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:57,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:31:57,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:31:57,838 INFO L87 Difference]: Start difference. First operand 23950 states and 122597 transitions. Second operand 4 states. [2019-12-27 19:31:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:59,097 INFO L93 Difference]: Finished difference Result 19172 states and 97171 transitions. [2019-12-27 19:31:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:59,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:31:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:59,158 INFO L225 Difference]: With dead ends: 19172 [2019-12-27 19:31:59,158 INFO L226 Difference]: Without dead ends: 19172 [2019-12-27 19:31:59,158 INFO L631 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-12-27 19:31:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19172 states. [2019-12-27 19:31:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19172 to 14394. [2019-12-27 19:31:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14394 states. [2019-12-27 19:31:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14394 states to 14394 states and 71745 transitions. [2019-12-27 19:31:59,561 INFO L78 Accepts]: Start accepts. Automaton has 14394 states and 71745 transitions. Word has length 9 [2019-12-27 19:31:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:31:59,561 INFO L462 AbstractCegarLoop]: Abstraction has 14394 states and 71745 transitions. [2019-12-27 19:31:59,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:31:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 14394 states and 71745 transitions. [2019-12-27 19:31:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:31:59,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:31:59,562 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:31:59,562 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:31:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:31:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash 697229360, now seen corresponding path program 1 times [2019-12-27 19:31:59,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:31:59,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691205699] [2019-12-27 19:31:59,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:31:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:31:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:31:59,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691205699] [2019-12-27 19:31:59,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:31:59,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:31:59,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1920899227] [2019-12-27 19:31:59,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:31:59,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:31:59,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:31:59,579 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:31:59,579 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:31:59,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:31:59,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:31:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:31:59,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:31:59,580 INFO L87 Difference]: Start difference. First operand 14394 states and 71745 transitions. Second operand 3 states. [2019-12-27 19:31:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:31:59,742 INFO L93 Difference]: Finished difference Result 22955 states and 113320 transitions. [2019-12-27 19:31:59,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:31:59,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 19:31:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:31:59,804 INFO L225 Difference]: With dead ends: 22955 [2019-12-27 19:31:59,804 INFO L226 Difference]: Without dead ends: 22955 [2019-12-27 19:31:59,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:32:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22955 states. [2019-12-27 19:32:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22955 to 17239. [2019-12-27 19:32:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17239 states. [2019-12-27 19:32:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17239 states to 17239 states and 86508 transitions. [2019-12-27 19:32:00,614 INFO L78 Accepts]: Start accepts. Automaton has 17239 states and 86508 transitions. Word has length 11 [2019-12-27 19:32:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:32:00,614 INFO L462 AbstractCegarLoop]: Abstraction has 17239 states and 86508 transitions. [2019-12-27 19:32:00,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:32:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 17239 states and 86508 transitions. [2019-12-27 19:32:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:32:00,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:32:00,615 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:32:00,615 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:32:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:32:00,615 INFO L82 PathProgramCache]: Analyzing trace with hash 139276080, now seen corresponding path program 1 times [2019-12-27 19:32:00,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:32:00,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74446423] [2019-12-27 19:32:00,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:32:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:32:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:32:00,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74446423] [2019-12-27 19:32:00,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:32:00,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:32:00,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848511391] [2019-12-27 19:32:00,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:32:00,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:32:00,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 25 transitions. [2019-12-27 19:32:00,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:32:00,635 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:32:00,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:32:00,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:32:00,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:32:00,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:32:00,636 INFO L87 Difference]: Start difference. First operand 17239 states and 86508 transitions. Second operand 4 states. [2019-12-27 19:32:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:32:00,786 INFO L93 Difference]: Finished difference Result 14381 states and 71673 transitions. [2019-12-27 19:32:00,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:32:00,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 19:32:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:32:00,839 INFO L225 Difference]: With dead ends: 14381 [2019-12-27 19:32:00,839 INFO L226 Difference]: Without dead ends: 14381 [2019-12-27 19:32:00,840 INFO L631 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-12-27 19:32:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14381 states. [2019-12-27 19:32:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14381 to 11523. [2019-12-27 19:32:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11523 states. [2019-12-27 19:32:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11523 states to 11523 states and 56838 transitions. [2019-12-27 19:32:01,153 INFO L78 Accepts]: Start accepts. Automaton has 11523 states and 56838 transitions. Word has length 12 [2019-12-27 19:32:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:32:01,153 INFO L462 AbstractCegarLoop]: Abstraction has 11523 states and 56838 transitions. [2019-12-27 19:32:01,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:32:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11523 states and 56838 transitions. [2019-12-27 19:32:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:32:01,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:32:01,154 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:32:01,154 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:32:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:32:01,155 INFO L82 PathProgramCache]: Analyzing trace with hash 533949827, now seen corresponding path program 1 times [2019-12-27 19:32:01,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:32:01,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881368886] [2019-12-27 19:32:01,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:32:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:32:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:32:01,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881368886] [2019-12-27 19:32:01,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:32:01,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:32:01,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2143407055] [2019-12-27 19:32:01,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:32:01,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:32:01,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:32:01,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:32:01,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:32:01,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:32:01,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:32:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:32:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:32:01,173 INFO L87 Difference]: Start difference. First operand 11523 states and 56838 transitions. Second operand 3 states. [2019-12-27 19:32:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:32:01,335 INFO L93 Difference]: Finished difference Result 17181 states and 83458 transitions. [2019-12-27 19:32:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:32:01,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 19:32:01,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:32:01,378 INFO L225 Difference]: With dead ends: 17181 [2019-12-27 19:32:01,379 INFO L226 Difference]: Without dead ends: 17181 [2019-12-27 19:32:01,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:32:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17181 states. [2019-12-27 19:32:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17181 to 14347. [2019-12-27 19:32:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-27 19:32:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 71535 transitions. [2019-12-27 19:32:01,922 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 71535 transitions. Word has length 14 [2019-12-27 19:32:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:32:01,922 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 71535 transitions. [2019-12-27 19:32:01,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:32:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 71535 transitions. [2019-12-27 19:32:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:32:01,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:32:01,923 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:32:01,923 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:32:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:32:01,923 INFO L82 PathProgramCache]: Analyzing trace with hash -627421727, now seen corresponding path program 1 times [2019-12-27 19:32:01,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:32:01,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047931524] [2019-12-27 19:32:01,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:32:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:32:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:32:01,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047931524] [2019-12-27 19:32:01,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:32:01,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:32:01,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1027711541] [2019-12-27 19:32:01,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:32:01,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:32:01,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 34 transitions. [2019-12-27 19:32:01,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:32:01,949 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:32:01,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:32:01,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:32:01,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:32:01,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:32:01,950 INFO L87 Difference]: Start difference. First operand 14347 states and 71535 transitions. Second operand 4 states. [2019-12-27 19:32:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:32:02,075 INFO L93 Difference]: Finished difference Result 11513 states and 56778 transitions. [2019-12-27 19:32:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:32:02,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 19:32:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:32:02,116 INFO L225 Difference]: With dead ends: 11513 [2019-12-27 19:32:02,116 INFO L226 Difference]: Without dead ends: 11513 [2019-12-27 19:32:02,117 INFO L631 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-12-27 19:32:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11513 states. [2019-12-27 19:32:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11513 to 8679. [2019-12-27 19:32:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-12-27 19:32:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 42021 transitions. [2019-12-27 19:32:02,323 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 42021 transitions. Word has length 15 [2019-12-27 19:32:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:32:02,323 INFO L462 AbstractCegarLoop]: Abstraction has 8679 states and 42021 transitions. [2019-12-27 19:32:02,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:32:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 42021 transitions. [2019-12-27 19:32:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:32:02,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:32:02,325 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:32:02,325 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:32:02,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:32:02,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1825068028, now seen corresponding path program 1 times [2019-12-27 19:32:02,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:32:02,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216223456] [2019-12-27 19:32:02,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:32:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:32:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 19:32:02,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216223456] [2019-12-27 19:32:02,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:32:02,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:32:02,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [727571840] [2019-12-27 19:32:02,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:32:02,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:32:02,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:32:02,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:32:02,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:32:02,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:32:02,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:32:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:32:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:32:02,343 INFO L87 Difference]: Start difference. First operand 8679 states and 42021 transitions. Second operand 3 states. [2019-12-27 19:32:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:32:02,452 INFO L93 Difference]: Finished difference Result 12762 states and 61063 transitions. [2019-12-27 19:32:02,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:32:02,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 19:32:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:32:02,486 INFO L225 Difference]: With dead ends: 12762 [2019-12-27 19:32:02,486 INFO L226 Difference]: Without dead ends: 12762 [2019-12-27 19:32:02,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:32:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-27 19:32:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 10717. [2019-12-27 19:32:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10717 states. [2019-12-27 19:32:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10717 states to 10717 states and 52542 transitions. [2019-12-27 19:32:02,922 INFO L78 Accepts]: Start accepts. Automaton has 10717 states and 52542 transitions. Word has length 17 [2019-12-27 19:32:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:32:02,922 INFO L462 AbstractCegarLoop]: Abstraction has 10717 states and 52542 transitions. [2019-12-27 19:32:02,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:32:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10717 states and 52542 transitions. [2019-12-27 19:32:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:32:02,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:32:02,924 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:32:02,924 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:32:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:32:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash -742531920, now seen corresponding path program 1 times [2019-12-27 19:32:02,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:32:02,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634055050] [2019-12-27 19:32:02,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:32:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:32:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 19:32:02,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634055050] [2019-12-27 19:32:02,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:32:02,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:32:02,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925939898] [2019-12-27 19:32:02,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:32:02,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:32:02,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 43 transitions. [2019-12-27 19:32:02,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:32:02,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:32:02,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:32:02,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:32:02,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:32:02,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:32:02,948 INFO L87 Difference]: Start difference. First operand 10717 states and 52542 transitions. Second operand 4 states. [2019-12-27 19:32:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:32:03,041 INFO L93 Difference]: Finished difference Result 8672 states and 41976 transitions. [2019-12-27 19:32:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:32:03,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 19:32:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:32:03,070 INFO L225 Difference]: With dead ends: 8672 [2019-12-27 19:32:03,070 INFO L226 Difference]: Without dead ends: 8672 [2019-12-27 19:32:03,070 INFO L631 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-12-27 19:32:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2019-12-27 19:32:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 6627. [2019-12-27 19:32:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6627 states. [2019-12-27 19:32:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 31410 transitions. [2019-12-27 19:32:03,228 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 31410 transitions. Word has length 18 [2019-12-27 19:32:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:32:03,228 INFO L462 AbstractCegarLoop]: Abstraction has 6627 states and 31410 transitions. [2019-12-27 19:32:03,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:32:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 31410 transitions. [2019-12-27 19:32:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:32:03,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:32:03,232 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:32:03,232 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:32:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:32:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash -766676883, now seen corresponding path program 1 times [2019-12-27 19:32:03,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:32:03,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860250291] [2019-12-27 19:32:03,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:32:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:32:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-27 19:32:03,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860250291] [2019-12-27 19:32:03,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:32:03,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:32:03,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1539306654] [2019-12-27 19:32:03,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:32:03,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:32:03,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 19:32:03,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:32:03,258 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:32:03,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:32:03,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:32:03,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:32:03,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:32:03,260 INFO L87 Difference]: Start difference. First operand 6627 states and 31410 transitions. Second operand 3 states. [2019-12-27 19:32:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:32:03,361 INFO L93 Difference]: Finished difference Result 9207 states and 43429 transitions. [2019-12-27 19:32:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:32:03,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 19:32:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:32:03,391 INFO L225 Difference]: With dead ends: 9207 [2019-12-27 19:32:03,391 INFO L226 Difference]: Without dead ends: 9207 [2019-12-27 19:32:03,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:32:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9207 states. [2019-12-27 19:32:03,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9207 to 7915. [2019-12-27 19:32:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7915 states. [2019-12-27 19:32:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7915 states to 7915 states and 38052 transitions. [2019-12-27 19:32:03,548 INFO L78 Accepts]: Start accepts. Automaton has 7915 states and 38052 transitions. Word has length 20 [2019-12-27 19:32:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:32:03,548 INFO L462 AbstractCegarLoop]: Abstraction has 7915 states and 38052 transitions. [2019-12-27 19:32:03,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:32:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7915 states and 38052 transitions. [2019-12-27 19:32:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:32:03,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:32:03,551 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:32:03,551 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:32:03,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:32:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2002648867, now seen corresponding path program 1 times [2019-12-27 19:32:03,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:32:03,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738140575] [2019-12-27 19:32:03,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:32:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:32:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:32:03,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:32:03,568 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:32:03,569 WARN L364 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:32:03,569 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2019-12-27 19:32:03,578 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,578 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,579 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,579 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,579 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,579 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,579 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,579 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,579 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,581 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,581 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,581 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,582 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,582 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,582 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,582 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,582 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,582 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,582 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,583 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,583 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,583 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,583 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,585 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,585 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,585 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,585 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,585 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,585 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,585 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,585 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,586 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,586 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,586 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,586 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,586 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,587 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,587 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,587 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,587 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,587 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,587 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,587 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,588 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,588 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,588 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,588 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,588 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,588 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,589 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,590 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,590 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,590 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,590 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,590 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,590 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,590 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,590 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,591 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,591 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,591 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,591 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,591 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,591 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,591 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,591 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,592 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,592 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,592 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,592 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,592 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,592 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,593 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,593 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,593 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,594 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,594 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,595 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,595 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,595 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,595 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,596 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,596 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,597 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,597 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,597 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,597 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,599 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,599 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,599 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,599 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,600 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,600 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,601 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,601 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,602 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,602 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,603 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,603 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,604 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,604 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,610 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,610 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,610 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,611 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,611 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,611 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:32:03,612 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 19:32:03,612 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:32:03,613 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:32:03,613 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:32:03,613 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:32:03,613 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:32:03,613 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:32:03,613 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:32:03,613 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:32:03,614 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 111 transitions [2019-12-27 19:32:03,615 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions [2019-12-27 19:32:03,641 INFO L132 PetriNetUnfolder]: 15/173 cut-off events. [2019-12-27 19:32:03,642 INFO L133 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2019-12-27 19:32:03,646 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2019-12-27 19:32:03,661 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions [2019-12-27 19:32:03,687 INFO L132 PetriNetUnfolder]: 15/173 cut-off events. [2019-12-27 19:32:03,688 INFO L133 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2019-12-27 19:32:03,692 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2019-12-27 19:32:03,703 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8232 [2019-12-27 19:32:03,704 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:32:04,693 INFO L206 etLargeBlockEncoding]: Checked pairs total: 12199 [2019-12-27 19:32:04,693 INFO L214 etLargeBlockEncoding]: Total number of compositions: 88 [2019-12-27 19:32:04,693 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 37 transitions [2019-12-27 19:32:54,556 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160420 states. [2019-12-27 19:32:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 160420 states. [2019-12-27 19:32:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:32:54,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:32:54,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:32:54,557 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:32:54,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:32:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1044393949, now seen corresponding path program 1 times [2019-12-27 19:32:54,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:32:54,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108048255] [2019-12-27 19:32:54,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:32:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:32:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:32:54,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108048255] [2019-12-27 19:32:54,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:32:54,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:32:54,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962459423] [2019-12-27 19:32:54,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:32:54,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:32:54,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:32:54,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:32:54,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:32:54,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:32:54,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:32:54,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:32:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:32:54,572 INFO L87 Difference]: Start difference. First operand 160420 states. Second operand 3 states. [2019-12-27 19:32:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:32:59,629 INFO L93 Difference]: Finished difference Result 190005 states and 1117019 transitions. [2019-12-27 19:32:59,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:32:59,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 19:32:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:33:00,358 INFO L225 Difference]: With dead ends: 190005 [2019-12-27 19:33:00,358 INFO L226 Difference]: Without dead ends: 190005 [2019-12-27 19:33:00,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:33:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190005 states. [2019-12-27 19:33:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190005 to 158349. [2019-12-27 19:33:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158349 states. [2019-12-27 19:33:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158349 states to 158349 states and 952006 transitions. [2019-12-27 19:33:17,773 INFO L78 Accepts]: Start accepts. Automaton has 158349 states and 952006 transitions. Word has length 5 [2019-12-27 19:33:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:33:17,773 INFO L462 AbstractCegarLoop]: Abstraction has 158349 states and 952006 transitions. [2019-12-27 19:33:17,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:33:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 158349 states and 952006 transitions. [2019-12-27 19:33:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:33:17,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:33:17,773 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:33:17,773 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:33:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:33:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 610026521, now seen corresponding path program 1 times [2019-12-27 19:33:17,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:33:17,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058857413] [2019-12-27 19:33:17,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:33:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:33:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:33:17,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058857413] [2019-12-27 19:33:17,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:33:17,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:33:17,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [421380691] [2019-12-27 19:33:17,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:33:17,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:33:17,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 19:33:17,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:33:17,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:33:17,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:33:17,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:33:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:33:17,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:33:17,795 INFO L87 Difference]: Start difference. First operand 158349 states and 952006 transitions. Second operand 3 states. [2019-12-27 19:33:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:33:28,021 INFO L93 Difference]: Finished difference Result 246811 states and 1468819 transitions. [2019-12-27 19:33:28,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:33:28,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 19:33:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:33:29,816 INFO L225 Difference]: With dead ends: 246811 [2019-12-27 19:33:29,817 INFO L226 Difference]: Without dead ends: 246811 [2019-12-27 19:33:29,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:33:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246811 states. [2019-12-27 19:33:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246811 to 183575. [2019-12-27 19:33:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183575 states. [2019-12-27 19:33:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183575 states to 183575 states and 1107523 transitions. [2019-12-27 19:33:46,622 INFO L78 Accepts]: Start accepts. Automaton has 183575 states and 1107523 transitions. Word has length 8 [2019-12-27 19:33:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:33:46,622 INFO L462 AbstractCegarLoop]: Abstraction has 183575 states and 1107523 transitions. [2019-12-27 19:33:46,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:33:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 183575 states and 1107523 transitions. [2019-12-27 19:33:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:33:46,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:33:46,623 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:33:46,623 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:33:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:33:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1165029829, now seen corresponding path program 1 times [2019-12-27 19:33:46,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:33:46,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201267907] [2019-12-27 19:33:46,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:33:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:33:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:33:46,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201267907] [2019-12-27 19:33:46,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:33:46,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:33:46,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1543536519] [2019-12-27 19:33:46,640 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:33:46,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:33:46,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:33:46,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:33:46,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:33:46,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:33:46,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:33:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:33:46,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:33:46,644 INFO L87 Difference]: Start difference. First operand 183575 states and 1107523 transitions. Second operand 4 states. [2019-12-27 19:33:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:33:56,297 INFO L93 Difference]: Finished difference Result 145622 states and 870444 transitions. [2019-12-27 19:33:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:33:56,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:33:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:33:56,869 INFO L225 Difference]: With dead ends: 145622 [2019-12-27 19:33:56,869 INFO L226 Difference]: Without dead ends: 145622 [2019-12-27 19:33:56,870 INFO L631 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-12-27 19:33:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145622 states. [2019-12-27 19:34:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145622 to 114004. [2019-12-27 19:34:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114004 states. [2019-12-27 19:34:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114004 states to 114004 states and 673987 transitions. [2019-12-27 19:34:03,550 INFO L78 Accepts]: Start accepts. Automaton has 114004 states and 673987 transitions. Word has length 9 [2019-12-27 19:34:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:34:03,550 INFO L462 AbstractCegarLoop]: Abstraction has 114004 states and 673987 transitions. [2019-12-27 19:34:03,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:34:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 114004 states and 673987 transitions. [2019-12-27 19:34:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:34:03,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:34:03,551 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:34:03,551 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:34:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:34:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1730955589, now seen corresponding path program 1 times [2019-12-27 19:34:03,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:34:03,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115105305] [2019-12-27 19:34:03,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:34:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:34:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:34:03,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115105305] [2019-12-27 19:34:03,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:34:03,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:34:03,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958584507] [2019-12-27 19:34:03,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:34:03,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:34:03,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 16 transitions. [2019-12-27 19:34:03,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:34:03,577 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:34:03,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:34:03,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:34:03,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:34:03,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:34:03,578 INFO L87 Difference]: Start difference. First operand 114004 states and 673987 transitions. Second operand 4 states. [2019-12-27 19:34:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:34:04,276 INFO L93 Difference]: Finished difference Result 95018 states and 558562 transitions. [2019-12-27 19:34:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:34:04,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:34:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:34:04,608 INFO L225 Difference]: With dead ends: 95018 [2019-12-27 19:34:04,609 INFO L226 Difference]: Without dead ends: 95018 [2019-12-27 19:34:04,609 INFO L631 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-12-27 19:34:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95018 states. [2019-12-27 19:34:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95018 to 76032. [2019-12-27 19:34:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76032 states. [2019-12-27 19:34:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76032 states to 76032 states and 443137 transitions. [2019-12-27 19:34:14,644 INFO L78 Accepts]: Start accepts. Automaton has 76032 states and 443137 transitions. Word has length 9 [2019-12-27 19:34:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:34:14,644 INFO L462 AbstractCegarLoop]: Abstraction has 76032 states and 443137 transitions. [2019-12-27 19:34:14,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:34:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 76032 states and 443137 transitions. [2019-12-27 19:34:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:34:14,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:34:14,645 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:34:14,645 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:34:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:34:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1101646248, now seen corresponding path program 1 times [2019-12-27 19:34:14,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:34:14,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574005386] [2019-12-27 19:34:14,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:34:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:34:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:34:14,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574005386] [2019-12-27 19:34:14,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:34:14,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:34:14,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [250700409] [2019-12-27 19:34:14,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:34:14,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:34:14,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:34:14,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:34:14,670 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:34:14,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:34:14,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:34:14,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:34:14,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:34:14,672 INFO L87 Difference]: Start difference. First operand 76032 states and 443137 transitions. Second operand 3 states. [2019-12-27 19:34:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:34:15,497 INFO L93 Difference]: Finished difference Result 113976 states and 654880 transitions. [2019-12-27 19:34:15,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:34:15,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 19:34:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:34:15,891 INFO L225 Difference]: With dead ends: 113976 [2019-12-27 19:34:15,891 INFO L226 Difference]: Without dead ends: 113976 [2019-12-27 19:34:15,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:34:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113976 states. [2019-12-27 19:34:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113976 to 94996. [2019-12-27 19:34:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94996 states. [2019-12-27 19:34:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94996 states to 94996 states and 558450 transitions. [2019-12-27 19:34:25,355 INFO L78 Accepts]: Start accepts. Automaton has 94996 states and 558450 transitions. Word has length 11 [2019-12-27 19:34:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:34:25,356 INFO L462 AbstractCegarLoop]: Abstraction has 94996 states and 558450 transitions. [2019-12-27 19:34:25,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:34:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 94996 states and 558450 transitions. [2019-12-27 19:34:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:34:25,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:34:25,357 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:34:25,357 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:34:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:34:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash -208702148, now seen corresponding path program 1 times [2019-12-27 19:34:25,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:34:25,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840957350] [2019-12-27 19:34:25,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:34:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:34:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:34:25,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840957350] [2019-12-27 19:34:25,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:34:25,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:34:25,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1652198177] [2019-12-27 19:34:25,387 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:34:25,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:34:25,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 25 transitions. [2019-12-27 19:34:25,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:34:25,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:34:25,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:34:25,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:34:25,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:34:25,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:34:25,390 INFO L87 Difference]: Start difference. First operand 94996 states and 558450 transitions. Second operand 4 states. [2019-12-27 19:34:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:34:25,922 INFO L93 Difference]: Finished difference Result 76016 states and 443040 transitions. [2019-12-27 19:34:25,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:34:25,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 19:34:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:34:27,419 INFO L225 Difference]: With dead ends: 76016 [2019-12-27 19:34:27,419 INFO L226 Difference]: Without dead ends: 76016 [2019-12-27 19:34:27,419 INFO L631 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-12-27 19:34:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76016 states. [2019-12-27 19:34:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76016 to 57036. [2019-12-27 19:34:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57036 states. [2019-12-27 19:34:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57036 states to 57036 states and 327630 transitions. [2019-12-27 19:34:30,560 INFO L78 Accepts]: Start accepts. Automaton has 57036 states and 327630 transitions. Word has length 12 [2019-12-27 19:34:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:34:30,560 INFO L462 AbstractCegarLoop]: Abstraction has 57036 states and 327630 transitions. [2019-12-27 19:34:30,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:34:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 57036 states and 327630 transitions. [2019-12-27 19:34:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:34:30,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:34:30,561 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:34:30,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:34:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:34:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1111906441, now seen corresponding path program 1 times [2019-12-27 19:34:30,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:34:30,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977849512] [2019-12-27 19:34:30,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:34:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:34:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:34:30,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977849512] [2019-12-27 19:34:30,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:34:30,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:34:30,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1597597175] [2019-12-27 19:34:30,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:34:30,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:34:30,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:34:30,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:34:30,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:34:30,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:34:30,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:34:30,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:34:30,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:34:30,584 INFO L87 Difference]: Start difference. First operand 57036 states and 327630 transitions. Second operand 3 states. [2019-12-27 19:34:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:34:35,318 INFO L93 Difference]: Finished difference Result 85437 states and 483874 transitions. [2019-12-27 19:34:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:34:35,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 19:34:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:34:35,611 INFO L225 Difference]: With dead ends: 85437 [2019-12-27 19:34:35,611 INFO L226 Difference]: Without dead ends: 85437 [2019-12-27 19:34:35,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:34:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85437 states. [2019-12-27 19:34:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85437 to 71230. [2019-12-27 19:34:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71230 states. [2019-12-27 19:34:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71230 states to 71230 states and 412813 transitions. [2019-12-27 19:34:38,075 INFO L78 Accepts]: Start accepts. Automaton has 71230 states and 412813 transitions. Word has length 14 [2019-12-27 19:34:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:34:38,075 INFO L462 AbstractCegarLoop]: Abstraction has 71230 states and 412813 transitions. [2019-12-27 19:34:38,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:34:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 71230 states and 412813 transitions. [2019-12-27 19:34:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:34:38,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:34:38,076 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:34:38,076 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:34:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:34:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 109363834, now seen corresponding path program 1 times [2019-12-27 19:34:38,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:34:38,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35256753] [2019-12-27 19:34:38,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:34:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:34:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:34:38,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35256753] [2019-12-27 19:34:38,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:34:38,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:34:38,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1901321585] [2019-12-27 19:34:38,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:34:38,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:34:38,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 19:34:38,098 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:34:38,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:34:38,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:34:38,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:34:38,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:34:38,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:34:38,099 INFO L87 Difference]: Start difference. First operand 71230 states and 412813 transitions. Second operand 4 states. [2019-12-27 19:34:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:34:39,316 INFO L93 Difference]: Finished difference Result 57023 states and 327545 transitions. [2019-12-27 19:34:39,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:34:39,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 19:34:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:34:39,505 INFO L225 Difference]: With dead ends: 57023 [2019-12-27 19:34:39,505 INFO L226 Difference]: Without dead ends: 57023 [2019-12-27 19:34:39,506 INFO L631 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-12-27 19:34:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57023 states. [2019-12-27 19:34:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57023 to 42816. [2019-12-27 19:34:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42816 states. [2019-12-27 19:34:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42816 states to 42816 states and 242277 transitions. [2019-12-27 19:34:41,741 INFO L78 Accepts]: Start accepts. Automaton has 42816 states and 242277 transitions. Word has length 15 [2019-12-27 19:34:41,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:34:41,742 INFO L462 AbstractCegarLoop]: Abstraction has 42816 states and 242277 transitions. [2019-12-27 19:34:41,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:34:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 42816 states and 242277 transitions. [2019-12-27 19:34:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:34:41,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:34:41,743 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:34:41,743 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:34:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:34:41,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1837133616, now seen corresponding path program 1 times [2019-12-27 19:34:41,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:34:41,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913923116] [2019-12-27 19:34:41,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:34:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:34:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 19:34:41,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913923116] [2019-12-27 19:34:41,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:34:41,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:34:41,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [490718291] [2019-12-27 19:34:41,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:34:41,760 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:34:41,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:34:41,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:34:41,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:34:41,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:34:41,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:34:41,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:34:41,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:34:41,762 INFO L87 Difference]: Start difference. First operand 42816 states and 242277 transitions. Second operand 3 states. [2019-12-27 19:34:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:34:42,181 INFO L93 Difference]: Finished difference Result 63954 states and 357097 transitions. [2019-12-27 19:34:42,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:34:42,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 19:34:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:34:42,388 INFO L225 Difference]: With dead ends: 63954 [2019-12-27 19:34:42,388 INFO L226 Difference]: Without dead ends: 63954 [2019-12-27 19:34:42,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:34:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63954 states. [2019-12-27 19:34:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63954 to 53380. [2019-12-27 19:34:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53380 states. [2019-12-27 19:34:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53380 states to 53380 states and 304939 transitions. [2019-12-27 19:34:48,091 INFO L78 Accepts]: Start accepts. Automaton has 53380 states and 304939 transitions. Word has length 17 [2019-12-27 19:34:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:34:48,091 INFO L462 AbstractCegarLoop]: Abstraction has 53380 states and 304939 transitions. [2019-12-27 19:34:48,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:34:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 53380 states and 304939 transitions. [2019-12-27 19:34:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:34:48,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:34:48,093 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:34:48,093 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:34:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:34:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1116569629, now seen corresponding path program 1 times [2019-12-27 19:34:48,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:34:48,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785356750] [2019-12-27 19:34:48,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:34:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:34:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 19:34:48,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785356750] [2019-12-27 19:34:48,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:34:48,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:34:48,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878972805] [2019-12-27 19:34:48,111 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:34:48,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:34:48,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 19:34:48,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:34:48,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:34:48,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:34:48,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:34:48,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:34:48,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:34:48,115 INFO L87 Difference]: Start difference. First operand 53380 states and 304939 transitions. Second operand 4 states. [2019-12-27 19:34:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:34:48,417 INFO L93 Difference]: Finished difference Result 42806 states and 242207 transitions. [2019-12-27 19:34:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:34:48,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 19:34:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:34:48,552 INFO L225 Difference]: With dead ends: 42806 [2019-12-27 19:34:48,552 INFO L226 Difference]: Without dead ends: 42806 [2019-12-27 19:34:48,553 INFO L631 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-12-27 19:34:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42806 states. [2019-12-27 19:34:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42806 to 32232. [2019-12-27 19:34:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32232 states. [2019-12-27 19:34:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32232 states to 32232 states and 179475 transitions. [2019-12-27 19:34:50,447 INFO L78 Accepts]: Start accepts. Automaton has 32232 states and 179475 transitions. Word has length 18 [2019-12-27 19:34:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:34:50,447 INFO L462 AbstractCegarLoop]: Abstraction has 32232 states and 179475 transitions. [2019-12-27 19:34:50,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:34:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 32232 states and 179475 transitions. [2019-12-27 19:34:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:34:50,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:34:50,449 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:34:50,450 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:34:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:34:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -904404383, now seen corresponding path program 1 times [2019-12-27 19:34:50,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:34:50,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791055889] [2019-12-27 19:34:50,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:34:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:34:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-27 19:34:50,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791055889] [2019-12-27 19:34:50,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:34:50,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:34:50,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268269566] [2019-12-27 19:34:50,476 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:34:50,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:34:50,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 19:34:50,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:34:50,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:34:50,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:34:50,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:34:50,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:34:50,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:34:50,481 INFO L87 Difference]: Start difference. First operand 32232 states and 179475 transitions. Second operand 3 states. [2019-12-27 19:34:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:34:50,802 INFO L93 Difference]: Finished difference Result 50672 states and 280929 transitions. [2019-12-27 19:34:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:34:50,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 19:34:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:34:50,964 INFO L225 Difference]: With dead ends: 50672 [2019-12-27 19:34:50,964 INFO L226 Difference]: Without dead ends: 50672 [2019-12-27 19:34:50,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:34:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50672 states. [2019-12-27 19:34:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50672 to 38374. [2019-12-27 19:34:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38374 states. Received shutdown request... [2019-12-27 19:34:52,861 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 19:34:52,865 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 19:34:52,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:34:52 BasicIcfg [2019-12-27 19:34:52,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:34:52,867 INFO L168 Benchmark]: Toolchain (without parser) took 201205.76 ms. Allocated memory was 145.2 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 101.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 19:34:52,867 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 19:34:52,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.02 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 161.3 MB in the end (delta: -59.8 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:34:52,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.34 ms. Allocated memory is still 202.9 MB. Free memory was 161.3 MB in the beginning and 159.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:34:52,868 INFO L168 Benchmark]: Boogie Preprocessor took 23.69 ms. Allocated memory is still 202.9 MB. Free memory was 159.3 MB in the beginning and 157.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:34:52,869 INFO L168 Benchmark]: RCFGBuilder took 318.79 ms. Allocated memory is still 202.9 MB. Free memory was 157.9 MB in the beginning and 141.6 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:34:52,869 INFO L168 Benchmark]: TraceAbstraction took 200060.02 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 141.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 19:34:52,871 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.02 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 161.3 MB in the end (delta: -59.8 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.34 ms. Allocated memory is still 202.9 MB. Free memory was 161.3 MB in the beginning and 159.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.69 ms. Allocated memory is still 202.9 MB. Free memory was 159.3 MB in the beginning and 157.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.79 ms. Allocated memory is still 202.9 MB. Free memory was 157.9 MB in the beginning and 141.6 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 200060.02 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 141.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 34 ProgramPointsBefore, 9 ProgramPointsAfterwards, 33 TransitionsBefore, 8 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 160 CheckedPairsTotal, 29 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.6s, 48 ProgramPointsBefore, 15 ProgramPointsAfterwards, 46 TransitionsBefore, 13 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 430 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 964 CheckedPairsTotal, 35 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 62 ProgramPointsBefore, 20 ProgramPointsAfterwards, 59 TransitionsBefore, 17 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 4 ChoiceCompositions, 887 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2078 CheckedPairsTotal, 45 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 72 TransitionsBefore, 23 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 1513 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3472 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 90 ProgramPointsBefore, 30 ProgramPointsAfterwards, 85 TransitionsBefore, 25 TransitionsAfterwards, 4320 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 6 ChoiceCompositions, 2340 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5838 CheckedPairsTotal, 65 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 104 ProgramPointsBefore, 36 ProgramPointsAfterwards, 98 TransitionsBefore, 31 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 3292 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 8349 CheckedPairsTotal, 76 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.0s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 111 TransitionsBefore, 37 TransitionsAfterwards, 8232 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 6 ChoiceCompositions, 4486 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 12199 CheckedPairsTotal, 88 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 680). Cancelled while ReachableStatesComputation was computing reachable states (9529 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Result: TIMEOUT, OverallTime: 169.2s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 40.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 491 SDtfs, 342 SDslu, 259 SDs, 0 SdLazy, 362 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183575occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 233018 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 2103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 142/142 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown