/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.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:15:14,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:15:14,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:15:14,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:15:14,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:15:14,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:15:14,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:15:14,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:15:14,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:15:14,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:15:14,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:15:14,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:15:14,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:15:14,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:15:14,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:15:14,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:15:14,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:15:14,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:15:14,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:15:14,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:15:14,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:15:14,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:15:14,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:15:14,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:15:14,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:15:14,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:15:14,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:15:14,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:15:14,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:15:14,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:15:14,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:15:14,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:15:14,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:15:14,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:15:14,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:15:14,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:15:14,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:15:14,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:15:14,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:15:14,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:15:14,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:15:14,358 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.epf [2019-12-27 08:15:14,372 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:15:14,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:15:14,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:15:14,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:15:14,374 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:15:14,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:15:14,374 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:15:14,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:15:14,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:15:14,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:15:14,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:15:14,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:15:14,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:15:14,376 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:15:14,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:15:14,376 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:15:14,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:15:14,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:15:14,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:15:14,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:15:14,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:15:14,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:15:14,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:15:14,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:15:14,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:15:14,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:15:14,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:15:14,378 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:15:14,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:15:14,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:15:14,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:15:14,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:15:14,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:15:14,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:15:14,685 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:15:14,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2019-12-27 08:15:14,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcf7ec13/5ea6d90ec0b74e88a9fe6542fd3cb583/FLAG26976e031 [2019-12-27 08:15:15,326 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:15:15,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2019-12-27 08:15:15,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcf7ec13/5ea6d90ec0b74e88a9fe6542fd3cb583/FLAG26976e031 [2019-12-27 08:15:15,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcf7ec13/5ea6d90ec0b74e88a9fe6542fd3cb583 [2019-12-27 08:15:15,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:15:15,626 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:15:15,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:15:15,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:15:15,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:15:15,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:15:15" (1/1) ... [2019-12-27 08:15:15,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d51f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:15, skipping insertion in model container [2019-12-27 08:15:15,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:15:15" (1/1) ... [2019-12-27 08:15:15,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:15:15,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:15:16,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:15:16,126 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:15:16,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:15:16,270 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:15:16,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16 WrapperNode [2019-12-27 08:15:16,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:15:16,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:15:16,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:15:16,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:15:16,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:15:16,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:15:16,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:15:16,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:15:16,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (1/1) ... [2019-12-27 08:15:16,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:15:16,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:15:16,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:15:16,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:15:16,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (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 08:15:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 08:15:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 08:15:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 08:15:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 08:15:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:15:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:15:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:15:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:15:16,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:15:16,431 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 08:15:16,763 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:15:16,764 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 08:15:16,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:15:16 BoogieIcfgContainer [2019-12-27 08:15:16,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:15:16,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:15:16,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:15:16,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:15:16,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:15:15" (1/3) ... [2019-12-27 08:15:16,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6d7a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:15:16, skipping insertion in model container [2019-12-27 08:15:16,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:15:16" (2/3) ... [2019-12-27 08:15:16,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c6d7a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:15:16, skipping insertion in model container [2019-12-27 08:15:16,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:15:16" (3/3) ... [2019-12-27 08:15:16,774 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-2.i [2019-12-27 08:15:16,785 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:15:16,785 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:15:16,792 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 08:15:16,793 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:15:16,819 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,819 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,820 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,820 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,821 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,821 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,821 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,822 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,822 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,823 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,823 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,823 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,823 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,824 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,824 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,824 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,824 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,825 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,825 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,825 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,826 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,830 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,830 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,831 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,831 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,831 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,841 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,841 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,842 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,842 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:16,857 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 08:15:16,879 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:15:16,879 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:15:16,879 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:15:16,879 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:15:16,880 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:15:16,880 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:15:16,880 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:15:16,880 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:15:16,894 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-27 08:15:16,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 08:15:16,942 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 08:15:16,943 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:15:16,949 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 08:15:16,952 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 08:15:16,978 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 08:15:16,978 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:15:16,980 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 08:15:16,984 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-27 08:15:16,985 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:15:18,191 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 08:15:18,323 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-27 08:15:18,324 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-27 08:15:18,328 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 08:15:18,336 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 08:15:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 08:15:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:15:18,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:18,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:15:18,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-27 08:15:18,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:18,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427336600] [2019-12-27 08:15:18,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:18,541 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 08:15:18,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427336600] [2019-12-27 08:15:18,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:18,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:15:18,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027221442] [2019-12-27 08:15:18,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:15:18,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:15:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:15:18,569 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 08:15:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:18,602 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 08:15:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:15:18,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:15:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:18,626 INFO L225 Difference]: With dead ends: 35 [2019-12-27 08:15:18,626 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 08:15:18,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 08:15:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 08:15:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 08:15:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 08:15:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 08:15:18,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 08:15:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:18,687 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 08:15:18,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:15:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 08:15:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 08:15:18,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:18,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:18,701 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:18,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-27 08:15:18,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:18,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393072859] [2019-12-27 08:15:18,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:18,853 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 08:15:18,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393072859] [2019-12-27 08:15:18,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:18,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:15:18,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799961808] [2019-12-27 08:15:18,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:15:18,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:18,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:15:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:15:18,859 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 08:15:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:18,877 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 08:15:18,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:15:18,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 08:15:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:18,880 INFO L225 Difference]: With dead ends: 26 [2019-12-27 08:15:18,880 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 08:15:18,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:15:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 08:15:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 08:15:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 08:15:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 08:15:18,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 08:15:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:18,888 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 08:15:18,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:15:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 08:15:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 08:15:18,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:18,890 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:18,891 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-27 08:15:18,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:18,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14232168] [2019-12-27 08:15:18,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:15:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:15:18,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:15:18,987 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:15:18,987 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:15:18,987 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 08:15:19,002 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,002 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,002 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,003 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,003 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,004 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,004 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,004 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,004 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,005 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,005 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,005 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,005 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,005 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,015 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,016 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,016 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,016 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,016 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,019 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,019 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,020 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,020 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,020 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,024 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,024 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,028 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,029 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,029 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,029 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,029 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:19,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:15:19,031 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:15:19,031 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:15:19,032 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:15:19,032 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:15:19,032 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:15:19,032 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:15:19,032 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:15:19,032 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:15:19,036 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 08:15:19,037 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 08:15:19,058 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 08:15:19,059 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 08:15:19,061 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-27 08:15:19,066 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 08:15:19,083 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 08:15:19,083 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 08:15:19,085 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-27 08:15:19,088 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-27 08:15:19,088 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:15:20,085 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 08:15:20,376 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-27 08:15:20,376 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-27 08:15:20,377 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 08:15:20,389 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 08:15:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 08:15:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:15:20,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:20,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:15:20,391 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-27 08:15:20,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:20,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772352887] [2019-12-27 08:15:20,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:20,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 08:15:20,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772352887] [2019-12-27 08:15:20,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:20,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:15:20,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044965855] [2019-12-27 08:15:20,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:15:20,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:15:20,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:15:20,431 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 08:15:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:20,467 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 08:15:20,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:15:20,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:15:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:20,472 INFO L225 Difference]: With dead ends: 185 [2019-12-27 08:15:20,472 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 08:15:20,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 08:15:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 08:15:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 08:15:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 08:15:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 08:15:20,501 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 08:15:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:20,502 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 08:15:20,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:15:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 08:15:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:15:20,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:20,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:20,503 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:20,504 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-27 08:15:20,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:20,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73480831] [2019-12-27 08:15:20,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:20,556 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 08:15:20,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73480831] [2019-12-27 08:15:20,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:20,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:20,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044188881] [2019-12-27 08:15:20,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:20,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:20,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:20,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:20,558 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 08:15:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:20,618 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 08:15:20,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:20,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:15:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:20,621 INFO L225 Difference]: With dead ends: 204 [2019-12-27 08:15:20,622 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 08:15:20,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 08:15:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 08:15:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 08:15:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 08:15:20,652 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 08:15:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:20,652 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 08:15:20,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 08:15:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:15:20,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:20,653 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:20,654 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-27 08:15:20,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:20,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552142655] [2019-12-27 08:15:20,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:20,761 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 08:15:20,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552142655] [2019-12-27 08:15:20,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:20,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:20,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935801286] [2019-12-27 08:15:20,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:20,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:20,764 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 08:15:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:20,825 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 08:15:20,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:20,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:15:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:20,827 INFO L225 Difference]: With dead ends: 189 [2019-12-27 08:15:20,828 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 08:15:20,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 08:15:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 08:15:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 08:15:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 08:15:20,852 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 08:15:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:20,853 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 08:15:20,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 08:15:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:15:20,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:20,855 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:20,855 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:20,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-27 08:15:20,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:20,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380322549] [2019-12-27 08:15:20,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:15:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:15:20,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:15:20,891 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:15:20,892 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:15:20,892 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 08:15:20,905 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,906 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,910 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,911 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,911 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,911 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,911 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,911 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,911 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,913 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,913 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,913 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,913 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,915 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,915 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,915 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,915 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,915 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,918 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,918 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,922 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,922 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,922 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,922 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,923 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,923 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,924 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,924 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,924 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,924 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,926 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:20,929 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:15:20,930 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:15:20,930 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:15:20,930 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:15:20,930 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:15:20,930 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:15:20,930 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:15:20,930 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:15:20,930 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:15:20,932 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-27 08:15:20,932 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 08:15:20,951 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 08:15:20,951 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 08:15:20,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 08:15:20,957 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 08:15:20,993 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 08:15:20,994 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 08:15:20,996 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 08:15:21,000 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-27 08:15:21,001 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:15:22,389 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 08:15:22,449 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-27 08:15:22,449 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-27 08:15:22,450 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 08:15:22,474 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 08:15:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 08:15:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:15:22,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:22,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:15:22,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:22,476 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-27 08:15:22,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:22,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966301641] [2019-12-27 08:15:22,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:15:22,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966301641] [2019-12-27 08:15:22,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:22,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:15:22,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718635807] [2019-12-27 08:15:22,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:15:22,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:15:22,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:15:22,510 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 08:15:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:22,545 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 08:15:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:15:22,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:15:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:22,554 INFO L225 Difference]: With dead ends: 600 [2019-12-27 08:15:22,555 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 08:15:22,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 08:15:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 08:15:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 08:15:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 08:15:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 08:15:22,596 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 08:15:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:22,596 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 08:15:22,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:15:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 08:15:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:15:22,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:22,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:22,597 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-27 08:15:22,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:22,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754271411] [2019-12-27 08:15:22,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:22,660 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 08:15:22,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754271411] [2019-12-27 08:15:22,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:22,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:22,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193600233] [2019-12-27 08:15:22,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:22,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:22,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:22,663 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 08:15:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:22,742 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 08:15:22,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:22,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:15:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:22,750 INFO L225 Difference]: With dead ends: 802 [2019-12-27 08:15:22,750 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 08:15:22,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 08:15:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 08:15:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 08:15:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 08:15:22,778 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 08:15:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:22,779 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 08:15:22,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 08:15:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:15:22,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:22,786 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:22,786 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-27 08:15:22,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:22,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523758064] [2019-12-27 08:15:22,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:22,840 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 08:15:22,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523758064] [2019-12-27 08:15:22,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:22,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:22,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36265694] [2019-12-27 08:15:22,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:22,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:22,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:22,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:22,842 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 08:15:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:22,942 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 08:15:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:22,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:15:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:22,949 INFO L225 Difference]: With dead ends: 832 [2019-12-27 08:15:22,949 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 08:15:22,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 08:15:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 08:15:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 08:15:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 08:15:22,975 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 08:15:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:22,975 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 08:15:22,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 08:15:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:15:22,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:22,976 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:22,976 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:22,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-27 08:15:22,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:22,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606986224] [2019-12-27 08:15:22,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:15:23,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606986224] [2019-12-27 08:15:23,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988014838] [2019-12-27 08:15:23,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:23,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:23,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:15:23,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:23,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 08:15:23,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399557138] [2019-12-27 08:15:23,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:23,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:23,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:23,240 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 9 states. [2019-12-27 08:15:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:23,468 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 08:15:23,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:23,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 08:15:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:23,476 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 08:15:23,476 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 08:15:23,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:15:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 08:15:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 08:15:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 08:15:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 08:15:23,500 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 08:15:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:23,500 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 08:15:23,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 08:15:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:15:23,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:23,502 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:23,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:23,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:23,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-27 08:15:23,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:23,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705060227] [2019-12-27 08:15:23,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:23,841 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 08:15:23,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705060227] [2019-12-27 08:15:23,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:23,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:23,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047990747] [2019-12-27 08:15:23,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:23,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:23,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:23,843 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 08:15:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:24,028 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 08:15:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:24,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:15:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:24,036 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 08:15:24,036 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 08:15:24,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 08:15:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 08:15:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 08:15:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 08:15:24,060 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 08:15:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:24,060 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 08:15:24,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 08:15:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:15:24,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:24,062 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:24,062 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:24,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-27 08:15:24,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:24,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490122361] [2019-12-27 08:15:24,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:24,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490122361] [2019-12-27 08:15:24,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:24,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:24,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136325403] [2019-12-27 08:15:24,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:24,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:24,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:24,143 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 08:15:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:24,208 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 08:15:24,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:24,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:15:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:24,215 INFO L225 Difference]: With dead ends: 736 [2019-12-27 08:15:24,216 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 08:15:24,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 08:15:24,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 08:15:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 08:15:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 08:15:24,241 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 08:15:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:24,243 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 08:15:24,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 08:15:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:15:24,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:24,245 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:24,245 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-27 08:15:24,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:24,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181487495] [2019-12-27 08:15:24,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:15:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:15:24,299 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:15:24,300 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:15:24,300 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:15:24,300 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 08:15:24,321 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,321 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,321 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,321 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,322 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,322 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,322 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,322 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,323 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,323 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,323 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,324 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,324 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,324 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,324 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,324 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,324 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,324 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,325 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,325 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,325 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,325 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,325 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,325 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,326 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,326 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,326 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,327 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,327 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,328 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,328 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,328 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,328 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,329 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,329 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,329 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,330 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,330 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,330 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,330 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,330 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,331 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,331 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,331 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,331 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,331 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,332 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,332 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,332 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,332 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,333 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,333 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,333 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,333 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,333 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,334 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,334 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,334 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,334 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,334 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,335 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,335 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,335 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,335 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,336 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,336 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,336 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,336 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,336 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,336 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,337 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,337 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,337 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,337 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,337 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,337 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,338 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,338 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,338 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,338 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,338 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,338 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,338 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,339 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,339 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,339 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,340 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,341 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,342 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,342 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,343 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,343 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,345 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,345 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,345 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,345 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,345 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,358 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,358 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,362 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,362 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,363 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:24,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 08:15:24,368 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:15:24,368 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:15:24,368 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:15:24,368 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:15:24,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:15:24,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:15:24,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:15:24,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:15:24,370 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-27 08:15:24,370 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 08:15:24,401 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 08:15:24,401 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 08:15:24,404 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-27 08:15:24,409 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 08:15:24,438 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 08:15:24,438 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 08:15:24,440 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-27 08:15:24,444 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-27 08:15:24,445 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:15:25,879 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 08:15:26,253 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-27 08:15:26,253 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-27 08:15:26,253 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 08:15:26,360 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 08:15:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 08:15:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:15:26,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:26,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:15:26,362 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-27 08:15:26,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:26,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770019061] [2019-12-27 08:15:26,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:26,378 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 08:15:26,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770019061] [2019-12-27 08:15:26,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:26,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:15:26,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799761240] [2019-12-27 08:15:26,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:15:26,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:15:26,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:15:26,380 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 08:15:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:26,418 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 08:15:26,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:15:26,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:15:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:26,435 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 08:15:26,436 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 08:15:26,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 08:15:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 08:15:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 08:15:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 08:15:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 08:15:26,572 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 08:15:26,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:26,573 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 08:15:26,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:15:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 08:15:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:15:26,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:26,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:26,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-27 08:15:26,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:26,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36377760] [2019-12-27 08:15:26,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:26,632 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 08:15:26,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36377760] [2019-12-27 08:15:26,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:26,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:26,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132327712] [2019-12-27 08:15:26,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:26,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:26,635 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 08:15:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:26,748 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 08:15:26,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:26,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:15:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:26,781 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 08:15:26,781 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 08:15:26,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 08:15:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 08:15:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 08:15:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 08:15:26,885 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 08:15:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:26,885 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 08:15:26,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 08:15:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:15:26,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:26,886 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:26,886 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:26,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-27 08:15:26,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:26,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625972287] [2019-12-27 08:15:26,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:26,921 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 08:15:26,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625972287] [2019-12-27 08:15:26,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:26,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:26,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933145490] [2019-12-27 08:15:26,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:26,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:26,924 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 08:15:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:27,010 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 08:15:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:27,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:15:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:27,049 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 08:15:27,050 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 08:15:27,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 08:15:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 08:15:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 08:15:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 08:15:27,152 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 08:15:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:27,154 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 08:15:27,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 08:15:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:15:27,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:27,155 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:27,155 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:27,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-27 08:15:27,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:27,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909852163] [2019-12-27 08:15:27,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:15:27,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909852163] [2019-12-27 08:15:27,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628355075] [2019-12-27 08:15:27,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:27,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:27,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:15:27,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:27,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:15:27,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402469663] [2019-12-27 08:15:27,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:27,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:27,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:27,281 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 7 states. [2019-12-27 08:15:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:27,484 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-27 08:15:27,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:27,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:15:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:27,513 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 08:15:27,513 INFO L226 Difference]: Without dead ends: 4456 [2019-12-27 08:15:27,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-27 08:15:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-27 08:15:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 08:15:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 08:15:27,680 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 08:15:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:27,681 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 08:15:27,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 08:15:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:15:27,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:27,682 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:27,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:27,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:27,893 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-27 08:15:27,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:27,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243271725] [2019-12-27 08:15:27,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:27,950 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 08:15:27,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243271725] [2019-12-27 08:15:27,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:27,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:27,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789960753] [2019-12-27 08:15:27,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:27,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:27,953 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 08:15:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:28,176 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 08:15:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:28,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:15:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:28,193 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 08:15:28,193 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 08:15:28,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 08:15:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 08:15:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 08:15:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 08:15:28,284 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 08:15:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:28,284 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 08:15:28,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 08:15:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:15:28,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:28,286 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:28,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-27 08:15:28,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:28,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963207775] [2019-12-27 08:15:28,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:28,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963207775] [2019-12-27 08:15:28,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:28,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:28,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34834067] [2019-12-27 08:15:28,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:28,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:28,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:28,326 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 08:15:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:28,402 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 08:15:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:28,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:15:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:28,415 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 08:15:28,416 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 08:15:28,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 08:15:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 08:15:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 08:15:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 08:15:28,494 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 08:15:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:28,494 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 08:15:28,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 08:15:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:15:28,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:28,496 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:28,496 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-27 08:15:28,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:28,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088278129] [2019-12-27 08:15:28,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 08:15:28,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088278129] [2019-12-27 08:15:28,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248578082] [2019-12-27 08:15:28,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:28,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:28,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 08:15:28,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:28,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:15:28,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758945118] [2019-12-27 08:15:28,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:28,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:28,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:28,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:28,656 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 7 states. [2019-12-27 08:15:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:28,911 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-27 08:15:28,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:28,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:15:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:28,928 INFO L225 Difference]: With dead ends: 4759 [2019-12-27 08:15:28,929 INFO L226 Difference]: Without dead ends: 4753 [2019-12-27 08:15:28,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:28,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-27 08:15:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-27 08:15:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 08:15:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 08:15:29,101 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 08:15:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:29,101 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 08:15:29,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 08:15:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:15:29,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:29,103 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:29,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:29,306 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-27 08:15:29,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:29,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287629594] [2019-12-27 08:15:29,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:29,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287629594] [2019-12-27 08:15:29,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413648483] [2019-12-27 08:15:29,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:29,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:29,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:29,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:29,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:15:29,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994569564] [2019-12-27 08:15:29,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:29,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:29,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:29,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:29,433 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 7 states. [2019-12-27 08:15:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:29,699 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-27 08:15:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:29,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:15:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:29,712 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 08:15:29,713 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 08:15:29,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 08:15:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-27 08:15:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 08:15:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 08:15:29,799 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 08:15:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:29,799 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 08:15:29,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 08:15:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:15:29,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:29,801 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:30,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:30,006 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:30,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-27 08:15:30,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:30,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111589099] [2019-12-27 08:15:30,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:30,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111589099] [2019-12-27 08:15:30,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:30,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:30,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162941862] [2019-12-27 08:15:30,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:30,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:30,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:30,068 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 08:15:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:30,300 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 08:15:30,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:30,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:15:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:30,314 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 08:15:30,315 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 08:15:30,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 08:15:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 08:15:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 08:15:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 08:15:30,391 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 08:15:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:30,392 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 08:15:30,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 08:15:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:15:30,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:30,394 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:30,394 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:30,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-27 08:15:30,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:30,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659821160] [2019-12-27 08:15:30,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:30,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659821160] [2019-12-27 08:15:30,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:30,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:30,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272046116] [2019-12-27 08:15:30,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:30,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:30,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:30,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:30,440 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 08:15:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:30,627 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 08:15:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:30,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:15:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:30,712 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 08:15:30,712 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 08:15:30,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 08:15:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 08:15:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 08:15:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 08:15:30,783 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 08:15:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:30,783 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 08:15:30,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 08:15:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:30,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:30,785 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:30,785 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:30,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-27 08:15:30,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:30,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174851794] [2019-12-27 08:15:30,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 08:15:30,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174851794] [2019-12-27 08:15:30,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176121392] [2019-12-27 08:15:30,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:30,922 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:30,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 08:15:30,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:30,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:30,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977731418] [2019-12-27 08:15:30,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:30,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:30,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:30,929 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 9 states. [2019-12-27 08:15:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:31,468 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-27 08:15:31,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:31,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:31,484 INFO L225 Difference]: With dead ends: 5995 [2019-12-27 08:15:31,484 INFO L226 Difference]: Without dead ends: 5991 [2019-12-27 08:15:31,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-27 08:15:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-27 08:15:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 08:15:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 08:15:31,581 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 08:15:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:31,583 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 08:15:31,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 08:15:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:31,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:31,585 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:31,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:31,798 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:31,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-27 08:15:31,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:31,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527451336] [2019-12-27 08:15:31,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 08:15:31,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527451336] [2019-12-27 08:15:31,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898805975] [2019-12-27 08:15:31,881 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:31,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:15:31,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:15:31,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:31,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 08:15:31,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:31,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:31,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493939172] [2019-12-27 08:15:31,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:31,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:31,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:31,962 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 9 states. [2019-12-27 08:15:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:32,562 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-27 08:15:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:32,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:32,571 INFO L225 Difference]: With dead ends: 5889 [2019-12-27 08:15:32,572 INFO L226 Difference]: Without dead ends: 5883 [2019-12-27 08:15:32,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-27 08:15:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-27 08:15:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 08:15:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 08:15:32,651 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 08:15:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:32,651 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 08:15:32,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 08:15:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:32,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:32,653 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:32,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:32,857 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-27 08:15:32,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:32,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349429658] [2019-12-27 08:15:32,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:32,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349429658] [2019-12-27 08:15:32,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326230921] [2019-12-27 08:15:32,944 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:33,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:15:33,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:15:33,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:33,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:33,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:33,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:33,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42614313] [2019-12-27 08:15:33,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:33,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:33,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:33,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:33,057 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 9 states. [2019-12-27 08:15:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:33,777 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-27 08:15:33,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:33,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:33,790 INFO L225 Difference]: With dead ends: 5888 [2019-12-27 08:15:33,790 INFO L226 Difference]: Without dead ends: 5884 [2019-12-27 08:15:33,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-27 08:15:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-27 08:15:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 08:15:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 08:15:33,871 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 08:15:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:33,871 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 08:15:33,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 08:15:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:33,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:33,874 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:34,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:34,077 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-27 08:15:34,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:34,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127369447] [2019-12-27 08:15:34,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:34,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127369447] [2019-12-27 08:15:34,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439872073] [2019-12-27 08:15:34,133 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:34,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:15:34,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:15:34,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:34,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:34,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:34,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:34,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052397042] [2019-12-27 08:15:34,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:34,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:34,215 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 9 states. [2019-12-27 08:15:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:34,805 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-27 08:15:34,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:34,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:34,818 INFO L225 Difference]: With dead ends: 5819 [2019-12-27 08:15:34,818 INFO L226 Difference]: Without dead ends: 5813 [2019-12-27 08:15:34,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-27 08:15:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-27 08:15:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 08:15:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 08:15:34,888 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 08:15:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:34,889 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 08:15:34,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 08:15:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:34,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:34,891 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:35,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:35,094 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-27 08:15:35,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:35,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419659339] [2019-12-27 08:15:35,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:15:35,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419659339] [2019-12-27 08:15:35,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:35,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:35,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250926317] [2019-12-27 08:15:35,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:35,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:35,132 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 08:15:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:35,201 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 08:15:35,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:35,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 08:15:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:35,207 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 08:15:35,207 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 08:15:35,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 08:15:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 08:15:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 08:15:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 08:15:35,240 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 08:15:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:35,240 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 08:15:35,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 08:15:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:35,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:35,242 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:35,242 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-27 08:15:35,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:35,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360137434] [2019-12-27 08:15:35,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:35,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360137434] [2019-12-27 08:15:35,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:35,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:15:35,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975665685] [2019-12-27 08:15:35,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:35,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:35,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:35,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:35,309 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 08:15:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:35,767 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 08:15:35,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:35,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:35,780 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 08:15:35,780 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 08:15:35,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 08:15:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 08:15:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 08:15:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 08:15:35,838 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 08:15:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:35,838 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 08:15:35,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 08:15:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:35,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:35,840 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:35,840 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-27 08:15:35,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:35,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864852867] [2019-12-27 08:15:35,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:35,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864852867] [2019-12-27 08:15:35,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:35,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:15:35,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014864567] [2019-12-27 08:15:35,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:35,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:35,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:35,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:35,893 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 08:15:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:36,437 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 08:15:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:36,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:36,456 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 08:15:36,456 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 08:15:36,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 08:15:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 08:15:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 08:15:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 08:15:36,531 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 08:15:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:36,531 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 08:15:36,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 08:15:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:15:36,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:36,533 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:36,533 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:15:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-27 08:15:36,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:36,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587040001] [2019-12-27 08:15:36,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:15:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:15:36,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:15:36,556 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:15:36,556 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:15:36,556 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 08:15:36,569 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,569 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,569 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,569 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,569 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,570 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,570 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,570 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,570 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,570 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,570 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,570 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,571 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,571 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,571 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,571 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,571 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,571 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,571 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,572 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,572 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,572 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,572 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,572 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,572 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,572 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,573 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,573 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,573 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,573 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,573 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,573 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,573 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,574 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,574 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,574 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,574 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,574 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,574 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,574 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,575 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,575 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,575 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,575 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,575 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,575 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,576 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,576 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,576 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,576 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,576 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,576 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,576 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,577 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,577 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,577 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,577 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,577 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,577 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,577 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,578 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,578 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,578 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,578 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,578 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,578 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,579 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,579 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,579 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,579 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,579 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,579 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,581 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,581 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,581 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,582 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,582 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,582 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,582 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,582 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,582 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,583 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,583 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,585 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,585 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,585 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,585 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,585 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,587 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,587 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,587 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,587 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,587 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,589 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,589 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,589 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,589 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,589 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,590 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,590 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,591 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,591 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,592 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,592 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,592 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,593 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,593 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,593 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,593 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,593 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,594 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,595 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,595 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,595 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,595 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,595 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,595 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,597 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,597 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,597 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,597 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,597 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,597 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,598 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,599 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,599 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,599 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,599 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,599 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,600 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,600 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,600 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,601 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:15:36,602 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 08:15:36,602 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:15:36,602 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:15:36,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:15:36,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:15:36,604 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:15:36,604 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:15:36,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:15:36,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:15:36,605 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-27 08:15:36,606 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 08:15:36,639 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 08:15:36,640 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 08:15:36,642 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-27 08:15:36,649 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 08:15:36,670 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 08:15:36,670 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 08:15:36,673 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-27 08:15:36,683 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-27 08:15:36,683 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:15:38,148 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 08:15:38,576 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-27 08:15:38,577 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 08:15:38,577 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 08:15:38,893 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 08:15:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 08:15:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:15:38,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:38,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:15:38,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:38,894 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-27 08:15:38,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:38,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338394166] [2019-12-27 08:15:38,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:38,916 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 08:15:38,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338394166] [2019-12-27 08:15:38,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:38,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:15:38,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992290907] [2019-12-27 08:15:38,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:15:38,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:15:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:15:38,918 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 08:15:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:38,990 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 08:15:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:15:38,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:15:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:39,003 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 08:15:39,003 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 08:15:39,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 08:15:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 08:15:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 08:15:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 08:15:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 08:15:39,143 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 08:15:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:39,143 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 08:15:39,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:15:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 08:15:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:15:39,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:39,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:39,144 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-27 08:15:39,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:39,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591767081] [2019-12-27 08:15:39,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:15:39,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591767081] [2019-12-27 08:15:39,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:39,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:39,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145422181] [2019-12-27 08:15:39,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:39,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:39,165 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 08:15:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:39,269 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 08:15:39,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:39,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:15:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:39,300 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 08:15:39,300 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 08:15:39,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 08:15:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 08:15:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 08:15:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 08:15:39,439 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 08:15:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:39,440 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 08:15:39,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 08:15:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:15:39,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:39,440 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:39,440 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:39,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-27 08:15:39,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:39,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490693032] [2019-12-27 08:15:39,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:39,464 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 08:15:39,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490693032] [2019-12-27 08:15:39,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:39,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:39,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060098406] [2019-12-27 08:15:39,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:39,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:39,466 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 08:15:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:39,580 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 08:15:39,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:39,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:15:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:39,619 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 08:15:39,619 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 08:15:39,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 08:15:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 08:15:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 08:15:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 08:15:40,390 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 08:15:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:40,390 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 08:15:40,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 08:15:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:15:40,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:40,391 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:40,391 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-27 08:15:40,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:40,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148749953] [2019-12-27 08:15:40,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:15:40,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148749953] [2019-12-27 08:15:40,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053591048] [2019-12-27 08:15:40,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:40,497 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:40,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:15:40,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:40,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:15:40,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475445910] [2019-12-27 08:15:40,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:40,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:40,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:40,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:40,501 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 7 states. [2019-12-27 08:15:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:40,749 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-27 08:15:40,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:40,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:15:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:40,784 INFO L225 Difference]: With dead ends: 16250 [2019-12-27 08:15:40,785 INFO L226 Difference]: Without dead ends: 16246 [2019-12-27 08:15:40,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-27 08:15:40,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-27 08:15:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 08:15:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 08:15:40,996 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 08:15:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:40,996 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 08:15:40,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 08:15:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:15:40,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:40,996 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:41,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:41,197 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-27 08:15:41,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:41,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643130853] [2019-12-27 08:15:41,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:41,238 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 08:15:41,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643130853] [2019-12-27 08:15:41,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:41,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:41,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977818784] [2019-12-27 08:15:41,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:41,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:41,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:41,241 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 08:15:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:41,650 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 08:15:41,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:41,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:15:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:41,688 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 08:15:41,688 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 08:15:41,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 08:15:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 08:15:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 08:15:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 08:15:41,879 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 08:15:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:41,879 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 08:15:41,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 08:15:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:15:41,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:41,880 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:41,880 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-27 08:15:41,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:41,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155631849] [2019-12-27 08:15:41,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:41,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155631849] [2019-12-27 08:15:41,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:41,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:41,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911552427] [2019-12-27 08:15:41,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:41,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:41,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:41,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:41,910 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 08:15:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:42,023 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 08:15:42,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:42,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:15:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:42,052 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 08:15:42,052 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 08:15:42,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 08:15:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 08:15:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 08:15:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 08:15:42,225 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 08:15:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:42,225 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 08:15:42,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 08:15:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:15:42,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:42,227 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:42,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:42,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:42,227 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-27 08:15:42,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:42,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369225079] [2019-12-27 08:15:42,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:42,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369225079] [2019-12-27 08:15:42,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749874478] [2019-12-27 08:15:42,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:42,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:42,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:42,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:42,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:15:42,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780610009] [2019-12-27 08:15:42,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:42,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:42,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:42,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:42,347 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 7 states. [2019-12-27 08:15:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:42,740 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-27 08:15:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:42,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:15:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:42,781 INFO L225 Difference]: With dead ends: 18509 [2019-12-27 08:15:42,781 INFO L226 Difference]: Without dead ends: 18503 [2019-12-27 08:15:42,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-27 08:15:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-27 08:15:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 08:15:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 08:15:43,000 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 08:15:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:43,000 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 08:15:43,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 08:15:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:15:43,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:43,001 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:43,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:43,202 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-27 08:15:43,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:43,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779730796] [2019-12-27 08:15:43,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:43,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779730796] [2019-12-27 08:15:43,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777633584] [2019-12-27 08:15:43,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:43,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:43,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:43,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:43,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:15:43,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427171573] [2019-12-27 08:15:43,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:43,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:43,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:43,316 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 08:15:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:43,655 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-27 08:15:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:43,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:15:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:43,736 INFO L225 Difference]: With dead ends: 19158 [2019-12-27 08:15:43,736 INFO L226 Difference]: Without dead ends: 19149 [2019-12-27 08:15:43,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-27 08:15:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-27 08:15:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-27 08:15:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-27 08:15:44,114 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-27 08:15:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:44,114 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-27 08:15:44,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-27 08:15:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:15:44,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:44,116 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:44,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:44,320 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:44,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:44,320 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-27 08:15:44,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:44,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981694014] [2019-12-27 08:15:44,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:44,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981694014] [2019-12-27 08:15:44,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:44,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:44,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131434636] [2019-12-27 08:15:44,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:44,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:44,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:44,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:44,358 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-27 08:15:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:44,717 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-27 08:15:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:44,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:15:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:44,759 INFO L225 Difference]: With dead ends: 19350 [2019-12-27 08:15:44,760 INFO L226 Difference]: Without dead ends: 19341 [2019-12-27 08:15:44,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-27 08:15:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-27 08:15:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-27 08:15:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-27 08:15:45,001 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-27 08:15:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:45,001 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-27 08:15:45,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-27 08:15:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:15:45,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:45,002 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:45,002 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-27 08:15:45,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:45,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551255115] [2019-12-27 08:15:45,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:45,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551255115] [2019-12-27 08:15:45,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:45,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:45,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182533201] [2019-12-27 08:15:45,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:45,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:45,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:45,054 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-27 08:15:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:45,301 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 08:15:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:45,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:15:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:45,342 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 08:15:45,342 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 08:15:45,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 08:15:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 08:15:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 08:15:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 08:15:45,582 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 08:15:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:45,582 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 08:15:45,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 08:15:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:45,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:45,584 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:45,584 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:45,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-27 08:15:45,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:45,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714070095] [2019-12-27 08:15:45,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:45,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714070095] [2019-12-27 08:15:45,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702061476] [2019-12-27 08:15:45,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:45,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:45,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:45,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:45,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:45,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525032772] [2019-12-27 08:15:45,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:45,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:45,730 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 9 states. [2019-12-27 08:15:46,095 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-27 08:15:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:46,461 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-27 08:15:46,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:46,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:46,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:46,517 INFO L225 Difference]: With dead ends: 26399 [2019-12-27 08:15:46,517 INFO L226 Difference]: Without dead ends: 26395 [2019-12-27 08:15:46,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-27 08:15:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 7999. [2019-12-27 08:15:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-27 08:15:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-27 08:15:46,803 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-27 08:15:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:46,803 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-27 08:15:46,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-27 08:15:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:46,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:46,805 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:47,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:47,005 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-27 08:15:47,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:47,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920891109] [2019-12-27 08:15:47,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:47,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920891109] [2019-12-27 08:15:47,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169855453] [2019-12-27 08:15:47,061 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:47,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:15:47,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:15:47,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:47,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:47,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:47,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:47,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227805202] [2019-12-27 08:15:47,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:47,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:47,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:47,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:47,153 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 9 states. [2019-12-27 08:15:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:47,746 INFO L93 Difference]: Finished difference Result 26109 states and 99244 transitions. [2019-12-27 08:15:47,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:47,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:47,802 INFO L225 Difference]: With dead ends: 26109 [2019-12-27 08:15:47,802 INFO L226 Difference]: Without dead ends: 26103 [2019-12-27 08:15:47,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26103 states. [2019-12-27 08:15:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26103 to 7893. [2019-12-27 08:15:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 08:15:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 08:15:48,323 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 08:15:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:48,323 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 08:15:48,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 08:15:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:48,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:48,324 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:48,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:48,525 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-27 08:15:48,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:48,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919434719] [2019-12-27 08:15:48,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:48,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919434719] [2019-12-27 08:15:48,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319121492] [2019-12-27 08:15:48,602 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:48,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:15:48,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:15:48,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:48,670 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:48,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:48,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:48,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737717282] [2019-12-27 08:15:48,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:48,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:48,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:48,675 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-27 08:15:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:49,303 INFO L93 Difference]: Finished difference Result 26144 states and 99382 transitions. [2019-12-27 08:15:49,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:49,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:49,365 INFO L225 Difference]: With dead ends: 26144 [2019-12-27 08:15:49,365 INFO L226 Difference]: Without dead ends: 26140 [2019-12-27 08:15:49,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26140 states. [2019-12-27 08:15:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26140 to 7675. [2019-12-27 08:15:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-27 08:15:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-27 08:15:49,629 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-27 08:15:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:49,629 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-27 08:15:49,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-27 08:15:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:49,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:49,630 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:49,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:49,831 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-27 08:15:49,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:49,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784189157] [2019-12-27 08:15:49,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:49,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784189157] [2019-12-27 08:15:49,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086609123] [2019-12-27 08:15:49,878 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:49,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:15:49,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:15:49,964 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:49,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 08:15:49,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:49,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:49,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382945899] [2019-12-27 08:15:49,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:49,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:49,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:49,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:49,978 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 9 states. [2019-12-27 08:15:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:50,527 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-27 08:15:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:50,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:50,585 INFO L225 Difference]: With dead ends: 25959 [2019-12-27 08:15:50,585 INFO L226 Difference]: Without dead ends: 25953 [2019-12-27 08:15:50,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-27 08:15:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-27 08:15:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-27 08:15:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-27 08:15:51,046 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-27 08:15:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:51,046 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-27 08:15:51,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-27 08:15:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:51,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:51,047 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:51,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:51,248 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-27 08:15:51,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:51,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547617699] [2019-12-27 08:15:51,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:15:51,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547617699] [2019-12-27 08:15:51,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:51,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:15:51,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869686534] [2019-12-27 08:15:51,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:15:51,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:15:51,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:15:51,273 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-27 08:15:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:51,400 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-27 08:15:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:15:51,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 08:15:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:51,431 INFO L225 Difference]: With dead ends: 12952 [2019-12-27 08:15:51,432 INFO L226 Difference]: Without dead ends: 12936 [2019-12-27 08:15:51,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-27 08:15:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-27 08:15:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-27 08:15:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-27 08:15:51,628 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-27 08:15:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:51,629 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-27 08:15:51,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:15:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-27 08:15:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:51,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:51,630 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:51,630 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-27 08:15:51,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:51,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236767856] [2019-12-27 08:15:51,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:51,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236767856] [2019-12-27 08:15:51,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:51,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:15:51,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831352376] [2019-12-27 08:15:51,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:51,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:51,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:51,679 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-27 08:15:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:52,279 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-27 08:15:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:52,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:52,345 INFO L225 Difference]: With dead ends: 29252 [2019-12-27 08:15:52,345 INFO L226 Difference]: Without dead ends: 29245 [2019-12-27 08:15:52,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-27 08:15:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-27 08:15:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 08:15:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-27 08:15:52,690 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-27 08:15:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:52,690 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-27 08:15:52,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-27 08:15:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:15:52,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:52,692 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:52,692 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-27 08:15:52,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:52,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177043113] [2019-12-27 08:15:52,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:52,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177043113] [2019-12-27 08:15:52,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:52,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:15:52,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972888952] [2019-12-27 08:15:52,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:52,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:52,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:52,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:52,748 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-27 08:15:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:53,784 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-27 08:15:53,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:53,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:15:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:53,873 INFO L225 Difference]: With dead ends: 28866 [2019-12-27 08:15:53,873 INFO L226 Difference]: Without dead ends: 28856 [2019-12-27 08:15:53,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-27 08:15:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-27 08:15:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 08:15:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 08:15:54,172 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 08:15:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:54,173 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 08:15:54,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:15:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 08:15:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:15:54,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:54,175 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:54,175 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-27 08:15:54,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:54,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468713892] [2019-12-27 08:15:54,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:54,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468713892] [2019-12-27 08:15:54,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056481030] [2019-12-27 08:15:54,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:54,284 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:54,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:54,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:54,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:15:54,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311157528] [2019-12-27 08:15:54,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:54,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:54,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:54,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:54,288 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 7 states. [2019-12-27 08:15:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:54,586 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-27 08:15:54,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:54,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:15:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:54,630 INFO L225 Difference]: With dead ends: 19371 [2019-12-27 08:15:54,630 INFO L226 Difference]: Without dead ends: 19359 [2019-12-27 08:15:54,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-27 08:15:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-27 08:15:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 08:15:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 08:15:54,869 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 08:15:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:54,869 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 08:15:54,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 08:15:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:15:54,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:54,871 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:55,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:55,072 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-27 08:15:55,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:55,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487946635] [2019-12-27 08:15:55,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:15:55,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487946635] [2019-12-27 08:15:55,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122487219] [2019-12-27 08:15:55,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:55,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:15:55,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:15:55,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:55,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:15:55,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235356405] [2019-12-27 08:15:55,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:55,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:55,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:55,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:55,196 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 7 states. [2019-12-27 08:15:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:55,482 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-27 08:15:55,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:55,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:15:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:55,525 INFO L225 Difference]: With dead ends: 20331 [2019-12-27 08:15:55,526 INFO L226 Difference]: Without dead ends: 20317 [2019-12-27 08:15:55,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-27 08:15:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-27 08:15:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-27 08:15:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-27 08:15:56,016 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-27 08:15:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:56,016 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-27 08:15:56,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-27 08:15:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:15:56,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:56,018 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:56,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:56,220 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-27 08:15:56,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:56,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419852554] [2019-12-27 08:15:56,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:15:56,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419852554] [2019-12-27 08:15:56,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:56,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:56,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211256531] [2019-12-27 08:15:56,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:56,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:56,260 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-27 08:15:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:56,529 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-27 08:15:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:56,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:15:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:56,573 INFO L225 Difference]: With dead ends: 20594 [2019-12-27 08:15:56,573 INFO L226 Difference]: Without dead ends: 20575 [2019-12-27 08:15:56,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-27 08:15:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-27 08:15:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-27 08:15:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-27 08:15:56,814 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-27 08:15:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:56,814 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-27 08:15:56,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-27 08:15:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:15:56,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:56,816 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:56,816 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:56,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-27 08:15:56,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:56,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023860618] [2019-12-27 08:15:56,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:15:56,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023860618] [2019-12-27 08:15:56,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:56,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:56,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058486767] [2019-12-27 08:15:56,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:56,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:56,862 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-27 08:15:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:57,131 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-27 08:15:57,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:57,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:15:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:57,174 INFO L225 Difference]: With dead ends: 20360 [2019-12-27 08:15:57,174 INFO L226 Difference]: Without dead ends: 20341 [2019-12-27 08:15:57,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-27 08:15:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-27 08:15:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 08:15:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-27 08:15:57,416 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-27 08:15:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:57,416 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-27 08:15:57,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-27 08:15:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:15:57,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:57,418 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:57,418 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-27 08:15:57,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:57,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866265462] [2019-12-27 08:15:57,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:15:57,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866265462] [2019-12-27 08:15:57,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:57,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:57,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203904675] [2019-12-27 08:15:57,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:57,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:57,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:57,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:57,457 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-27 08:15:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:57,719 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-27 08:15:57,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:57,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:15:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:57,766 INFO L225 Difference]: With dead ends: 20740 [2019-12-27 08:15:57,766 INFO L226 Difference]: Without dead ends: 20721 [2019-12-27 08:15:57,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-27 08:15:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-27 08:15:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-27 08:15:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-27 08:15:58,018 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-27 08:15:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:58,019 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-27 08:15:58,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-27 08:15:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:15:58,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:58,021 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:58,021 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-27 08:15:58,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:58,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263246923] [2019-12-27 08:15:58,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:15:58,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263246923] [2019-12-27 08:15:58,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:15:58,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:15:58,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371470686] [2019-12-27 08:15:58,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:15:58,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:15:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:15:58,064 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 7 states. [2019-12-27 08:15:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:58,376 INFO L93 Difference]: Finished difference Result 20896 states and 85782 transitions. [2019-12-27 08:15:58,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:15:58,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:15:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:58,432 INFO L225 Difference]: With dead ends: 20896 [2019-12-27 08:15:58,433 INFO L226 Difference]: Without dead ends: 20877 [2019-12-27 08:15:58,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:15:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-12-27 08:15:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 9286. [2019-12-27 08:15:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 08:15:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 08:15:58,841 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 08:15:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:58,841 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 08:15:58,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:15:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 08:15:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:15:58,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:15:58,845 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:15:58,845 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:15:58,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:15:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-27 08:15:58,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:15:58,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967393346] [2019-12-27 08:15:58,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:15:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:58,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967393346] [2019-12-27 08:15:58,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570507846] [2019-12-27 08:15:58,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:15:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:15:58,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:15:58,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:15:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:15:58,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:15:58,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:15:58,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95614540] [2019-12-27 08:15:58,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:15:58,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:15:58,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:15:58,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:15:58,989 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 9 states. [2019-12-27 08:15:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:15:59,593 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-27 08:15:59,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:15:59,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:15:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:15:59,668 INFO L225 Difference]: With dead ends: 29793 [2019-12-27 08:15:59,668 INFO L226 Difference]: Without dead ends: 29783 [2019-12-27 08:15:59,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:15:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-27 08:15:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9200. [2019-12-27 08:15:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-27 08:15:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-27 08:15:59,999 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-27 08:15:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:15:59,999 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-27 08:15:59,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-27 08:16:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:00,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:00,003 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:00,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:00,204 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-27 08:16:00,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:00,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648625982] [2019-12-27 08:16:00,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:00,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648625982] [2019-12-27 08:16:00,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066128274] [2019-12-27 08:16:00,260 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:00,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:16:00,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:16:00,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:00,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:00,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:00,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:00,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412803388] [2019-12-27 08:16:00,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:00,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:00,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:00,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:00,390 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 9 states. [2019-12-27 08:16:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:01,146 INFO L93 Difference]: Finished difference Result 29319 states and 113201 transitions. [2019-12-27 08:16:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:01,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:01,207 INFO L225 Difference]: With dead ends: 29319 [2019-12-27 08:16:01,208 INFO L226 Difference]: Without dead ends: 29308 [2019-12-27 08:16:01,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29308 states. [2019-12-27 08:16:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29308 to 9197. [2019-12-27 08:16:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-27 08:16:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-27 08:16:01,529 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-27 08:16:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:01,529 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-27 08:16:01,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-27 08:16:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:01,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:01,532 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:01,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:01,733 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-27 08:16:01,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:01,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542294822] [2019-12-27 08:16:01,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:01,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542294822] [2019-12-27 08:16:01,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187946939] [2019-12-27 08:16:01,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:01,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:01,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:01,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:01,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:01,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46669892] [2019-12-27 08:16:01,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:01,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:01,996 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 9 states. [2019-12-27 08:16:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:02,602 INFO L93 Difference]: Finished difference Result 28997 states and 111934 transitions. [2019-12-27 08:16:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:02,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:02,667 INFO L225 Difference]: With dead ends: 28997 [2019-12-27 08:16:02,667 INFO L226 Difference]: Without dead ends: 28987 [2019-12-27 08:16:02,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28987 states. [2019-12-27 08:16:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28987 to 9121. [2019-12-27 08:16:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-27 08:16:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-27 08:16:03,000 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-27 08:16:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:03,001 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-27 08:16:03,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-27 08:16:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:03,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:03,004 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:03,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:03,205 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-27 08:16:03,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:03,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101678339] [2019-12-27 08:16:03,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:03,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:03,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101678339] [2019-12-27 08:16:03,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123621692] [2019-12-27 08:16:03,259 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:03,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:16:03,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:16:03,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:03,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:03,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:03,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:03,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186684171] [2019-12-27 08:16:03,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:03,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:03,343 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 9 states. [2019-12-27 08:16:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:03,954 INFO L93 Difference]: Finished difference Result 28781 states and 111002 transitions. [2019-12-27 08:16:03,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:03,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:04,015 INFO L225 Difference]: With dead ends: 28781 [2019-12-27 08:16:04,016 INFO L226 Difference]: Without dead ends: 28770 [2019-12-27 08:16:04,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-27 08:16:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 9044. [2019-12-27 08:16:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 08:16:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 08:16:04,328 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 08:16:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:04,328 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 08:16:04,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 08:16:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:04,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:04,332 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:04,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:04,532 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:04,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:04,533 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-27 08:16:04,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:04,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083697692] [2019-12-27 08:16:04,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 08:16:04,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083697692] [2019-12-27 08:16:04,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572753142] [2019-12-27 08:16:04,580 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:04,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 08:16:04,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:16:04,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:04,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 08:16:04,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:04,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:04,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590154855] [2019-12-27 08:16:04,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:04,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:04,664 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 9 states. [2019-12-27 08:16:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:05,247 INFO L93 Difference]: Finished difference Result 28747 states and 110799 transitions. [2019-12-27 08:16:05,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:05,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:05,307 INFO L225 Difference]: With dead ends: 28747 [2019-12-27 08:16:05,307 INFO L226 Difference]: Without dead ends: 28737 [2019-12-27 08:16:05,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-12-27 08:16:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 8874. [2019-12-27 08:16:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-27 08:16:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-27 08:16:05,786 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-27 08:16:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:05,786 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-27 08:16:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-27 08:16:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:05,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:05,789 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:05,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:05,991 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-27 08:16:05,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:05,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250019323] [2019-12-27 08:16:05,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:16:06,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250019323] [2019-12-27 08:16:06,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720421273] [2019-12-27 08:16:06,038 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:06,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:16:06,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:16:06,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:06,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:16:06,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:06,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:06,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717393649] [2019-12-27 08:16:06,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:06,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:06,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:06,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:06,120 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 9 states. [2019-12-27 08:16:06,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:06,764 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-27 08:16:06,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:06,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:06,824 INFO L225 Difference]: With dead ends: 28993 [2019-12-27 08:16:06,824 INFO L226 Difference]: Without dead ends: 28982 [2019-12-27 08:16:06,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-27 08:16:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-27 08:16:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-27 08:16:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-27 08:16:07,134 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-27 08:16:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:07,134 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-27 08:16:07,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-27 08:16:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:07,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:07,137 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:07,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:07,338 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-27 08:16:07,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:07,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075264805] [2019-12-27 08:16:07,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:16:07,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075264805] [2019-12-27 08:16:07,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019540377] [2019-12-27 08:16:07,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:07,454 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:07,455 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:16:07,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:07,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:07,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758209857] [2019-12-27 08:16:07,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:07,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:07,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:07,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:07,459 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 9 states. [2019-12-27 08:16:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:08,097 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-27 08:16:08,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:08,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:08,160 INFO L225 Difference]: With dead ends: 28840 [2019-12-27 08:16:08,160 INFO L226 Difference]: Without dead ends: 28830 [2019-12-27 08:16:08,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-27 08:16:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-27 08:16:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-27 08:16:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-27 08:16:08,461 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-27 08:16:08,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:08,461 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-27 08:16:08,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-27 08:16:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:08,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:08,464 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:08,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:08,665 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-27 08:16:08,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:08,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770569579] [2019-12-27 08:16:08,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:16:08,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770569579] [2019-12-27 08:16:08,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46717582] [2019-12-27 08:16:08,724 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:08,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:16:08,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:16:08,795 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:08,796 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:16:08,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:08,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:08,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742245802] [2019-12-27 08:16:08,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:08,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:08,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:08,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:08,801 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 9 states. [2019-12-27 08:16:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:09,456 INFO L93 Difference]: Finished difference Result 28552 states and 110204 transitions. [2019-12-27 08:16:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:09,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:09,520 INFO L225 Difference]: With dead ends: 28552 [2019-12-27 08:16:09,520 INFO L226 Difference]: Without dead ends: 28538 [2019-12-27 08:16:09,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2019-12-27 08:16:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8722. [2019-12-27 08:16:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 08:16:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-27 08:16:09,965 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-27 08:16:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:09,965 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-27 08:16:09,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-27 08:16:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:09,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:09,970 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:10,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:10,173 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-27 08:16:10,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:10,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237547799] [2019-12-27 08:16:10,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:10,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237547799] [2019-12-27 08:16:10,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:10,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:10,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586919391] [2019-12-27 08:16:10,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:10,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:10,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:10,222 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-27 08:16:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:10,840 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-27 08:16:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:10,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:10,899 INFO L225 Difference]: With dead ends: 28362 [2019-12-27 08:16:10,899 INFO L226 Difference]: Without dead ends: 28352 [2019-12-27 08:16:10,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-27 08:16:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-27 08:16:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-27 08:16:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-27 08:16:11,199 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-27 08:16:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:11,199 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-27 08:16:11,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-27 08:16:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:11,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:11,202 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:11,203 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-27 08:16:11,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:11,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230619281] [2019-12-27 08:16:11,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:11,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230619281] [2019-12-27 08:16:11,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:11,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:11,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287465490] [2019-12-27 08:16:11,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:11,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:11,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:11,273 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-27 08:16:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:11,975 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-27 08:16:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:11,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:12,034 INFO L225 Difference]: With dead ends: 28156 [2019-12-27 08:16:12,034 INFO L226 Difference]: Without dead ends: 28146 [2019-12-27 08:16:12,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-27 08:16:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-27 08:16:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-27 08:16:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-27 08:16:12,322 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-27 08:16:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:12,322 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-27 08:16:12,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-27 08:16:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:12,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:12,325 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:12,325 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:12,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-27 08:16:12,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:12,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052796536] [2019-12-27 08:16:12,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:12,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052796536] [2019-12-27 08:16:12,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:12,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:12,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316902362] [2019-12-27 08:16:12,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:12,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:12,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:12,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:12,381 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-27 08:16:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:12,958 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-27 08:16:12,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:12,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:13,016 INFO L225 Difference]: With dead ends: 27714 [2019-12-27 08:16:13,016 INFO L226 Difference]: Without dead ends: 27700 [2019-12-27 08:16:13,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-27 08:16:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-27 08:16:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-27 08:16:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-27 08:16:13,303 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-27 08:16:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:13,303 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-27 08:16:13,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-27 08:16:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:13,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:13,307 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:13,307 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-27 08:16:13,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:13,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424350447] [2019-12-27 08:16:13,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:13,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424350447] [2019-12-27 08:16:13,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:13,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:13,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712393927] [2019-12-27 08:16:13,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:13,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:13,357 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-27 08:16:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:14,019 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-27 08:16:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:14,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:14,077 INFO L225 Difference]: With dead ends: 27553 [2019-12-27 08:16:14,077 INFO L226 Difference]: Without dead ends: 27543 [2019-12-27 08:16:14,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-27 08:16:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-27 08:16:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-27 08:16:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-27 08:16:14,474 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-27 08:16:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:14,474 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-27 08:16:14,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-27 08:16:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:14,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:14,477 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:14,477 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-27 08:16:14,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:14,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291930001] [2019-12-27 08:16:14,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:14,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291930001] [2019-12-27 08:16:14,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:14,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:14,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488285050] [2019-12-27 08:16:14,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:14,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:14,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:14,523 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-27 08:16:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:15,134 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-27 08:16:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:15,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:15,196 INFO L225 Difference]: With dead ends: 27570 [2019-12-27 08:16:15,196 INFO L226 Difference]: Without dead ends: 27556 [2019-12-27 08:16:15,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-27 08:16:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-27 08:16:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-27 08:16:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-27 08:16:15,479 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-27 08:16:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:15,480 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-27 08:16:15,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-27 08:16:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:15,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:15,483 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:15,483 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:15,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:15,484 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-27 08:16:15,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:15,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541279398] [2019-12-27 08:16:15,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:15,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541279398] [2019-12-27 08:16:15,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:15,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:15,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983676648] [2019-12-27 08:16:15,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:15,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:15,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:15,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:15,530 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-27 08:16:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:16,125 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-27 08:16:16,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:16,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:16,182 INFO L225 Difference]: With dead ends: 27265 [2019-12-27 08:16:16,182 INFO L226 Difference]: Without dead ends: 27251 [2019-12-27 08:16:16,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-27 08:16:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-27 08:16:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-27 08:16:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-27 08:16:16,456 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-27 08:16:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:16,457 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-27 08:16:16,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-27 08:16:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:16,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:16,459 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:16,460 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-27 08:16:16,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:16,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793915077] [2019-12-27 08:16:16,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 08:16:16,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793915077] [2019-12-27 08:16:16,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:16,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:16:16,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400591127] [2019-12-27 08:16:16,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:16:16,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:16,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:16:16,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:16:16,488 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-27 08:16:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:16,602 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-27 08:16:16,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:16:16,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 08:16:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:16,630 INFO L225 Difference]: With dead ends: 12944 [2019-12-27 08:16:16,630 INFO L226 Difference]: Without dead ends: 12912 [2019-12-27 08:16:16,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-27 08:16:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-27 08:16:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-27 08:16:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-27 08:16:16,812 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-27 08:16:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:16,813 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-27 08:16:16,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:16:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-27 08:16:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:16,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:16,816 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:16,816 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-27 08:16:16,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:16,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498139567] [2019-12-27 08:16:16,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:16,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498139567] [2019-12-27 08:16:16,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:16,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:16,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650581369] [2019-12-27 08:16:16,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:16,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:16,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:16,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:16,861 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 9 states. [2019-12-27 08:16:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:17,568 INFO L93 Difference]: Finished difference Result 30802 states and 119509 transitions. [2019-12-27 08:16:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:17,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:17,667 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 08:16:17,668 INFO L226 Difference]: Without dead ends: 30786 [2019-12-27 08:16:17,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30786 states. [2019-12-27 08:16:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30786 to 9188. [2019-12-27 08:16:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-27 08:16:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-27 08:16:18,163 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-27 08:16:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:18,163 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-27 08:16:18,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-27 08:16:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:18,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:18,166 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:18,166 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-27 08:16:18,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:18,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997567129] [2019-12-27 08:16:18,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:18,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997567129] [2019-12-27 08:16:18,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:18,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:18,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930513721] [2019-12-27 08:16:18,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:18,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:18,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:18,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:18,207 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 9 states. [2019-12-27 08:16:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:18,781 INFO L93 Difference]: Finished difference Result 30412 states and 117823 transitions. [2019-12-27 08:16:18,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:18,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:18,844 INFO L225 Difference]: With dead ends: 30412 [2019-12-27 08:16:18,845 INFO L226 Difference]: Without dead ends: 30392 [2019-12-27 08:16:18,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30392 states. [2019-12-27 08:16:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30392 to 8937. [2019-12-27 08:16:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-27 08:16:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-27 08:16:19,160 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-27 08:16:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:19,160 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-27 08:16:19,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-27 08:16:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:19,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:19,163 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:19,163 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-27 08:16:19,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:19,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224548886] [2019-12-27 08:16:19,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:19,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224548886] [2019-12-27 08:16:19,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:19,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:19,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150821576] [2019-12-27 08:16:19,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:19,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:19,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:19,213 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 9 states. [2019-12-27 08:16:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:19,862 INFO L93 Difference]: Finished difference Result 30029 states and 116246 transitions. [2019-12-27 08:16:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:19,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:19,925 INFO L225 Difference]: With dead ends: 30029 [2019-12-27 08:16:19,925 INFO L226 Difference]: Without dead ends: 30013 [2019-12-27 08:16:19,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-27 08:16:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 8839. [2019-12-27 08:16:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-27 08:16:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-27 08:16:20,231 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-27 08:16:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:20,232 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-27 08:16:20,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-27 08:16:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:16:20,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:20,235 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:20,235 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:20,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:20,235 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-27 08:16:20,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:20,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992824143] [2019-12-27 08:16:20,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:20,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992824143] [2019-12-27 08:16:20,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:20,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:20,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062444001] [2019-12-27 08:16:20,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:20,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:20,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:20,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:20,299 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 9 states. [2019-12-27 08:16:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:20,975 INFO L93 Difference]: Finished difference Result 29761 states and 115069 transitions. [2019-12-27 08:16:20,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:20,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:16:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:21,037 INFO L225 Difference]: With dead ends: 29761 [2019-12-27 08:16:21,037 INFO L226 Difference]: Without dead ends: 29741 [2019-12-27 08:16:21,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29741 states. [2019-12-27 08:16:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29741 to 8516. [2019-12-27 08:16:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 08:16:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 08:16:21,347 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 08:16:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:21,347 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 08:16:21,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 08:16:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:16:21,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:21,351 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:21,351 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-27 08:16:21,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:21,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769101069] [2019-12-27 08:16:21,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:16:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:16:21,368 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:16:21,369 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:16:21,369 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:16:21,369 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 08:16:21,383 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,383 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,384 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,384 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,385 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,385 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,385 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,385 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,385 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,385 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,385 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,387 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,387 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,387 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,387 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,387 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,387 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,387 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,388 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,388 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,388 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,389 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,389 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,389 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,389 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,389 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,389 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,389 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,389 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,390 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,390 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,391 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,391 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,391 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,391 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,391 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,391 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,391 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,391 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,392 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,392 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,392 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,401 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,401 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,401 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,402 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,402 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,403 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,403 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,403 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,403 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,403 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,404 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,405 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,405 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,405 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,405 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,406 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,406 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,406 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,406 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,406 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,407 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,408 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,408 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,408 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,408 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,409 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,409 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,409 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,409 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,410 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,410 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,414 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,414 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,416 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,416 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,417 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,418 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,420 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,420 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:16:21,421 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 08:16:21,421 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:16:21,421 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:16:21,421 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:16:21,421 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:16:21,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:16:21,422 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:16:21,422 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:16:21,422 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:16:21,424 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-27 08:16:21,424 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 08:16:21,454 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 08:16:21,454 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 08:16:21,458 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-27 08:16:21,468 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 08:16:21,497 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 08:16:21,497 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 08:16:21,501 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-27 08:16:21,511 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-27 08:16:21,512 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:16:23,418 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 08:16:23,581 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-27 08:16:23,581 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 08:16:23,582 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 08:16:24,789 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 08:16:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 08:16:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:16:24,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:24,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:16:24,789 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-27 08:16:24,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:24,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352531225] [2019-12-27 08:16:24,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:24,797 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 08:16:24,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352531225] [2019-12-27 08:16:24,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:24,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:16:24,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007239436] [2019-12-27 08:16:24,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:16:24,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:16:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:16:24,798 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 08:16:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:24,914 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 08:16:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:16:24,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:16:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:24,960 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 08:16:24,961 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 08:16:24,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 08:16:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 08:16:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 08:16:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 08:16:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 08:16:25,323 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 08:16:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:25,323 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 08:16:25,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:16:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 08:16:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:16:25,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:25,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:25,324 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-27 08:16:25,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:25,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519767795] [2019-12-27 08:16:25,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:25,340 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 08:16:25,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519767795] [2019-12-27 08:16:25,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:25,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:16:25,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385952802] [2019-12-27 08:16:25,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:16:25,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:25,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:16:25,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:16:25,342 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 08:16:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:25,539 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 08:16:25,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:16:25,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:16:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:25,622 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 08:16:25,622 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 08:16:25,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 08:16:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 08:16:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 08:16:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 08:16:26,152 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 08:16:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:26,153 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 08:16:26,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:16:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 08:16:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:16:26,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:26,153 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:26,153 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-27 08:16:26,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:26,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242610031] [2019-12-27 08:16:26,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:26,169 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 08:16:26,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242610031] [2019-12-27 08:16:26,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:26,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:16:26,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622065263] [2019-12-27 08:16:26,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:16:26,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:16:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:16:26,171 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 08:16:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:26,400 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 08:16:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:16:26,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:16:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:26,498 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 08:16:26,499 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 08:16:26,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 08:16:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 08:16:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 08:16:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 08:16:28,925 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 08:16:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:28,925 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 08:16:28,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:16:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 08:16:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:16:28,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:28,926 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:28,926 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-27 08:16:28,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:28,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357393330] [2019-12-27 08:16:28,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:16:28,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357393330] [2019-12-27 08:16:28,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958247138] [2019-12-27 08:16:28,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:29,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:16:29,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:16:29,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:29,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:16:29,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789032486] [2019-12-27 08:16:29,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:16:29,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:29,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:16:29,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:29,059 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 7 states. [2019-12-27 08:16:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:29,528 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-27 08:16:29,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:16:29,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:16:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:29,684 INFO L225 Difference]: With dead ends: 54752 [2019-12-27 08:16:29,684 INFO L226 Difference]: Without dead ends: 54748 [2019-12-27 08:16:29,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:16:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-27 08:16:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-27 08:16:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 08:16:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 08:16:30,496 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 08:16:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:30,496 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 08:16:30,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:16:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 08:16:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:16:30,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:30,497 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:30,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:30,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-27 08:16:30,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:30,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586043300] [2019-12-27 08:16:30,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:30,726 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 08:16:30,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586043300] [2019-12-27 08:16:30,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:30,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:16:30,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569556591] [2019-12-27 08:16:30,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:16:30,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:30,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:16:30,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:30,728 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 08:16:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:31,176 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 08:16:31,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:16:31,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:16:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:31,333 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 08:16:31,333 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 08:16:31,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:16:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 08:16:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 08:16:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 08:16:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 08:16:34,885 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 08:16:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:34,885 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 08:16:34,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:16:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 08:16:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:16:34,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:34,886 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:34,886 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:34,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:34,886 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-27 08:16:34,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:34,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134972988] [2019-12-27 08:16:34,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:34,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134972988] [2019-12-27 08:16:34,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:34,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:16:34,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128490607] [2019-12-27 08:16:34,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:16:34,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:34,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:16:34,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:16:34,905 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 08:16:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:35,178 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 08:16:35,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:16:35,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:16:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:35,298 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 08:16:35,298 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 08:16:35,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 08:16:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 08:16:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 08:16:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 08:16:36,050 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 08:16:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:36,050 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 08:16:36,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:16:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 08:16:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:16:36,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:36,051 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:36,051 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-27 08:16:36,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:36,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155010559] [2019-12-27 08:16:36,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 08:16:36,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155010559] [2019-12-27 08:16:36,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830557216] [2019-12-27 08:16:36,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:36,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:16:36,164 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 08:16:36,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:36,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:16:36,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350181635] [2019-12-27 08:16:36,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:16:36,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:36,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:16:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:36,168 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 7 states. [2019-12-27 08:16:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:36,694 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-27 08:16:36,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:16:36,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:16:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:36,877 INFO L225 Difference]: With dead ends: 64531 [2019-12-27 08:16:36,877 INFO L226 Difference]: Without dead ends: 64525 [2019-12-27 08:16:36,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:16:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-27 08:16:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-27 08:16:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 08:16:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 08:16:37,874 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 08:16:37,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:37,874 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 08:16:37,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:16:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 08:16:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:16:37,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:37,875 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:38,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16: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, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-27 08:16:38,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:38,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831668981] [2019-12-27 08:16:38,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:38,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831668981] [2019-12-27 08:16:38,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:38,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:16:38,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061802935] [2019-12-27 08:16:38,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:16:38,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:16:38,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:38,108 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-27 08:16:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:38,938 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-27 08:16:38,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:16:38,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:16:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:39,130 INFO L225 Difference]: With dead ends: 66182 [2019-12-27 08:16:39,131 INFO L226 Difference]: Without dead ends: 66173 [2019-12-27 08:16:39,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:16:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-27 08:16:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-27 08:16:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-27 08:16:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-27 08:16:40,133 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-27 08:16:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:40,133 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-27 08:16:40,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:16:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-27 08:16:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:16:40,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:40,134 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:40,134 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:40,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:40,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-27 08:16:40,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:40,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780339514] [2019-12-27 08:16:40,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:40,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780339514] [2019-12-27 08:16:40,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:40,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:16:40,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266531037] [2019-12-27 08:16:40,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:16:40,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:16:40,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:40,165 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-27 08:16:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:40,691 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-27 08:16:40,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:16:40,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:16:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:40,885 INFO L225 Difference]: With dead ends: 66741 [2019-12-27 08:16:40,885 INFO L226 Difference]: Without dead ends: 66732 [2019-12-27 08:16:40,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:16:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-27 08:16:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-27 08:16:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-27 08:16:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-27 08:16:42,594 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-27 08:16:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:42,594 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-27 08:16:42,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:16:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-27 08:16:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:16:42,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:42,595 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:42,595 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-27 08:16:42,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:42,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502836194] [2019-12-27 08:16:42,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:42,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502836194] [2019-12-27 08:16:42,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:42,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:16:42,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829883282] [2019-12-27 08:16:42,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:16:42,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:16:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:42,623 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 7 states. [2019-12-27 08:16:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:43,157 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-27 08:16:43,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:16:43,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:16:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:43,357 INFO L225 Difference]: With dead ends: 67749 [2019-12-27 08:16:43,357 INFO L226 Difference]: Without dead ends: 67740 [2019-12-27 08:16:43,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:16:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-27 08:16:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-27 08:16:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 08:16:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 08:16:44,378 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 08:16:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:44,379 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 08:16:44,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:16:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 08:16:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:16:44,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:44,380 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:44,380 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-27 08:16:44,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:44,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318354466] [2019-12-27 08:16:44,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 08:16:44,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318354466] [2019-12-27 08:16:44,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401922641] [2019-12-27 08:16:44,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:44,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:44,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 08:16:44,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:44,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:44,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647458272] [2019-12-27 08:16:44,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:44,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:44,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:44,517 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 9 states. [2019-12-27 08:16:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:45,500 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-27 08:16:45,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:45,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:16:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:45,773 INFO L225 Difference]: With dead ends: 97639 [2019-12-27 08:16:45,773 INFO L226 Difference]: Without dead ends: 97635 [2019-12-27 08:16:45,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-27 08:16:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27701. [2019-12-27 08:16:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-27 08:16:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-27 08:16:49,612 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-27 08:16:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:49,612 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-27 08:16:49,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-27 08:16:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:16:49,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:49,613 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:49,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:49,814 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-27 08:16:49,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:49,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129276689] [2019-12-27 08:16:49,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 08:16:49,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129276689] [2019-12-27 08:16:49,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923902611] [2019-12-27 08:16:49,868 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:49,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:16:49,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:16:49,956 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:16:49,957 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:16:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 08:16:49,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:16:49,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:16:49,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36044208] [2019-12-27 08:16:49,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:49,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:49,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:49,961 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 9 states. [2019-12-27 08:16:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:51,042 INFO L93 Difference]: Finished difference Result 96845 states and 436549 transitions. [2019-12-27 08:16:51,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:51,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:16:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:51,309 INFO L225 Difference]: With dead ends: 96845 [2019-12-27 08:16:51,309 INFO L226 Difference]: Without dead ends: 96839 [2019-12-27 08:16:51,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96839 states. [2019-12-27 08:16:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96839 to 27343. [2019-12-27 08:16:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 08:16:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 08:16:53,222 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 08:16:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:53,222 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 08:16:53,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 08:16:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:16:53,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:53,223 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:53,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:16:53,424 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:53,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-27 08:16:53,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:53,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340568209] [2019-12-27 08:16:53,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:16:53,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340568209] [2019-12-27 08:16:53,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:53,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:16:53,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10743326] [2019-12-27 08:16:53,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:16:53,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:16:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:16:53,447 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-27 08:16:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:53,756 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-27 08:16:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:16:53,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 08:16:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:53,901 INFO L225 Difference]: With dead ends: 49005 [2019-12-27 08:16:53,901 INFO L226 Difference]: Without dead ends: 48989 [2019-12-27 08:16:53,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:16:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-27 08:16:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-27 08:16:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-27 08:16:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-27 08:16:54,837 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-27 08:16:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:54,838 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-27 08:16:54,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:16:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-27 08:16:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:16:54,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:54,839 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:54,839 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-27 08:16:54,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:54,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699953006] [2019-12-27 08:16:54,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:54,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699953006] [2019-12-27 08:16:54,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:54,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:54,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116421111] [2019-12-27 08:16:54,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:54,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:54,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:54,895 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-27 08:16:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:16:57,990 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-27 08:16:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:16:57,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:16:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:16:58,311 INFO L225 Difference]: With dead ends: 112418 [2019-12-27 08:16:58,311 INFO L226 Difference]: Without dead ends: 112411 [2019-12-27 08:16:58,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:16:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-27 08:16:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-27 08:16:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-27 08:16:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-27 08:16:59,888 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-27 08:16:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:16:59,888 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-27 08:16:59,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:16:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-27 08:16:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:16:59,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:16:59,889 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:16:59,890 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:16:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:16:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-27 08:16:59,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:16:59,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653190510] [2019-12-27 08:16:59,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:16:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:16:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:16:59,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653190510] [2019-12-27 08:16:59,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:16:59,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:16:59,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390198545] [2019-12-27 08:16:59,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:16:59,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:16:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:16:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:16:59,941 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-27 08:17:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:01,705 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-27 08:17:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:01,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:17:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:02,035 INFO L225 Difference]: With dead ends: 111816 [2019-12-27 08:17:02,036 INFO L226 Difference]: Without dead ends: 111807 [2019-12-27 08:17:02,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-27 08:17:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-27 08:17:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-27 08:17:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-27 08:17:03,618 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-27 08:17:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:03,618 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-27 08:17:03,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-27 08:17:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:17:03,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:03,620 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:03,620 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-27 08:17:03,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:03,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974076308] [2019-12-27 08:17:03,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:17:03,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974076308] [2019-12-27 08:17:03,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:03,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:17:03,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507982101] [2019-12-27 08:17:03,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:03,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:03,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:03,666 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 9 states. [2019-12-27 08:17:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:05,249 INFO L93 Difference]: Finished difference Result 112148 states and 515023 transitions. [2019-12-27 08:17:05,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:05,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:17:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:05,583 INFO L225 Difference]: With dead ends: 112148 [2019-12-27 08:17:05,583 INFO L226 Difference]: Without dead ends: 112141 [2019-12-27 08:17:05,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112141 states. [2019-12-27 08:17:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112141 to 31950. [2019-12-27 08:17:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-27 08:17:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-27 08:17:07,149 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-27 08:17:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:07,149 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-27 08:17:07,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-27 08:17:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:17:07,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:07,151 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:07,151 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:07,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-27 08:17:07,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:07,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003597532] [2019-12-27 08:17:07,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:17:07,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003597532] [2019-12-27 08:17:07,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:07,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:17:07,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034015488] [2019-12-27 08:17:07,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:07,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:07,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:07,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:07,196 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 9 states. [2019-12-27 08:17:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:08,528 INFO L93 Difference]: Finished difference Result 111038 states and 509212 transitions. [2019-12-27 08:17:08,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:08,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:17:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:08,851 INFO L225 Difference]: With dead ends: 111038 [2019-12-27 08:17:08,851 INFO L226 Difference]: Without dead ends: 111028 [2019-12-27 08:17:08,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111028 states. [2019-12-27 08:17:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111028 to 30899. [2019-12-27 08:17:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 08:17:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 08:17:10,398 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 08:17:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:10,398 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 08:17:10,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 08:17:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:17:10,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:10,400 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:10,400 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-27 08:17:10,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:10,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296979714] [2019-12-27 08:17:10,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:10,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296979714] [2019-12-27 08:17:10,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486068791] [2019-12-27 08:17:10,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:10,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:17:10,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:10,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:10,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:17:10,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115098399] [2019-12-27 08:17:10,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:17:10,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:10,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:17:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:17:10,519 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 7 states. [2019-12-27 08:17:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:11,378 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-27 08:17:11,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:11,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:17:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:11,594 INFO L225 Difference]: With dead ends: 73073 [2019-12-27 08:17:11,594 INFO L226 Difference]: Without dead ends: 73061 [2019-12-27 08:17:11,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:17:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-27 08:17:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-27 08:17:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 08:17:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 08:17:12,712 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 08:17:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:12,713 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 08:17:12,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:17:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 08:17:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:17:12,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:12,715 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:12,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:12,915 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:12,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-27 08:17:12,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:12,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827155954] [2019-12-27 08:17:12,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:12,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827155954] [2019-12-27 08:17:12,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277573299] [2019-12-27 08:17:12,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:13,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:17:13,031 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:13,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:13,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:17:13,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129142936] [2019-12-27 08:17:13,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:17:13,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:13,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:17:13,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:17:13,035 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-27 08:17:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:13,618 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-27 08:17:13,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:13,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:17:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:13,847 INFO L225 Difference]: With dead ends: 77025 [2019-12-27 08:17:13,847 INFO L226 Difference]: Without dead ends: 77011 [2019-12-27 08:17:13,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:17:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-27 08:17:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-27 08:17:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-27 08:17:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-27 08:17:15,453 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-27 08:17:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:15,454 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-27 08:17:15,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:17:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-27 08:17:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:17:15,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:15,456 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:15,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:15,657 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-27 08:17:15,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:15,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191946220] [2019-12-27 08:17:15,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:17:15,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191946220] [2019-12-27 08:17:15,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:15,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:17:15,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458401082] [2019-12-27 08:17:15,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:17:15,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:17:15,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:17:15,689 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-27 08:17:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:16,296 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-27 08:17:16,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:16,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:17:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:16,528 INFO L225 Difference]: With dead ends: 78384 [2019-12-27 08:17:16,528 INFO L226 Difference]: Without dead ends: 78365 [2019-12-27 08:17:16,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:17:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-27 08:17:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-27 08:17:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-27 08:17:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-27 08:17:18,231 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-27 08:17:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:18,231 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-27 08:17:18,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:17:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-27 08:17:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:17:18,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:18,233 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:18,233 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:18,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:18,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-27 08:17:18,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:18,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751658376] [2019-12-27 08:17:18,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:17:18,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751658376] [2019-12-27 08:17:18,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:18,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:17:18,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993756909] [2019-12-27 08:17:18,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:17:18,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:17:18,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:17:18,265 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-27 08:17:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:18,834 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-27 08:17:18,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:18,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:17:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:19,066 INFO L225 Difference]: With dead ends: 78506 [2019-12-27 08:17:19,066 INFO L226 Difference]: Without dead ends: 78487 [2019-12-27 08:17:19,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:17:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-27 08:17:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-27 08:17:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-27 08:17:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-27 08:17:20,282 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-27 08:17:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:20,283 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-27 08:17:20,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:17:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-27 08:17:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:17:20,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:20,285 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:20,285 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-27 08:17:20,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:20,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24598797] [2019-12-27 08:17:20,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:17:20,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24598797] [2019-12-27 08:17:20,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:20,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:17:20,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691667291] [2019-12-27 08:17:20,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:17:20,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:20,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:17:20,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:17:20,315 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-27 08:17:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:21,187 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-27 08:17:21,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:21,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:17:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:21,432 INFO L225 Difference]: With dead ends: 80886 [2019-12-27 08:17:21,432 INFO L226 Difference]: Without dead ends: 80867 [2019-12-27 08:17:21,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:17:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-27 08:17:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-27 08:17:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-27 08:17:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-27 08:17:22,679 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-27 08:17:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:22,679 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-27 08:17:22,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:17:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-27 08:17:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:17:22,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:22,681 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:22,681 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-27 08:17:22,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:22,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475910951] [2019-12-27 08:17:22,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:17:22,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475910951] [2019-12-27 08:17:22,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:17:22,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:17:22,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066957840] [2019-12-27 08:17:22,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:17:22,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:17:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:17:22,714 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 7 states. [2019-12-27 08:17:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:23,310 INFO L93 Difference]: Finished difference Result 81926 states and 399875 transitions. [2019-12-27 08:17:23,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:17:23,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:17:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:24,137 INFO L225 Difference]: With dead ends: 81926 [2019-12-27 08:17:24,137 INFO L226 Difference]: Without dead ends: 81907 [2019-12-27 08:17:24,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:17:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81907 states. [2019-12-27 08:17:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81907 to 35912. [2019-12-27 08:17:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 08:17:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 08:17:25,329 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 08:17:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:25,329 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 08:17:25,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:17:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 08:17:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:17:25,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:25,332 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:25,332 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:25,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-27 08:17:25,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:25,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668031446] [2019-12-27 08:17:25,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:25,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668031446] [2019-12-27 08:17:25,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248523057] [2019-12-27 08:17:25,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:25,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:17:25,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:25,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:25,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:17:25,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058749506] [2019-12-27 08:17:25,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:25,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:25,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:25,526 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 9 states. [2019-12-27 08:17:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:26,595 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-27 08:17:26,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:26,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:17:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:26,933 INFO L225 Difference]: With dead ends: 119601 [2019-12-27 08:17:26,934 INFO L226 Difference]: Without dead ends: 119591 [2019-12-27 08:17:26,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-27 08:17:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35598. [2019-12-27 08:17:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-27 08:17:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-27 08:17:29,133 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-27 08:17:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:29,133 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-27 08:17:29,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-27 08:17:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:17:29,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:29,136 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:29,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:29,337 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:29,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-27 08:17:29,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:29,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189003655] [2019-12-27 08:17:29,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:29,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189003655] [2019-12-27 08:17:29,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358731029] [2019-12-27 08:17:29,384 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:29,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:17:29,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:17:29,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:17:29,471 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:29,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:29,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:17:29,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981735665] [2019-12-27 08:17:29,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:29,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:29,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:29,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:29,476 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 9 states. [2019-12-27 08:17:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:30,622 INFO L93 Difference]: Finished difference Result 118295 states and 546185 transitions. [2019-12-27 08:17:30,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:30,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:17:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:31,608 INFO L225 Difference]: With dead ends: 118295 [2019-12-27 08:17:31,609 INFO L226 Difference]: Without dead ends: 118284 [2019-12-27 08:17:31,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118284 states. [2019-12-27 08:17:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118284 to 35531. [2019-12-27 08:17:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 08:17:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-27 08:17:33,170 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-27 08:17:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:33,170 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-27 08:17:33,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-27 08:17:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:17:33,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:33,174 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:33,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:33,375 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-27 08:17:33,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:33,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737678955] [2019-12-27 08:17:33,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:33,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737678955] [2019-12-27 08:17:33,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495914360] [2019-12-27 08:17:33,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:33,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:17:33,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:33,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:33,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:17:33,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285527416] [2019-12-27 08:17:33,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:33,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:33,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:33,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:33,508 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 9 states. [2019-12-27 08:17:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:34,987 INFO L93 Difference]: Finished difference Result 117353 states and 541624 transitions. [2019-12-27 08:17:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:34,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:17:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:35,334 INFO L225 Difference]: With dead ends: 117353 [2019-12-27 08:17:35,335 INFO L226 Difference]: Without dead ends: 117343 [2019-12-27 08:17:35,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117343 states. [2019-12-27 08:17:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117343 to 35223. [2019-12-27 08:17:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-27 08:17:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-27 08:17:36,942 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-27 08:17:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:36,943 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-27 08:17:36,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-27 08:17:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:17:36,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:36,945 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:37,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:37,146 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:37,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:37,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-27 08:17:37,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:37,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048656372] [2019-12-27 08:17:37,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:37,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048656372] [2019-12-27 08:17:37,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136747078] [2019-12-27 08:17:37,190 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:37,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:17:37,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:17:37,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:17:37,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:37,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:37,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:17:37,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665878450] [2019-12-27 08:17:37,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:37,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:37,281 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 9 states. [2019-12-27 08:17:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:38,656 INFO L93 Difference]: Finished difference Result 116621 states and 537886 transitions. [2019-12-27 08:17:38,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:38,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:17:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:38,993 INFO L225 Difference]: With dead ends: 116621 [2019-12-27 08:17:38,993 INFO L226 Difference]: Without dead ends: 116610 [2019-12-27 08:17:38,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116610 states. [2019-12-27 08:17:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116610 to 34934. [2019-12-27 08:17:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 08:17:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 08:17:44,214 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 08:17:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:44,214 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 08:17:44,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 08:17:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:17:44,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:44,218 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:44,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:44,418 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:44,419 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-27 08:17:44,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:44,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310181430] [2019-12-27 08:17:44,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:44,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310181430] [2019-12-27 08:17:44,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228678650] [2019-12-27 08:17:44,460 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:44,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:17:44,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:17:44,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:17:44,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:44,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:44,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:17:44,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292118514] [2019-12-27 08:17:44,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:44,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:44,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:44,551 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 9 states. [2019-12-27 08:17:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:45,694 INFO L93 Difference]: Finished difference Result 116675 states and 538001 transitions. [2019-12-27 08:17:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:45,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:17:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:46,028 INFO L225 Difference]: With dead ends: 116675 [2019-12-27 08:17:46,028 INFO L226 Difference]: Without dead ends: 116665 [2019-12-27 08:17:46,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116665 states. [2019-12-27 08:17:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116665 to 34396. [2019-12-27 08:17:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-27 08:17:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-27 08:17:48,172 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-27 08:17:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:48,173 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-27 08:17:48,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-27 08:17:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:17:48,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:48,175 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:48,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:48,376 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:48,377 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-27 08:17:48,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:48,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75767770] [2019-12-27 08:17:48,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:48,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75767770] [2019-12-27 08:17:48,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639709351] [2019-12-27 08:17:48,442 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:48,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:17:48,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:17:48,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:17:48,538 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:48,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:48,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:17:48,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337072622] [2019-12-27 08:17:48,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:48,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:48,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:48,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:48,543 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-27 08:17:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:49,636 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-27 08:17:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:49,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:17:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:49,971 INFO L225 Difference]: With dead ends: 117673 [2019-12-27 08:17:49,972 INFO L226 Difference]: Without dead ends: 117662 [2019-12-27 08:17:49,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-27 08:17:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-27 08:17:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-27 08:17:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-27 08:17:52,315 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-27 08:17:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:52,315 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-27 08:17:52,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-27 08:17:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:17:52,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:52,317 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:52,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:52,518 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-27 08:17:52,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:52,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385039607] [2019-12-27 08:17:52,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:52,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385039607] [2019-12-27 08:17:52,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922030955] [2019-12-27 08:17:52,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:52,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:17:52,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:52,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:52,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:17:52,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133454872] [2019-12-27 08:17:52,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:52,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:52,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:52,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:52,649 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-27 08:17:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:53,744 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-27 08:17:53,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:53,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:17:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:54,085 INFO L225 Difference]: With dead ends: 117232 [2019-12-27 08:17:54,086 INFO L226 Difference]: Without dead ends: 117222 [2019-12-27 08:17:54,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-27 08:17:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-27 08:17:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-27 08:17:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-27 08:17:56,303 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-27 08:17:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:17:56,303 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-27 08:17:56,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:17:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-27 08:17:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:17:56,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:17:56,306 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:17:56,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:56,507 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:17:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:17:56,508 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-27 08:17:56,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:17:56,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032830287] [2019-12-27 08:17:56,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:17:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:17:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:56,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032830287] [2019-12-27 08:17:56,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589965948] [2019-12-27 08:17:56,553 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:17:56,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:17:56,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:17:56,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 08:17:56,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:17:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:17:56,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:17:56,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 08:17:56,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105814706] [2019-12-27 08:17:56,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:17:56,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:17:56,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:17:56,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:17:56,650 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 9 states. [2019-12-27 08:17:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:17:57,763 INFO L93 Difference]: Finished difference Result 116256 states and 536656 transitions. [2019-12-27 08:17:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:17:57,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:17:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:17:58,104 INFO L225 Difference]: With dead ends: 116256 [2019-12-27 08:17:58,104 INFO L226 Difference]: Without dead ends: 116242 [2019-12-27 08:17:58,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:17:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116242 states. [2019-12-27 08:18:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116242 to 33768. [2019-12-27 08:18:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 08:18:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-27 08:18:00,179 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-27 08:18:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:00,179 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-27 08:18:00,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-27 08:18:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:00,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:00,182 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:00,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:18:00,385 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:00,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-27 08:18:00,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:00,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497007764] [2019-12-27 08:18:00,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 08:18:00,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497007764] [2019-12-27 08:18:00,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:00,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:18:00,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580685052] [2019-12-27 08:18:00,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:18:00,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:00,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:18:00,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:18:00,407 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-27 08:18:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:00,778 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-27 08:18:00,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:18:00,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 08:18:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:00,960 INFO L225 Difference]: With dead ends: 59584 [2019-12-27 08:18:00,961 INFO L226 Difference]: Without dead ends: 59552 [2019-12-27 08:18:00,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:18:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-27 08:18:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-27 08:18:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-27 08:18:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-27 08:18:02,520 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-27 08:18:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:02,520 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-27 08:18:02,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:18:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-27 08:18:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:02,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:02,523 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:02,523 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:02,524 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-27 08:18:02,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:02,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189384353] [2019-12-27 08:18:02,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:02,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189384353] [2019-12-27 08:18:02,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:02,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:02,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540290350] [2019-12-27 08:18:02,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:02,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:02,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:02,575 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-27 08:18:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:03,727 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-27 08:18:03,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:03,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:04,121 INFO L225 Difference]: With dead ends: 137478 [2019-12-27 08:18:04,122 INFO L226 Difference]: Without dead ends: 137462 [2019-12-27 08:18:04,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-27 08:18:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-27 08:18:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-27 08:18:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-27 08:18:06,822 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-27 08:18:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:06,822 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-27 08:18:06,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-27 08:18:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:06,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:06,825 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:06,825 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-27 08:18:06,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:06,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275212991] [2019-12-27 08:18:06,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:06,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275212991] [2019-12-27 08:18:06,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:06,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:06,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501592912] [2019-12-27 08:18:06,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:06,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:06,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:06,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:06,864 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. [2019-12-27 08:18:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:08,607 INFO L93 Difference]: Finished difference Result 136774 states and 641773 transitions. [2019-12-27 08:18:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:08,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:09,022 INFO L225 Difference]: With dead ends: 136774 [2019-12-27 08:18:09,022 INFO L226 Difference]: Without dead ends: 136758 [2019-12-27 08:18:09,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136758 states. [2019-12-27 08:18:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136758 to 41129. [2019-12-27 08:18:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41129 states. [2019-12-27 08:18:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41129 states to 41129 states and 222593 transitions. [2019-12-27 08:18:15,287 INFO L78 Accepts]: Start accepts. Automaton has 41129 states and 222593 transitions. Word has length 25 [2019-12-27 08:18:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:15,287 INFO L462 AbstractCegarLoop]: Abstraction has 41129 states and 222593 transitions. [2019-12-27 08:18:15,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:15,287 INFO L276 IsEmpty]: Start isEmpty. Operand 41129 states and 222593 transitions. [2019-12-27 08:18:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:15,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:15,290 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:15,290 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash -61078994, now seen corresponding path program 6 times [2019-12-27 08:18:15,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:15,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835080685] [2019-12-27 08:18:15,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:15,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835080685] [2019-12-27 08:18:15,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:15,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:15,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098815990] [2019-12-27 08:18:15,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:15,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:15,346 INFO L87 Difference]: Start difference. First operand 41129 states and 222593 transitions. Second operand 9 states. [2019-12-27 08:18:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:16,535 INFO L93 Difference]: Finished difference Result 134734 states and 630461 transitions. [2019-12-27 08:18:16,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:16,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:16,934 INFO L225 Difference]: With dead ends: 134734 [2019-12-27 08:18:16,934 INFO L226 Difference]: Without dead ends: 134714 [2019-12-27 08:18:16,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134714 states. [2019-12-27 08:18:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134714 to 39950. [2019-12-27 08:18:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39950 states. [2019-12-27 08:18:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39950 states to 39950 states and 216201 transitions. [2019-12-27 08:18:19,365 INFO L78 Accepts]: Start accepts. Automaton has 39950 states and 216201 transitions. Word has length 25 [2019-12-27 08:18:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:19,365 INFO L462 AbstractCegarLoop]: Abstraction has 39950 states and 216201 transitions. [2019-12-27 08:18:19,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 39950 states and 216201 transitions. [2019-12-27 08:18:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:19,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:19,368 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:19,368 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash -61103236, now seen corresponding path program 3 times [2019-12-27 08:18:19,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:19,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822658709] [2019-12-27 08:18:19,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:19,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822658709] [2019-12-27 08:18:19,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:19,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:19,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119616288] [2019-12-27 08:18:19,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:19,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:19,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:19,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:19,415 INFO L87 Difference]: Start difference. First operand 39950 states and 216201 transitions. Second operand 9 states. [2019-12-27 08:18:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:20,648 INFO L93 Difference]: Finished difference Result 134487 states and 629694 transitions. [2019-12-27 08:18:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:20,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:21,044 INFO L225 Difference]: With dead ends: 134487 [2019-12-27 08:18:21,044 INFO L226 Difference]: Without dead ends: 134471 [2019-12-27 08:18:21,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134471 states. [2019-12-27 08:18:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134471 to 39586. [2019-12-27 08:18:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-27 08:18:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 214214 transitions. [2019-12-27 08:18:23,580 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 214214 transitions. Word has length 25 [2019-12-27 08:18:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:23,581 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 214214 transitions. [2019-12-27 08:18:23,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 214214 transitions. [2019-12-27 08:18:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:23,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:23,584 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:23,584 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash -69926921, now seen corresponding path program 4 times [2019-12-27 08:18:23,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:23,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134737418] [2019-12-27 08:18:23,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:23,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134737418] [2019-12-27 08:18:23,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:23,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:23,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888575317] [2019-12-27 08:18:23,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:23,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:23,629 INFO L87 Difference]: Start difference. First operand 39586 states and 214214 transitions. Second operand 9 states. [2019-12-27 08:18:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:25,387 INFO L93 Difference]: Finished difference Result 134693 states and 630836 transitions. [2019-12-27 08:18:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:25,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:25,792 INFO L225 Difference]: With dead ends: 134693 [2019-12-27 08:18:25,792 INFO L226 Difference]: Without dead ends: 134673 [2019-12-27 08:18:25,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134673 states. [2019-12-27 08:18:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134673 to 39511. [2019-12-27 08:18:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39511 states. [2019-12-27 08:18:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39511 states to 39511 states and 213636 transitions. [2019-12-27 08:18:27,629 INFO L78 Accepts]: Start accepts. Automaton has 39511 states and 213636 transitions. Word has length 25 [2019-12-27 08:18:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:27,629 INFO L462 AbstractCegarLoop]: Abstraction has 39511 states and 213636 transitions. [2019-12-27 08:18:27,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 39511 states and 213636 transitions. [2019-12-27 08:18:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:27,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:27,632 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:27,632 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:27,632 INFO L82 PathProgramCache]: Analyzing trace with hash -69941956, now seen corresponding path program 4 times [2019-12-27 08:18:27,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:27,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341501267] [2019-12-27 08:18:27,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:27,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341501267] [2019-12-27 08:18:27,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:27,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:27,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052435919] [2019-12-27 08:18:27,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:27,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:27,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:27,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:27,704 INFO L87 Difference]: Start difference. First operand 39511 states and 213636 transitions. Second operand 9 states. [2019-12-27 08:18:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:29,172 INFO L93 Difference]: Finished difference Result 133500 states and 624860 transitions. [2019-12-27 08:18:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:29,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:29,564 INFO L225 Difference]: With dead ends: 133500 [2019-12-27 08:18:29,564 INFO L226 Difference]: Without dead ends: 133480 [2019-12-27 08:18:29,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133480 states. [2019-12-27 08:18:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133480 to 39284. [2019-12-27 08:18:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39284 states. [2019-12-27 08:18:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39284 states to 39284 states and 212213 transitions. [2019-12-27 08:18:34,628 INFO L78 Accepts]: Start accepts. Automaton has 39284 states and 212213 transitions. Word has length 25 [2019-12-27 08:18:34,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:34,628 INFO L462 AbstractCegarLoop]: Abstraction has 39284 states and 212213 transitions. [2019-12-27 08:18:34,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 39284 states and 212213 transitions. [2019-12-27 08:18:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:34,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:34,630 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:34,631 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:34,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1098510199, now seen corresponding path program 5 times [2019-12-27 08:18:34,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:34,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441458387] [2019-12-27 08:18:34,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:34,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441458387] [2019-12-27 08:18:34,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:34,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:34,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710500376] [2019-12-27 08:18:34,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:34,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:34,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:34,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:34,677 INFO L87 Difference]: Start difference. First operand 39284 states and 212213 transitions. Second operand 9 states. [2019-12-27 08:18:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:35,844 INFO L93 Difference]: Finished difference Result 134278 states and 628555 transitions. [2019-12-27 08:18:35,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:35,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:36,246 INFO L225 Difference]: With dead ends: 134278 [2019-12-27 08:18:36,246 INFO L226 Difference]: Without dead ends: 134262 [2019-12-27 08:18:36,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134262 states. [2019-12-27 08:18:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134262 to 38762. [2019-12-27 08:18:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38762 states. [2019-12-27 08:18:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38762 states to 38762 states and 209279 transitions. [2019-12-27 08:18:38,832 INFO L78 Accepts]: Start accepts. Automaton has 38762 states and 209279 transitions. Word has length 25 [2019-12-27 08:18:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:38,832 INFO L462 AbstractCegarLoop]: Abstraction has 38762 states and 209279 transitions. [2019-12-27 08:18:38,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 38762 states and 209279 transitions. [2019-12-27 08:18:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:38,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:38,834 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:38,835 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1084061564, now seen corresponding path program 5 times [2019-12-27 08:18:38,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:38,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694643592] [2019-12-27 08:18:38,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:38,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694643592] [2019-12-27 08:18:38,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:38,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:38,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233563465] [2019-12-27 08:18:38,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:38,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:38,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:38,881 INFO L87 Difference]: Start difference. First operand 38762 states and 209279 transitions. Second operand 9 states. [2019-12-27 08:18:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:40,057 INFO L93 Difference]: Finished difference Result 133154 states and 622565 transitions. [2019-12-27 08:18:40,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:40,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:43,735 INFO L225 Difference]: With dead ends: 133154 [2019-12-27 08:18:43,735 INFO L226 Difference]: Without dead ends: 133138 [2019-12-27 08:18:43,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133138 states. [2019-12-27 08:18:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133138 to 38386. [2019-12-27 08:18:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38386 states. [2019-12-27 08:18:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38386 states to 38386 states and 207260 transitions. [2019-12-27 08:18:45,417 INFO L78 Accepts]: Start accepts. Automaton has 38386 states and 207260 transitions. Word has length 25 [2019-12-27 08:18:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:45,417 INFO L462 AbstractCegarLoop]: Abstraction has 38386 states and 207260 transitions. [2019-12-27 08:18:45,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 38386 states and 207260 transitions. [2019-12-27 08:18:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:45,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:45,419 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:45,420 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1074047479, now seen corresponding path program 6 times [2019-12-27 08:18:45,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:45,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841560726] [2019-12-27 08:18:45,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:45,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841560726] [2019-12-27 08:18:45,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:45,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:45,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363258426] [2019-12-27 08:18:45,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:45,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:45,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:45,460 INFO L87 Difference]: Start difference. First operand 38386 states and 207260 transitions. Second operand 9 states. [2019-12-27 08:18:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:47,165 INFO L93 Difference]: Finished difference Result 132300 states and 618178 transitions. [2019-12-27 08:18:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:47,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:47,562 INFO L225 Difference]: With dead ends: 132300 [2019-12-27 08:18:47,562 INFO L226 Difference]: Without dead ends: 132280 [2019-12-27 08:18:47,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132280 states. [2019-12-27 08:18:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132280 to 37647. [2019-12-27 08:18:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37647 states. [2019-12-27 08:18:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37647 states to 37647 states and 203286 transitions. [2019-12-27 08:18:53,070 INFO L78 Accepts]: Start accepts. Automaton has 37647 states and 203286 transitions. Word has length 25 [2019-12-27 08:18:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:53,070 INFO L462 AbstractCegarLoop]: Abstraction has 37647 states and 203286 transitions. [2019-12-27 08:18:53,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 37647 states and 203286 transitions. [2019-12-27 08:18:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:18:53,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:53,073 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:53,073 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1074032444, now seen corresponding path program 6 times [2019-12-27 08:18:53,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:53,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100651259] [2019-12-27 08:18:53,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:18:53,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100651259] [2019-12-27 08:18:53,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:18:53,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:18:53,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107447890] [2019-12-27 08:18:53,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:18:53,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:53,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:18:53,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:18:53,112 INFO L87 Difference]: Start difference. First operand 37647 states and 203286 transitions. Second operand 9 states. [2019-12-27 08:18:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:54,233 INFO L93 Difference]: Finished difference Result 131107 states and 612202 transitions. [2019-12-27 08:18:54,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:18:54,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:18:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:54,619 INFO L225 Difference]: With dead ends: 131107 [2019-12-27 08:18:54,619 INFO L226 Difference]: Without dead ends: 131087 [2019-12-27 08:18:54,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:18:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131087 states. [2019-12-27 08:18:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131087 to 36710. [2019-12-27 08:18:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36710 states. [2019-12-27 08:18:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36710 states to 36710 states and 198310 transitions. [2019-12-27 08:18:56,986 INFO L78 Accepts]: Start accepts. Automaton has 36710 states and 198310 transitions. Word has length 25 [2019-12-27 08:18:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:56,986 INFO L462 AbstractCegarLoop]: Abstraction has 36710 states and 198310 transitions. [2019-12-27 08:18:56,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:18:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 36710 states and 198310 transitions. [2019-12-27 08:18:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:18:56,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:56,990 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:18:56,990 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:18:56,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:18:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash 729716532, now seen corresponding path program 1 times [2019-12-27 08:18:56,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:18:56,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631790698] [2019-12-27 08:18:56,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:18:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-27 08:18:57,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631790698] [2019-12-27 08:18:57,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662617176] [2019-12-27 08:18:57,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:18:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:18:57,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 08:18:57,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:18:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-27 08:18:57,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:18:57,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 08:18:57,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138400857] [2019-12-27 08:18:57,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:18:57,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:18:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:18:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:18:57,114 INFO L87 Difference]: Start difference. First operand 36710 states and 198310 transitions. Second operand 7 states. [2019-12-27 08:18:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:18:57,714 INFO L93 Difference]: Finished difference Result 83348 states and 409532 transitions. [2019-12-27 08:18:57,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:18:57,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-27 08:18:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:18:57,961 INFO L225 Difference]: With dead ends: 83348 [2019-12-27 08:18:57,962 INFO L226 Difference]: Without dead ends: 83324 [2019-12-27 08:18:57,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:18:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83324 states. [2019-12-27 08:18:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83324 to 37851. [2019-12-27 08:18:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37851 states. [2019-12-27 08:18:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37851 states to 37851 states and 203965 transitions. [2019-12-27 08:18:59,931 INFO L78 Accepts]: Start accepts. Automaton has 37851 states and 203965 transitions. Word has length 27 [2019-12-27 08:18:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:18:59,931 INFO L462 AbstractCegarLoop]: Abstraction has 37851 states and 203965 transitions. [2019-12-27 08:18:59,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:18:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 37851 states and 203965 transitions. [2019-12-27 08:18:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:18:59,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:18:59,935 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:19:00,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:19:00,139 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:19:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:19:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1342668062, now seen corresponding path program 1 times [2019-12-27 08:19:00,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:19:00,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14142032] [2019-12-27 08:19:00,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:19:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:19:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:19:00,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14142032] [2019-12-27 08:19:00,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362052546] [2019-12-27 08:19:00,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:19:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:19:00,284 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 08:19:00,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:19:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:19:00,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:19:00,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-12-27 08:19:00,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494890857] [2019-12-27 08:19:00,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 08:19:00,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:19:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 08:19:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:19:00,289 INFO L87 Difference]: Start difference. First operand 37851 states and 203965 transitions. Second operand 11 states. [2019-12-27 08:19:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:19:02,464 INFO L93 Difference]: Finished difference Result 180868 states and 798489 transitions. [2019-12-27 08:19:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 08:19:02,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-12-27 08:19:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2019-12-27 08:19:03,788 INFO L225 Difference]: With dead ends: 180868 [2019-12-27 08:19:03,788 INFO L226 Difference]: Without dead ends: 180861 [2019-12-27 08:19:03,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 08:19:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180861 states. [2019-12-27 08:19:04,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:19:04,327 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 08:19:04,332 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 08:19:04,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:19:04 BasicIcfg [2019-12-27 08:19:04,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:19:04,333 INFO L168 Benchmark]: Toolchain (without parser) took 228708.09 ms. Allocated memory was 143.1 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 99.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 08:19:04,334 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 08:19:04,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.02 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.3 MB in the beginning and 159.7 MB in the end (delta: -60.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-27 08:19:04,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.06 ms. Allocated memory is still 200.8 MB. Free memory was 159.7 MB in the beginning and 157.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:19:04,334 INFO L168 Benchmark]: Boogie Preprocessor took 23.49 ms. Allocated memory is still 200.8 MB. Free memory was 157.7 MB in the beginning and 156.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 08:19:04,335 INFO L168 Benchmark]: RCFGBuilder took 409.67 ms. Allocated memory is still 200.8 MB. Free memory was 156.2 MB in the beginning and 137.2 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:19:04,335 INFO L168 Benchmark]: TraceAbstraction took 227565.67 ms. Allocated memory was 200.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 137.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 08:19:04,337 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.20 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 644.02 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.3 MB in the beginning and 159.7 MB in the end (delta: -60.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.06 ms. Allocated memory is still 200.8 MB. Free memory was 159.7 MB in the beginning and 157.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.49 ms. Allocated memory is still 200.8 MB. Free memory was 157.7 MB in the beginning and 156.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 409.67 ms. Allocated memory is still 200.8 MB. Free memory was 156.2 MB in the beginning and 137.2 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227565.67 ms. Allocated memory was 200.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 137.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 55 ProgramPointsBefore, 15 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 366 VarBasedMoverChecksPositive, 5 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 42 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 22 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 615 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1164 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 97 ProgramPointsBefore, 34 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1613 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1107 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2358 CheckedPairsTotal, 87 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 139 ProgramPointsBefore, 50 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3115 CheckedPairsTotal, 100 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 160 ProgramPointsBefore, 58 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1765 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4276 CheckedPairsTotal, 117 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 162.9s, OverallIterations: 44, TraceHistogramMax: 5, AutomataDifference: 62.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3580 SDtfs, 11020 SDslu, 11099 SDs, 0 SdLazy, 12453 SolverSat, 928 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1342 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 982 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7331 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42643occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 90.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 2670818 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1338 NumberOfCodeBlocks, 1330 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 85212 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1950 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 60 InterpolantComputations, 28 PerfectInterpolantSequences, 650/882 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