/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:54:37,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:54:37,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:54:37,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:54:37,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:54:37,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:54:37,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:54:37,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:54:37,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:54:37,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:54:37,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:54:37,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:54:37,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:54:37,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:54:37,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:54:37,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:54:37,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:54:37,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:54:37,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:54:37,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:54:37,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:54:37,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:54:37,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:54:37,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:54:37,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:54:37,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:54:37,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:54:37,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:54:37,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:54:37,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:54:37,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:54:37,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:54:37,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:54:37,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:54:37,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:54:37,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:54:37,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:54:37,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:54:37,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:54:37,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:54:37,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:54:37,771 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-SemanticLbe-MCR.epf [2019-12-27 18:54:37,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:54:37,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:54:37,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:54:37,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:54:37,800 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:54:37,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:54:37,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:54:37,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:54:37,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:54:37,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:54:37,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:54:37,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:54:37,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:54:37,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:54:37,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:54:37,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:54:37,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:54:37,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:54:37,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:54:37,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:54:37,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:54:37,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:54:37,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:54:37,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:54:37,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:54:37,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:54:37,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:54:37,807 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:54:37,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:54:37,807 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:54:37,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:54:38,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:54:38,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:54:38,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:54:38,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:54:38,129 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:54:38,130 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-27 18:54:38,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f20a9c0e/91b88c0089f84e758f41c8f8596141c4/FLAG97ce65a9f [2019-12-27 18:54:38,769 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:54:38,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-27 18:54:38,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f20a9c0e/91b88c0089f84e758f41c8f8596141c4/FLAG97ce65a9f [2019-12-27 18:54:39,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f20a9c0e/91b88c0089f84e758f41c8f8596141c4 [2019-12-27 18:54:39,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:54:39,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:54:39,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:54:39,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:54:39,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:54:39,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5901ba2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39, skipping insertion in model container [2019-12-27 18:54:39,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:54:39,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:54:39,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:54:39,688 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:54:39,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:54:39,828 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:54:39,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39 WrapperNode [2019-12-27 18:54:39,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:54:39,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:54:39,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:54:39,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:54:39,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:54:39,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:54:39,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:54:39,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:54:39,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (1/1) ... [2019-12-27 18:54:39,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:54:39,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:54:39,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:54:39,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:54:39,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (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 18:54:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 18:54:39,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 18:54:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 18:54:39,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 18:54:39,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:54:39,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:54:39,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:54:39,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:54:39,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:54:39,972 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 18:54:40,319 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:54:40,319 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 18:54:40,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:40 BoogieIcfgContainer [2019-12-27 18:54:40,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:54:40,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:54:40,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:54:40,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:54:40,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:54:39" (1/3) ... [2019-12-27 18:54:40,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1df03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:40, skipping insertion in model container [2019-12-27 18:54:40,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:39" (2/3) ... [2019-12-27 18:54:40,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1df03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:40, skipping insertion in model container [2019-12-27 18:54:40,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:40" (3/3) ... [2019-12-27 18:54:40,329 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-1.i [2019-12-27 18:54:40,339 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:54:40,339 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:54:40,347 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 18:54:40,348 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:54:40,374 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,374 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,375 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,375 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,376 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,376 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,376 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,376 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,377 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,380 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,380 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,380 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,381 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,381 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,385 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,385 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,392 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:40,415 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 18:54:40,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:54:40,433 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:54:40,433 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:54:40,434 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:54:40,434 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:54:40,434 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:54:40,434 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:54:40,434 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:54:40,449 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions [2019-12-27 18:54:40,451 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-27 18:54:40,503 INFO L132 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-27 18:54:40,503 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:54:40,510 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs. 0/60 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 18:54:40,516 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-27 18:54:40,556 INFO L132 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-27 18:54:40,556 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:54:40,558 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs. 0/60 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 18:54:40,560 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-27 18:54:40,561 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:54:41,953 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-27 18:54:42,221 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-27 18:54:42,302 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-27 18:54:42,302 INFO L214 etLargeBlockEncoding]: Total number of compositions: 47 [2019-12-27 18:54:42,308 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 18:54:42,326 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 18:54:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 18:54:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:54:42,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:42,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:54:42,336 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 18:54:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash 219913, now seen corresponding path program 1 times [2019-12-27 18:54:42,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:42,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017969665] [2019-12-27 18:54:42,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:42,539 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 18:54:42,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017969665] [2019-12-27 18:54:42,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:42,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:54:42,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996130220] [2019-12-27 18:54:42,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:42,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:42,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:54:42,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:42,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:42,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:54:42,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:42,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:54:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:54:42,580 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 18:54:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:42,622 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 18:54:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:54:42,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:54:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:42,634 INFO L225 Difference]: With dead ends: 35 [2019-12-27 18:54:42,634 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 18:54:42,636 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 18:54:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 18:54:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 18:54:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 18:54:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 18:54:42,674 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 18:54:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:42,675 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 18:54:42,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:54:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 18:54:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 18:54:42,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:42,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:42,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 18:54:42,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1212750904, now seen corresponding path program 1 times [2019-12-27 18:54:42,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:42,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162645046] [2019-12-27 18:54:42,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:42,768 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 18:54:42,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162645046] [2019-12-27 18:54:42,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:42,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:54:42,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161721639] [2019-12-27 18:54:42,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:42,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:42,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 18:54:42,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:42,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:42,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:54:42,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:54:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:54:42,776 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 18:54:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:42,804 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 18:54:42,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:54:42,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 18:54:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:42,805 INFO L225 Difference]: With dead ends: 26 [2019-12-27 18:54:42,805 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 18:54:42,806 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 18:54:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 18:54:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 18:54:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 18:54:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 18:54:42,811 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 18:54:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:42,811 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 18:54:42,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:54:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 18:54:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 18:54:42,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:42,812 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:42,813 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 18:54:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1059432955, now seen corresponding path program 1 times [2019-12-27 18:54:42,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:42,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732813735] [2019-12-27 18:54:42,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:42,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:54:42,898 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:54:42,898 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:54:42,899 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 18:54:42,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,911 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,911 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,913 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,913 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,913 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,913 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,913 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,915 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,915 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,915 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,915 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,915 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,916 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,916 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,917 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,917 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,917 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,919 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,919 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:42,926 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:54:42,926 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:54:42,926 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:54:42,926 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:54:42,926 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:54:42,926 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:54:42,927 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:54:42,927 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:54:42,927 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:54:42,929 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 74 transitions [2019-12-27 18:54:42,929 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-27 18:54:42,951 INFO L132 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-27 18:54:42,951 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 18:54:42,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 88 events. 4/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs. 0/80 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2019-12-27 18:54:42,955 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-27 18:54:42,974 INFO L132 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-27 18:54:42,975 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 18:54:42,976 INFO L76 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 88 events. 4/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs. 0/80 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2019-12-27 18:54:42,979 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-27 18:54:42,979 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:54:44,560 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 18:54:44,645 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1223 [2019-12-27 18:54:44,646 INFO L214 etLargeBlockEncoding]: Total number of compositions: 61 [2019-12-27 18:54:44,646 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 18:54:44,657 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 18:54:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 18:54:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:54:44,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:44,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:54:44,658 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:54:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:44,658 INFO L82 PathProgramCache]: Analyzing trace with hash 374327, now seen corresponding path program 1 times [2019-12-27 18:54:44,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:44,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903127720] [2019-12-27 18:54:44,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:44,709 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 18:54:44,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903127720] [2019-12-27 18:54:44,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:44,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:54:44,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338544013] [2019-12-27 18:54:44,711 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:44,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:44,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:54:44,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:44,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:44,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:54:44,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:54:44,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:54:44,713 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 18:54:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:44,742 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 18:54:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:54:44,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:54:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:44,748 INFO L225 Difference]: With dead ends: 185 [2019-12-27 18:54:44,748 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 18:54:44,748 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 18:54:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 18:54:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 18:54:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 18:54:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 18:54:44,783 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 18:54:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:44,783 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 18:54:44,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:54:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 18:54:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:54:44,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:44,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:44,787 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:54:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:44,788 INFO L82 PathProgramCache]: Analyzing trace with hash -857862729, now seen corresponding path program 1 times [2019-12-27 18:54:44,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:44,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385196130] [2019-12-27 18:54:44,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:44,897 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 18:54:44,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385196130] [2019-12-27 18:54:44,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:44,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:44,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739235680] [2019-12-27 18:54:44,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:44,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:44,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:54:44,904 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:44,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:44,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:44,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:44,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:44,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:44,906 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 18:54:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:45,020 INFO L93 Difference]: Finished difference Result 224 states and 491 transitions. [2019-12-27 18:54:45,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:54:45,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:54:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:45,024 INFO L225 Difference]: With dead ends: 224 [2019-12-27 18:54:45,025 INFO L226 Difference]: Without dead ends: 221 [2019-12-27 18:54:45,025 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 18:54:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-27 18:54:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2019-12-27 18:54:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 18:54:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 18:54:45,044 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 18:54:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:45,045 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 18:54:45,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 18:54:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:54:45,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:45,046 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:45,047 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:54:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash -924776041, now seen corresponding path program 1 times [2019-12-27 18:54:45,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:45,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419500382] [2019-12-27 18:54:45,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:45,101 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 18:54:45,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419500382] [2019-12-27 18:54:45,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:45,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:45,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171429029] [2019-12-27 18:54:45,102 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:45,103 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:45,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:54:45,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:45,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:45,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:45,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:45,107 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 18:54:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:45,197 INFO L93 Difference]: Finished difference Result 213 states and 458 transitions. [2019-12-27 18:54:45,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:54:45,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:54:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:45,202 INFO L225 Difference]: With dead ends: 213 [2019-12-27 18:54:45,202 INFO L226 Difference]: Without dead ends: 209 [2019-12-27 18:54:45,203 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 18:54:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-27 18:54:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2019-12-27 18:54:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 18:54:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 18:54:45,217 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 18:54:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:45,218 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 18:54:45,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 18:54:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:54:45,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:45,220 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:45,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:54:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1393798314, now seen corresponding path program 1 times [2019-12-27 18:54:45,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:45,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240736985] [2019-12-27 18:54:45,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:45,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:54:45,255 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:54:45,255 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:54:45,255 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 18:54:45,265 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,265 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,266 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,266 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,266 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,266 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,266 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,267 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,267 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,267 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,267 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,267 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,267 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,267 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,268 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,268 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,268 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,268 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,268 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,269 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,269 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,269 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,269 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,269 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,269 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,270 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,270 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,270 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,270 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,270 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,271 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,271 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,271 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,271 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,271 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,271 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,272 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,272 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,272 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,273 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,273 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,273 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,273 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,273 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,273 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,274 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,274 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,274 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,274 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,274 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,274 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,275 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,275 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,275 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,275 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,276 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,276 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,276 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,277 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,277 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,277 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,277 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,277 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,278 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,278 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,284 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,284 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,284 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,285 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,285 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,286 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,286 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,286 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,286 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,287 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,289 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,290 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,290 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,291 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,291 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,291 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,291 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,301 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,301 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,302 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,302 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,302 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,302 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:45,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:54:45,304 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:54:45,304 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:54:45,304 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:54:45,304 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:54:45,304 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:54:45,305 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:54:45,305 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:54:45,305 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:54:45,307 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 92 transitions [2019-12-27 18:54:45,307 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-27 18:54:45,328 INFO L132 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-27 18:54:45,329 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 18:54:45,331 INFO L76 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 5/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs. 0/100 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2019-12-27 18:54:45,335 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-27 18:54:45,353 INFO L132 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-27 18:54:45,354 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 18:54:45,355 INFO L76 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 5/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs. 0/100 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2019-12-27 18:54:45,359 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-27 18:54:45,359 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:54:46,859 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-27 18:54:47,136 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-27 18:54:47,264 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1840 [2019-12-27 18:54:47,264 INFO L214 etLargeBlockEncoding]: Total number of compositions: 80 [2019-12-27 18:54:47,264 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 18:54:47,287 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 18:54:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 18:54:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:54:47,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:47,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:54:47,289 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 18:54:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash 564387, now seen corresponding path program 1 times [2019-12-27 18:54:47,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:47,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106969658] [2019-12-27 18:54:47,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:47,320 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 18:54:47,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106969658] [2019-12-27 18:54:47,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:47,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:54:47,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1864224949] [2019-12-27 18:54:47,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:47,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:47,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:54:47,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:47,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:47,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:54:47,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:54:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:54:47,326 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 18:54:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:47,363 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 18:54:47,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:54:47,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:54:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:47,370 INFO L225 Difference]: With dead ends: 600 [2019-12-27 18:54:47,370 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 18:54:47,370 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 18:54:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 18:54:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 18:54:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 18:54:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 18:54:47,411 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 18:54:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:47,411 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 18:54:47,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:54:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 18:54:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:54:47,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:47,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:47,413 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 18:54:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227938, now seen corresponding path program 1 times [2019-12-27 18:54:47,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:47,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900634373] [2019-12-27 18:54:47,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:47,464 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 18:54:47,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900634373] [2019-12-27 18:54:47,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:47,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:47,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977471587] [2019-12-27 18:54:47,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:47,466 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:47,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:54:47,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:47,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:47,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:47,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:47,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:47,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:47,468 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 18:54:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:47,573 INFO L93 Difference]: Finished difference Result 918 states and 2567 transitions. [2019-12-27 18:54:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:54:47,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:54:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:47,580 INFO L225 Difference]: With dead ends: 918 [2019-12-27 18:54:47,581 INFO L226 Difference]: Without dead ends: 915 [2019-12-27 18:54:47,581 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 18:54:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-27 18:54:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 576. [2019-12-27 18:54:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 18:54:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 18:54:47,608 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 18:54:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:47,608 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 18:54:47,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 18:54:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:54:47,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:47,609 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:47,610 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 18:54:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1126341274, now seen corresponding path program 1 times [2019-12-27 18:54:47,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:47,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677590818] [2019-12-27 18:54:47,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:47,663 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 18:54:47,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677590818] [2019-12-27 18:54:47,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:47,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:47,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617028567] [2019-12-27 18:54:47,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:47,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:47,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:54:47,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:47,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:47,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:47,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:47,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:47,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:47,670 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 18:54:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:47,765 INFO L93 Difference]: Finished difference Result 952 states and 2666 transitions. [2019-12-27 18:54:47,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:54:47,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:54:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:47,772 INFO L225 Difference]: With dead ends: 952 [2019-12-27 18:54:47,772 INFO L226 Difference]: Without dead ends: 948 [2019-12-27 18:54:47,773 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 18:54:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-27 18:54:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 605. [2019-12-27 18:54:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 18:54:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 18:54:47,798 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 18:54:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:47,798 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 18:54:47,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 18:54:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:54:47,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:47,800 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:47,800 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 18:54:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash -821622243, now seen corresponding path program 1 times [2019-12-27 18:54:47,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:47,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083958941] [2019-12-27 18:54:47,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:47,897 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 18:54:47,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083958941] [2019-12-27 18:54:47,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617889591] [2019-12-27 18:54:47,899 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 18:54:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:48,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:54:48,008 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:48,136 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 18:54:48,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:48,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 18:54:48,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1706904811] [2019-12-27 18:54:48,137 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:48,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:48,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 18:54:48,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:48,235 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:54:48,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:54:48,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:54:48,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:54:48,237 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 14 states. [2019-12-27 18:54:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:49,299 INFO L93 Difference]: Finished difference Result 1356 states and 3508 transitions. [2019-12-27 18:54:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:54:49,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-12-27 18:54:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:49,308 INFO L225 Difference]: With dead ends: 1356 [2019-12-27 18:54:49,308 INFO L226 Difference]: Without dead ends: 1349 [2019-12-27 18:54:49,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=397, Invalid=1765, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 18:54:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-12-27 18:54:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 587. [2019-12-27 18:54:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 18:54:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 18:54:49,336 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 18:54:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:49,336 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 18:54:49,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:54:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 18:54:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:54:49,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:49,339 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:49,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:49,542 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 18:54:49,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 82199709, now seen corresponding path program 2 times [2019-12-27 18:54:49,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:49,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554295891] [2019-12-27 18:54:49,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:49,680 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 18:54:49,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554295891] [2019-12-27 18:54:49,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728247527] [2019-12-27 18:54:49,681 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 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 18:54:49,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:54:49,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:54:49,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:54:49,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:49,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:49,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 18:54:49,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1040639854] [2019-12-27 18:54:49,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:49,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:49,853 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 18:54:49,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:49,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:49,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:54:49,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:54:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:54:49,854 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 10 states. [2019-12-27 18:54:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:50,300 INFO L93 Difference]: Finished difference Result 1164 states and 3042 transitions. [2019-12-27 18:54:50,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:54:50,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-27 18:54:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:50,308 INFO L225 Difference]: With dead ends: 1164 [2019-12-27 18:54:50,308 INFO L226 Difference]: Without dead ends: 1159 [2019-12-27 18:54:50,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:54:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-12-27 18:54:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 536. [2019-12-27 18:54:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 18:54:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 18:54:50,330 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 18:54:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:50,330 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 18:54:50,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:54:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 18:54:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:54:50,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:50,332 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:50,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:50,544 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 18:54:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1885947986, now seen corresponding path program 1 times [2019-12-27 18:54:50,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:50,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704712039] [2019-12-27 18:54:50,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:50,597 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 18:54:50,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704712039] [2019-12-27 18:54:50,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:50,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:50,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679910272] [2019-12-27 18:54:50,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:50,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:50,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 18:54:50,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:50,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:50,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:50,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:50,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:50,602 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 18:54:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:50,690 INFO L93 Difference]: Finished difference Result 860 states and 2398 transitions. [2019-12-27 18:54:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:54:50,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:54:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:50,695 INFO L225 Difference]: With dead ends: 860 [2019-12-27 18:54:50,696 INFO L226 Difference]: Without dead ends: 852 [2019-12-27 18:54:50,696 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 18:54:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-12-27 18:54:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 549. [2019-12-27 18:54:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 18:54:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 18:54:50,713 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 18:54:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:50,713 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 18:54:50,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 18:54:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:54:50,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:50,714 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:50,714 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 18:54:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1661426381, now seen corresponding path program 1 times [2019-12-27 18:54:50,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:50,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215452827] [2019-12-27 18:54:50,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:54:50,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:54:50,741 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:54:50,741 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:54:50,741 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 18:54:50,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,754 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,755 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,755 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,755 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,755 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,755 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,755 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,756 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,756 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,756 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,757 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,757 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,757 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,758 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,758 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,758 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,759 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,759 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,759 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,759 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,759 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,759 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,760 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,760 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,760 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,761 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,761 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,761 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,761 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,761 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,761 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,761 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,768 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,768 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,769 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,769 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,769 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,770 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,770 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,770 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,770 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,770 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,772 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,772 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,772 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,773 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,773 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,792 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,793 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,793 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,793 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,793 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,794 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,795 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,795 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,795 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,795 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,797 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,797 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,798 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,800 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,803 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,804 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,804 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:54:50,807 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 18:54:50,807 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:54:50,807 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:54:50,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:54:50,808 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:54:50,808 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:54:50,808 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:54:50,808 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:54:50,808 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:54:50,810 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 110 transitions [2019-12-27 18:54:50,810 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-27 18:54:50,830 INFO L132 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-27 18:54:50,830 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 18:54:50,833 INFO L76 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 132 events. 6/132 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs. 0/120 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2019-12-27 18:54:50,838 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-27 18:54:50,856 INFO L132 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-27 18:54:50,856 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 18:54:50,858 INFO L76 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 132 events. 6/132 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs. 0/120 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2019-12-27 18:54:50,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-27 18:54:50,864 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:54:52,474 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 18:54:52,878 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2220 [2019-12-27 18:54:52,878 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 18:54:52,878 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 18:54:52,987 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 18:54:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 18:54:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:54:52,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:52,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:54:52,988 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 18:54:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash 792177, now seen corresponding path program 1 times [2019-12-27 18:54:52,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:52,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235425835] [2019-12-27 18:54:52,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:53,008 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 18:54:53,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235425835] [2019-12-27 18:54:53,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:53,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:54:53,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1757700255] [2019-12-27 18:54:53,010 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:53,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:53,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:54:53,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:53,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:53,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:54:53,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:54:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:54:53,012 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 18:54:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:53,056 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 18:54:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:54:53,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:54:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:53,073 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 18:54:53,073 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 18:54:53,073 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 18:54:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 18:54:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 18:54:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 18:54:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 18:54:53,136 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 18:54:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:53,137 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 18:54:53,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:54:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 18:54:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:54:53,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:53,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:53,138 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 18:54:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash -982045597, now seen corresponding path program 1 times [2019-12-27 18:54:53,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:53,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770318025] [2019-12-27 18:54:53,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:53,174 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 18:54:53,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770318025] [2019-12-27 18:54:53,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:53,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:53,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [226387419] [2019-12-27 18:54:53,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:53,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:53,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:54:53,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:53,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:53,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:53,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:53,178 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 18:54:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:53,289 INFO L93 Difference]: Finished difference Result 3302 states and 11435 transitions. [2019-12-27 18:54:53,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:54:53,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:54:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:53,314 INFO L225 Difference]: With dead ends: 3302 [2019-12-27 18:54:53,314 INFO L226 Difference]: Without dead ends: 3299 [2019-12-27 18:54:53,315 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 18:54:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-12-27 18:54:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 1914. [2019-12-27 18:54:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 18:54:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 18:54:53,399 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 18:54:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:53,399 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 18:54:53,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 18:54:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:54:53,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:53,400 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:53,400 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 18:54:53,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1476250518, now seen corresponding path program 1 times [2019-12-27 18:54:53,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:53,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985157351] [2019-12-27 18:54:53,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:53,444 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 18:54:53,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985157351] [2019-12-27 18:54:53,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:53,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:53,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1838217487] [2019-12-27 18:54:53,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:53,447 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:53,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:54:53,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:53,449 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:53,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:53,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:53,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:53,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:53,450 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 18:54:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:53,568 INFO L93 Difference]: Finished difference Result 3604 states and 12619 transitions. [2019-12-27 18:54:53,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:54:53,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:54:53,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:53,595 INFO L225 Difference]: With dead ends: 3604 [2019-12-27 18:54:53,595 INFO L226 Difference]: Without dead ends: 3600 [2019-12-27 18:54:53,595 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 18:54:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2019-12-27 18:54:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 2147. [2019-12-27 18:54:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 18:54:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 18:54:53,731 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 18:54:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:53,732 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 18:54:53,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 18:54:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:54:53,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:53,733 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:53,733 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 18:54:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash 65367165, now seen corresponding path program 1 times [2019-12-27 18:54:53,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:53,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332032980] [2019-12-27 18:54:53,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:53,831 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 18:54:53,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332032980] [2019-12-27 18:54:53,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002395158] [2019-12-27 18:54:53,832 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 18:54:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:53,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:54:53,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:54,048 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 18:54:54,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:54,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 18:54:54,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930767508] [2019-12-27 18:54:54,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:54,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:54,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 18:54:54,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:54,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 18:54:54,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:54:54,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:54,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:54:54,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:54:54,118 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 14 states. [2019-12-27 18:54:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:54,985 INFO L93 Difference]: Finished difference Result 5407 states and 17295 transitions. [2019-12-27 18:54:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 18:54:54,985 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-12-27 18:54:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:55,004 INFO L225 Difference]: With dead ends: 5407 [2019-12-27 18:54:55,004 INFO L226 Difference]: Without dead ends: 5402 [2019-12-27 18:54:55,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 18:54:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-12-27 18:54:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 2109. [2019-12-27 18:54:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 18:54:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 18:54:55,145 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 18:54:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:55,146 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 18:54:55,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:54:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 18:54:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:54:55,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:55,147 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:55,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:55,350 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 18:54:55,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1337558845, now seen corresponding path program 2 times [2019-12-27 18:54:55,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:55,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839969828] [2019-12-27 18:54:55,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:55,446 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 18:54:55,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839969828] [2019-12-27 18:54:55,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941034597] [2019-12-27 18:54:55,447 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 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 18:54:55,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:54:55,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:54:55,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:54:55,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:55,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:55,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 18:54:55,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311753588] [2019-12-27 18:54:55,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:55,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:55,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 18:54:55,675 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:55,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:55,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:54:55,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:54:55,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:54:55,676 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 10 states. [2019-12-27 18:54:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:56,188 INFO L93 Difference]: Finished difference Result 5134 states and 16725 transitions. [2019-12-27 18:54:56,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:54:56,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-27 18:54:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:56,204 INFO L225 Difference]: With dead ends: 5134 [2019-12-27 18:54:56,205 INFO L226 Difference]: Without dead ends: 5129 [2019-12-27 18:54:56,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:54:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2019-12-27 18:54:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 1998. [2019-12-27 18:54:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 18:54:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 18:54:56,290 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 18:54:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:56,290 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 18:54:56,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:54:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 18:54:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:54:56,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:56,291 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:56,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:56,495 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 18:54:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash -773481600, now seen corresponding path program 1 times [2019-12-27 18:54:56,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:56,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271848776] [2019-12-27 18:54:56,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:56,538 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 18:54:56,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271848776] [2019-12-27 18:54:56,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:54:56,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:54:56,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [115294037] [2019-12-27 18:54:56,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:56,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:56,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 18:54:56,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:56,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:54:56,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:54:56,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:56,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:54:56,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:54:56,544 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 18:54:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:56,679 INFO L93 Difference]: Finished difference Result 3692 states and 13037 transitions. [2019-12-27 18:54:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:54:56,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:54:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:56,691 INFO L225 Difference]: With dead ends: 3692 [2019-12-27 18:54:56,691 INFO L226 Difference]: Without dead ends: 3684 [2019-12-27 18:54:56,691 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 18:54:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2019-12-27 18:54:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2245. [2019-12-27 18:54:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 18:54:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 18:54:56,772 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 18:54:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:56,773 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 18:54:56,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:54:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 18:54:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:54:56,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:56,774 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:56,775 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 18:54:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2045174229, now seen corresponding path program 1 times [2019-12-27 18:54:56,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:56,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474621110] [2019-12-27 18:54:56,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:56,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474621110] [2019-12-27 18:54:56,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184428823] [2019-12-27 18:54:56,966 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 18:54:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:57,042 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 18:54:57,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:57,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:57,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 18:54:57,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1148882521] [2019-12-27 18:54:57,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:57,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:57,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 18:54:57,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:57,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:54:57,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:54:57,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:57,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:54:57,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:54:57,308 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 17 states. [2019-12-27 18:54:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:54:58,528 INFO L93 Difference]: Finished difference Result 5149 states and 16756 transitions. [2019-12-27 18:54:58,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:54:58,528 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-12-27 18:54:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:54:58,542 INFO L225 Difference]: With dead ends: 5149 [2019-12-27 18:54:58,542 INFO L226 Difference]: Without dead ends: 5140 [2019-12-27 18:54:58,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=601, Invalid=2369, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 18:54:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2019-12-27 18:54:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 2270. [2019-12-27 18:54:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 18:54:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 18:54:58,697 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 18:54:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:54:58,699 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 18:54:58,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:54:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 18:54:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:54:58,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:54:58,705 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:54:58,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:54:58,909 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 18:54:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:54:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash -287060421, now seen corresponding path program 1 times [2019-12-27 18:54:58,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:54:58,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615785451] [2019-12-27 18:54:58,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:54:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:59,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615785451] [2019-12-27 18:54:59,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023296369] [2019-12-27 18:54:59,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 18:54:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:54:59,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 18:54:59,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:54:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:54:59,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:54:59,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 18:54:59,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1514464849] [2019-12-27 18:54:59,190 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:54:59,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:54:59,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 18:54:59,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:54:59,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:54:59,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:54:59,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:54:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:54:59,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:54:59,278 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 15 states. [2019-12-27 18:55:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:00,424 INFO L93 Difference]: Finished difference Result 5430 states and 17495 transitions. [2019-12-27 18:55:00,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 18:55:00,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-12-27 18:55:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:00,439 INFO L225 Difference]: With dead ends: 5430 [2019-12-27 18:55:00,440 INFO L226 Difference]: Without dead ends: 5417 [2019-12-27 18:55:00,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=570, Invalid=2186, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 18:55:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5417 states. [2019-12-27 18:55:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5417 to 2267. [2019-12-27 18:55:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 18:55:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 18:55:00,525 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 18:55:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:00,526 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 18:55:00,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:55:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 18:55:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:00,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:00,527 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:00,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:00,731 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 18:55:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -286456665, now seen corresponding path program 2 times [2019-12-27 18:55:00,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:00,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421704741] [2019-12-27 18:55:00,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:00,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421704741] [2019-12-27 18:55:00,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229168977] [2019-12-27 18:55:00,887 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 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 18:55:00,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:00,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:00,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:55:00,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:55:01,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:01,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 18:55:01,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555898618] [2019-12-27 18:55:01,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:01,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:01,121 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:55:01,121 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:01,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:01,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:55:01,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:55:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:55:01,123 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 11 states. [2019-12-27 18:55:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:01,780 INFO L93 Difference]: Finished difference Result 5857 states and 20200 transitions. [2019-12-27 18:55:01,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:55:01,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 18:55:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:01,790 INFO L225 Difference]: With dead ends: 5857 [2019-12-27 18:55:01,791 INFO L226 Difference]: Without dead ends: 5848 [2019-12-27 18:55:01,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:55:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2019-12-27 18:55:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 2192. [2019-12-27 18:55:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 18:55:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 18:55:01,858 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 18:55:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:01,859 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 18:55:01,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:55:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 18:55:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:01,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:01,860 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:02,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:02,061 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 18:55:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash -286465221, now seen corresponding path program 2 times [2019-12-27 18:55:02,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:02,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062285085] [2019-12-27 18:55:02,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:02,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062285085] [2019-12-27 18:55:02,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624523185] [2019-12-27 18:55:02,169 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 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 18:55:02,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:02,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:02,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:55:02,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:55:02,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:02,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 18:55:02,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1347372917] [2019-12-27 18:55:02,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:02,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:02,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:55:02,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:02,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:02,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:55:02,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:55:02,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:55:02,344 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 11 states. [2019-12-27 18:55:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:03,018 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 18:55:03,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:55:03,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 18:55:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:03,026 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 18:55:03,026 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 18:55:03,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:55:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 18:55:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 18:55:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 18:55:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 18:55:03,076 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 18:55:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:03,077 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 18:55:03,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:55:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 18:55:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:03,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:03,078 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 18:55:03,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:03,279 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 18:55:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:03,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1682002470, now seen corresponding path program 1 times [2019-12-27 18:55:03,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:03,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113982888] [2019-12-27 18:55:03,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:03,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113982888] [2019-12-27 18:55:03,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773898943] [2019-12-27 18:55:03,401 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 18:55:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:03,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:03,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:03,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:03,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:55:03,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [487071272] [2019-12-27 18:55:03,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:03,649 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:03,654 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 18:55:03,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:03,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:55:03,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 18:55:03,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:03,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 18:55:03,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:55:03,861 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 23 states. [2019-12-27 18:55:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:07,790 INFO L93 Difference]: Finished difference Result 7327 states and 21686 transitions. [2019-12-27 18:55:07,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-12-27 18:55:07,790 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-27 18:55:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:07,801 INFO L225 Difference]: With dead ends: 7327 [2019-12-27 18:55:07,801 INFO L226 Difference]: Without dead ends: 7320 [2019-12-27 18:55:07,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4997 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2620, Invalid=12632, Unknown=0, NotChecked=0, Total=15252 [2019-12-27 18:55:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2019-12-27 18:55:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 2101. [2019-12-27 18:55:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 18:55:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 18:55:07,881 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 18:55:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:07,881 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 18:55:07,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 18:55:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 18:55:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:07,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:07,884 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 18:55:08,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:08,087 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 18:55:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1682597670, now seen corresponding path program 2 times [2019-12-27 18:55:08,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:08,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149646133] [2019-12-27 18:55:08,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:08,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149646133] [2019-12-27 18:55:08,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015989085] [2019-12-27 18:55:08,268 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 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 18:55:08,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:08,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:08,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:08,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:08,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:08,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:55:08,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309563418] [2019-12-27 18:55:08,564 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:08,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:08,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:55:08,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:08,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:55:08,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:55:08,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:08,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:55:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:55:08,722 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 19 states. [2019-12-27 18:55:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:11,558 INFO L93 Difference]: Finished difference Result 7492 states and 22313 transitions. [2019-12-27 18:55:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-27 18:55:11,559 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-12-27 18:55:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:11,569 INFO L225 Difference]: With dead ends: 7492 [2019-12-27 18:55:11,569 INFO L226 Difference]: Without dead ends: 7483 [2019-12-27 18:55:11,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1708, Invalid=8392, Unknown=0, NotChecked=0, Total=10100 [2019-12-27 18:55:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2019-12-27 18:55:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 2071. [2019-12-27 18:55:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 18:55:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 18:55:11,659 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 18:55:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:11,660 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 18:55:11,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:55:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 18:55:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:11,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:11,662 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:11,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:11,874 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 18:55:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1343161106, now seen corresponding path program 1 times [2019-12-27 18:55:11,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:11,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353607445] [2019-12-27 18:55:11,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:11,914 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 18:55:11,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353607445] [2019-12-27 18:55:11,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:11,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:11,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1058009618] [2019-12-27 18:55:11,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:11,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:11,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:11,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:11,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:11,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:11,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:11,923 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 5 states. [2019-12-27 18:55:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:12,037 INFO L93 Difference]: Finished difference Result 3639 states and 12826 transitions. [2019-12-27 18:55:12,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:55:12,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 18:55:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:12,051 INFO L225 Difference]: With dead ends: 3639 [2019-12-27 18:55:12,051 INFO L226 Difference]: Without dead ends: 3623 [2019-12-27 18:55:12,051 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 18:55:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2019-12-27 18:55:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2308. [2019-12-27 18:55:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-12-27 18:55:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 8729 transitions. [2019-12-27 18:55:12,116 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 8729 transitions. Word has length 21 [2019-12-27 18:55:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:12,116 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 8729 transitions. [2019-12-27 18:55:12,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 8729 transitions. [2019-12-27 18:55:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:12,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:12,120 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 18:55:12,121 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 18:55:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash -979520350, now seen corresponding path program 3 times [2019-12-27 18:55:12,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:12,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913175523] [2019-12-27 18:55:12,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:12,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913175523] [2019-12-27 18:55:12,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105830633] [2019-12-27 18:55:12,249 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 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 18:55:12,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 18:55:12,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:12,319 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:12,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:12,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:12,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:55:12,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [166004996] [2019-12-27 18:55:12,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:12,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:12,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:55:12,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:12,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:55:12,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 18:55:12,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:12,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 18:55:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:12,664 INFO L87 Difference]: Start difference. First operand 2308 states and 8729 transitions. Second operand 21 states. [2019-12-27 18:55:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:17,336 INFO L93 Difference]: Finished difference Result 7795 states and 22797 transitions. [2019-12-27 18:55:17,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-12-27 18:55:17,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-12-27 18:55:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:17,350 INFO L225 Difference]: With dead ends: 7795 [2019-12-27 18:55:17,350 INFO L226 Difference]: Without dead ends: 7782 [2019-12-27 18:55:17,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7111 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3383, Invalid=16923, Unknown=0, NotChecked=0, Total=20306 [2019-12-27 18:55:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7782 states. [2019-12-27 18:55:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7782 to 2216. [2019-12-27 18:55:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2019-12-27 18:55:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8379 transitions. [2019-12-27 18:55:17,448 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8379 transitions. Word has length 21 [2019-12-27 18:55:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:17,449 INFO L462 AbstractCegarLoop]: Abstraction has 2216 states and 8379 transitions. [2019-12-27 18:55:17,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 18:55:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8379 transitions. [2019-12-27 18:55:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:17,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:17,451 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 18:55:17,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:17,656 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 18:55:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash -987138910, now seen corresponding path program 4 times [2019-12-27 18:55:17,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:17,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594239246] [2019-12-27 18:55:17,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:17,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594239246] [2019-12-27 18:55:17,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929494655] [2019-12-27 18:55:17,774 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 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 18:55:17,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:55:17,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:17,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:17,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:17,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:17,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:55:17,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1861227949] [2019-12-27 18:55:17,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:18,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:18,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 18:55:18,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:18,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:18,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:55:18,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:18,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:55:18,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:55:18,073 INFO L87 Difference]: Start difference. First operand 2216 states and 8379 transitions. Second operand 17 states. [2019-12-27 18:55:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:21,328 INFO L93 Difference]: Finished difference Result 7959 states and 23506 transitions. [2019-12-27 18:55:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-12-27 18:55:21,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 18:55:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:21,340 INFO L225 Difference]: With dead ends: 7959 [2019-12-27 18:55:21,340 INFO L226 Difference]: Without dead ends: 7944 [2019-12-27 18:55:21,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4062 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1959, Invalid=10031, Unknown=0, NotChecked=0, Total=11990 [2019-12-27 18:55:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2019-12-27 18:55:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 2174. [2019-12-27 18:55:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 18:55:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 18:55:21,430 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 18:55:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:21,431 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 18:55:21,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:55:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 18:55:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:21,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:21,432 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 18:55:21,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:21,633 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 18:55:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash -406937950, now seen corresponding path program 5 times [2019-12-27 18:55:21,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:21,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914190266] [2019-12-27 18:55:21,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:21,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914190266] [2019-12-27 18:55:21,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025432627] [2019-12-27 18:55:21,732 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_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 18:55:21,805 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 18:55:21,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:21,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:21,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:22,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:22,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:55:22,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336130370] [2019-12-27 18:55:22,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:22,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:22,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:22,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:22,019 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:22,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:55:22,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:22,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:55:22,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:55:22,020 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 13 states. [2019-12-27 18:55:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:23,413 INFO L93 Difference]: Finished difference Result 8755 states and 27773 transitions. [2019-12-27 18:55:23,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 18:55:23,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 18:55:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:23,427 INFO L225 Difference]: With dead ends: 8755 [2019-12-27 18:55:23,427 INFO L226 Difference]: Without dead ends: 8748 [2019-12-27 18:55:23,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=731, Invalid=3051, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 18:55:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8748 states. [2019-12-27 18:55:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8748 to 2090. [2019-12-27 18:55:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 18:55:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 18:55:23,517 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 18:55:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:23,518 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 18:55:23,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:55:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 18:55:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:23,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:23,520 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 18:55:23,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:23,723 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 18:55:23,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash -415151710, now seen corresponding path program 6 times [2019-12-27 18:55:23,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:23,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834193760] [2019-12-27 18:55:23,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:23,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834193760] [2019-12-27 18:55:23,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047765913] [2019-12-27 18:55:23,851 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 18:55:23,919 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 18:55:23,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:23,920 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:23,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:24,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:24,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:55:24,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223939082] [2019-12-27 18:55:24,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:24,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:24,086 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:55:24,087 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:24,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:24,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:55:24,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:55:24,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:55:24,088 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 13 states. [2019-12-27 18:55:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:25,441 INFO L93 Difference]: Finished difference Result 6684 states and 20556 transitions. [2019-12-27 18:55:25,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 18:55:25,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 18:55:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:25,453 INFO L225 Difference]: With dead ends: 6684 [2019-12-27 18:55:25,453 INFO L226 Difference]: Without dead ends: 6674 [2019-12-27 18:55:25,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=764, Invalid=3268, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 18:55:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2019-12-27 18:55:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 1965. [2019-12-27 18:55:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 18:55:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 18:55:25,508 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 18:55:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:25,508 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 18:55:25,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:55:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 18:55:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:55:25,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:25,510 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:25,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:25,711 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 18:55:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:25,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1316541292, now seen corresponding path program 1 times [2019-12-27 18:55:25,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:25,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996254486] [2019-12-27 18:55:25,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:55:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:55:25,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:55:25,734 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:55:25,734 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:55:25,734 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 18:55:25,751 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,752 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,752 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,752 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,753 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,753 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,754 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,754 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,754 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,754 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,755 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,755 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,755 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,755 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,755 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,755 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,755 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,756 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,756 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,756 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,756 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,757 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,757 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,761 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,763 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,764 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,764 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,765 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,765 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,766 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,766 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,767 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,767 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,767 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,767 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,767 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,767 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,767 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,768 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,768 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,768 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,768 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,769 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,770 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,770 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,770 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,770 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,771 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,771 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,771 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,772 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,772 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,773 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,773 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,773 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,773 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,773 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,774 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,775 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,775 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,775 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,775 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,776 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,776 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,777 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,778 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,778 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,783 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,784 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:55:25,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 18:55:25,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:55:25,785 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:55:25,785 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:55:25,785 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:55:25,785 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:55:25,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:55:25,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:55:25,786 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:55:25,787 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 128 transitions [2019-12-27 18:55:25,788 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 128 transitions [2019-12-27 18:55:25,815 INFO L132 PetriNetUnfolder]: 7/154 cut-off events. [2019-12-27 18:55:25,816 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 18:55:25,818 INFO L76 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 154 events. 7/154 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2019-12-27 18:55:25,825 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 128 transitions [2019-12-27 18:55:25,845 INFO L132 PetriNetUnfolder]: 7/154 cut-off events. [2019-12-27 18:55:25,846 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 18:55:25,848 INFO L76 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 154 events. 7/154 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2019-12-27 18:55:25,855 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-27 18:55:25,855 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:55:28,122 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-27 18:55:28,227 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3419 [2019-12-27 18:55:28,227 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 18:55:28,228 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 18:55:28,590 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 18:55:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 18:55:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:55:28,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:28,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:55:28,590 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 18:55:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1051879, now seen corresponding path program 1 times [2019-12-27 18:55:28,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:28,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735544301] [2019-12-27 18:55:28,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:28,613 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 18:55:28,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735544301] [2019-12-27 18:55:28,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:28,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:55:28,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995706633] [2019-12-27 18:55:28,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:28,615 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:28,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:55:28,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:28,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:28,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:55:28,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:55:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:55:28,616 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 18:55:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:28,688 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 18:55:28,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:55:28,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:55:28,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:28,715 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 18:55:28,715 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 18:55:28,716 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 18:55:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 18:55:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 18:55:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 18:55:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 18:55:28,914 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 18:55:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:28,914 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 18:55:28,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:55:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 18:55:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:55:28,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:28,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:28,915 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 18:55:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash -598137854, now seen corresponding path program 1 times [2019-12-27 18:55:28,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:28,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649106971] [2019-12-27 18:55:28,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:28,957 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 18:55:28,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649106971] [2019-12-27 18:55:28,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:28,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:28,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029474017] [2019-12-27 18:55:28,958 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:28,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:28,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:55:28,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:28,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:28,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:28,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:28,960 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 18:55:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:29,169 INFO L93 Difference]: Finished difference Result 11058 states and 45915 transitions. [2019-12-27 18:55:29,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:55:29,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:55:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:29,204 INFO L225 Difference]: With dead ends: 11058 [2019-12-27 18:55:29,205 INFO L226 Difference]: Without dead ends: 11055 [2019-12-27 18:55:29,205 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 18:55:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2019-12-27 18:55:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 6120. [2019-12-27 18:55:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 18:55:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 18:55:29,441 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 18:55:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:29,441 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 18:55:29,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 18:55:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:55:29,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:29,442 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:29,442 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 18:55:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:29,443 INFO L82 PathProgramCache]: Analyzing trace with hash 63286460, now seen corresponding path program 1 times [2019-12-27 18:55:29,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:29,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813896172] [2019-12-27 18:55:29,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:29,477 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 18:55:29,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813896172] [2019-12-27 18:55:29,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:29,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:29,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1838169120] [2019-12-27 18:55:29,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:29,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:29,479 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:55:29,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:29,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:29,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:29,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:29,480 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 18:55:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:29,634 INFO L93 Difference]: Finished difference Result 12424 states and 52328 transitions. [2019-12-27 18:55:29,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:55:29,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:55:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:29,662 INFO L225 Difference]: With dead ends: 12424 [2019-12-27 18:55:29,663 INFO L226 Difference]: Without dead ends: 12420 [2019-12-27 18:55:29,663 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 18:55:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2019-12-27 18:55:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 7145. [2019-12-27 18:55:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 18:55:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 18:55:30,496 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 18:55:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:30,496 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 18:55:30,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 18:55:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:55:30,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:30,497 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:30,497 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 18:55:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash -697924765, now seen corresponding path program 1 times [2019-12-27 18:55:30,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:30,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137076149] [2019-12-27 18:55:30,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:30,574 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 18:55:30,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137076149] [2019-12-27 18:55:30,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819063699] [2019-12-27 18:55:30,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 18:55:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:30,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:55:30,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:30,768 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 18:55:30,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:30,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 18:55:30,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1155907539] [2019-12-27 18:55:30,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:30,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:30,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 18:55:30,772 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:30,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:55:30,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:55:30,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:30,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:55:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:55:30,826 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 14 states. [2019-12-27 18:55:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:31,862 INFO L93 Difference]: Finished difference Result 21612 states and 84062 transitions. [2019-12-27 18:55:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:55:31,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-12-27 18:55:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:31,910 INFO L225 Difference]: With dead ends: 21612 [2019-12-27 18:55:31,910 INFO L226 Difference]: Without dead ends: 21605 [2019-12-27 18:55:31,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1765, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 18:55:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21605 states. [2019-12-27 18:55:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21605 to 7067. [2019-12-27 18:55:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 18:55:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 18:55:32,160 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 18:55:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:32,160 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 18:55:32,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:55:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 18:55:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:55:32,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:32,161 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:32,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:32,364 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 18:55:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash 688753653, now seen corresponding path program 2 times [2019-12-27 18:55:32,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:32,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977057056] [2019-12-27 18:55:32,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:32,428 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 18:55:32,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977057056] [2019-12-27 18:55:32,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614186949] [2019-12-27 18:55:32,429 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 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 18:55:32,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:32,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:32,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:55:32,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:32,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:32,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 18:55:32,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478526251] [2019-12-27 18:55:32,715 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:32,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:32,717 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 18:55:32,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:32,718 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:32,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:55:32,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:32,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:55:32,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:55:32,718 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 10 states. [2019-12-27 18:55:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:33,308 INFO L93 Difference]: Finished difference Result 19032 states and 75110 transitions. [2019-12-27 18:55:33,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:55:33,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-27 18:55:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:33,351 INFO L225 Difference]: With dead ends: 19032 [2019-12-27 18:55:33,351 INFO L226 Difference]: Without dead ends: 19027 [2019-12-27 18:55:33,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:55:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19027 states. [2019-12-27 18:55:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19027 to 6836. [2019-12-27 18:55:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 18:55:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 18:55:33,571 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 18:55:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:33,571 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 18:55:33,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:55:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 18:55:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:55:33,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:33,572 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:33,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:33,773 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 18:55:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1133625120, now seen corresponding path program 1 times [2019-12-27 18:55:33,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:33,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062053481] [2019-12-27 18:55:33,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:33,809 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 18:55:33,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062053481] [2019-12-27 18:55:33,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:55:33,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:55:33,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1869239701] [2019-12-27 18:55:33,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:33,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:33,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 18:55:33,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:33,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:33,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:55:33,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:55:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:55:33,813 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 18:55:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:33,972 INFO L93 Difference]: Finished difference Result 13584 states and 58018 transitions. [2019-12-27 18:55:33,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:55:33,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:55:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:34,004 INFO L225 Difference]: With dead ends: 13584 [2019-12-27 18:55:34,004 INFO L226 Difference]: Without dead ends: 13576 [2019-12-27 18:55:34,004 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 18:55:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13576 states. [2019-12-27 18:55:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13576 to 8095. [2019-12-27 18:55:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 18:55:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 18:55:34,399 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 18:55:34,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:34,399 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 18:55:34,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:55:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 18:55:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:34,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:34,400 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:34,401 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 18:55:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:34,401 INFO L82 PathProgramCache]: Analyzing trace with hash 266693639, now seen corresponding path program 1 times [2019-12-27 18:55:34,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:34,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781928991] [2019-12-27 18:55:34,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:34,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781928991] [2019-12-27 18:55:34,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924774853] [2019-12-27 18:55:34,484 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 18:55:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:34,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 18:55:34,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:34,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:34,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 18:55:34,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517062622] [2019-12-27 18:55:34,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:34,696 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:34,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 18:55:34,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:34,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:34,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:55:34,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:34,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:55:34,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:55:34,778 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 16 states. [2019-12-27 18:55:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:36,149 INFO L93 Difference]: Finished difference Result 21706 states and 86440 transitions. [2019-12-27 18:55:36,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 18:55:36,149 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-27 18:55:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:36,199 INFO L225 Difference]: With dead ends: 21706 [2019-12-27 18:55:36,199 INFO L226 Difference]: Without dead ends: 21695 [2019-12-27 18:55:36,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=576, Invalid=2730, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 18:55:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21695 states. [2019-12-27 18:55:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21695 to 8204. [2019-12-27 18:55:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 18:55:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 18:55:36,462 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 18:55:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:36,463 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 18:55:36,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:55:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 18:55:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:36,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:36,464 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:36,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:36,665 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 18:55:36,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1890641739, now seen corresponding path program 1 times [2019-12-27 18:55:36,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:36,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467243517] [2019-12-27 18:55:36,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:36,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467243517] [2019-12-27 18:55:36,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601704039] [2019-12-27 18:55:36,730 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 18:55:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:36,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 18:55:36,805 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:37,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:37,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 18:55:37,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [359551136] [2019-12-27 18:55:37,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:37,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:37,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 18:55:37,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:37,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:55:37,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:55:37,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:37,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:55:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:55:37,104 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 15 states. [2019-12-27 18:55:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:38,570 INFO L93 Difference]: Finished difference Result 22183 states and 89032 transitions. [2019-12-27 18:55:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 18:55:38,571 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-12-27 18:55:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:38,632 INFO L225 Difference]: With dead ends: 22183 [2019-12-27 18:55:38,633 INFO L226 Difference]: Without dead ends: 22168 [2019-12-27 18:55:38,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=543, Invalid=2109, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 18:55:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22168 states. [2019-12-27 18:55:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22168 to 8237. [2019-12-27 18:55:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-27 18:55:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-27 18:55:38,896 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-27 18:55:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:38,896 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-27 18:55:38,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:55:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-27 18:55:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:38,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:38,898 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:39,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:39,101 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 18:55:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1507971637, now seen corresponding path program 2 times [2019-12-27 18:55:39,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:39,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317480951] [2019-12-27 18:55:39,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:39,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317480951] [2019-12-27 18:55:39,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272732368] [2019-12-27 18:55:39,206 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 18:55:39,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:39,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:39,316 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:55:39,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:55:39,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:39,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 18:55:39,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [439465105] [2019-12-27 18:55:39,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:39,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:39,500 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:55:39,500 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:39,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:39,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:55:39,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:55:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:55:39,502 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 11 states. [2019-12-27 18:55:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:40,435 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-27 18:55:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:55:40,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 18:55:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:40,479 INFO L225 Difference]: With dead ends: 19350 [2019-12-27 18:55:40,479 INFO L226 Difference]: Without dead ends: 19341 [2019-12-27 18:55:40,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:55:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-27 18:55:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-27 18:55:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-27 18:55:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-27 18:55:40,733 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-27 18:55:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:40,733 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-27 18:55:40,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:55:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-27 18:55:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:55:40,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:40,734 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:55:40,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:40,935 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 18:55:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1507960601, now seen corresponding path program 2 times [2019-12-27 18:55:40,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:40,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767095755] [2019-12-27 18:55:40,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:41,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767095755] [2019-12-27 18:55:41,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141281222] [2019-12-27 18:55:41,022 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 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 18:55:41,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:41,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:41,099 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:55:41,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:55:41,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:41,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 18:55:41,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944287596] [2019-12-27 18:55:41,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:41,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:41,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:55:41,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:41,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:55:41,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:55:41,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:55:41,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:55:41,197 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 11 states. [2019-12-27 18:55:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:41,933 INFO L93 Difference]: Finished difference Result 21997 states and 91733 transitions. [2019-12-27 18:55:41,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:55:41,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 18:55:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:41,987 INFO L225 Difference]: With dead ends: 21997 [2019-12-27 18:55:41,987 INFO L226 Difference]: Without dead ends: 21988 [2019-12-27 18:55:41,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:55:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21988 states. [2019-12-27 18:55:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21988 to 8107. [2019-12-27 18:55:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 18:55:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 18:55:42,260 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 18:55:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:42,261 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 18:55:42,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:55:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 18:55:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:42,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:42,262 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 18:55:42,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:42,463 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 18:55:42,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash -509077988, now seen corresponding path program 1 times [2019-12-27 18:55:42,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:42,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016602300] [2019-12-27 18:55:42,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:42,695 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 18:55:42,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016602300] [2019-12-27 18:55:42,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759598870] [2019-12-27 18:55:42,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 18:55:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:42,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:42,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:42,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:42,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 18:55:42,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97171237] [2019-12-27 18:55:42,926 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:42,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:42,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 18:55:42,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:43,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:55:43,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 18:55:43,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:43,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 18:55:43,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:55:43,072 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 21 states. [2019-12-27 18:55:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:48,112 INFO L93 Difference]: Finished difference Result 42862 states and 156826 transitions. [2019-12-27 18:55:48,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-12-27 18:55:48,112 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-12-27 18:55:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:48,205 INFO L225 Difference]: With dead ends: 42862 [2019-12-27 18:55:48,206 INFO L226 Difference]: Without dead ends: 42846 [2019-12-27 18:55:48,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7666 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3363, Invalid=18393, Unknown=0, NotChecked=0, Total=21756 [2019-12-27 18:55:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42846 states. [2019-12-27 18:55:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42846 to 8199. [2019-12-27 18:55:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8199 states. [2019-12-27 18:55:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8199 states to 8199 states and 38213 transitions. [2019-12-27 18:55:48,629 INFO L78 Accepts]: Start accepts. Automaton has 8199 states and 38213 transitions. Word has length 21 [2019-12-27 18:55:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:48,630 INFO L462 AbstractCegarLoop]: Abstraction has 8199 states and 38213 transitions. [2019-12-27 18:55:48,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 18:55:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 38213 transitions. [2019-12-27 18:55:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:48,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:48,631 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 18:55:48,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:48,832 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 18:55:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1405431908, now seen corresponding path program 2 times [2019-12-27 18:55:48,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:48,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399770577] [2019-12-27 18:55:48,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:48,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399770577] [2019-12-27 18:55:48,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43575022] [2019-12-27 18:55:48,922 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 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 18:55:49,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:55:49,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:49,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:49,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:49,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:49,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:55:49,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1514237095] [2019-12-27 18:55:49,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:49,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:49,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:55:49,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:49,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:55:49,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:55:49,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:55:49,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-12-27 18:55:49,245 INFO L87 Difference]: Start difference. First operand 8199 states and 38213 transitions. Second operand 18 states. [2019-12-27 18:55:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:52,837 INFO L93 Difference]: Finished difference Result 35046 states and 129816 transitions. [2019-12-27 18:55:52,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-27 18:55:52,838 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-27 18:55:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:52,917 INFO L225 Difference]: With dead ends: 35046 [2019-12-27 18:55:52,917 INFO L226 Difference]: Without dead ends: 35035 [2019-12-27 18:55:52,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3885 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1866, Invalid=10124, Unknown=0, NotChecked=0, Total=11990 [2019-12-27 18:55:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35035 states. [2019-12-27 18:55:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35035 to 8093. [2019-12-27 18:55:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8093 states. [2019-12-27 18:55:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8093 states to 8093 states and 37675 transitions. [2019-12-27 18:55:53,278 INFO L78 Accepts]: Start accepts. Automaton has 8093 states and 37675 transitions. Word has length 21 [2019-12-27 18:55:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:55:53,278 INFO L462 AbstractCegarLoop]: Abstraction has 8093 states and 37675 transitions. [2019-12-27 18:55:53,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:55:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8093 states and 37675 transitions. [2019-12-27 18:55:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:55:53,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:55:53,280 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 18:55:53,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:55:53,481 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 18:55:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:55:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1535369572, now seen corresponding path program 3 times [2019-12-27 18:55:53,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:55:53,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143935028] [2019-12-27 18:55:53,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:55:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:55:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:53,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143935028] [2019-12-27 18:55:53,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138228813] [2019-12-27 18:55:53,566 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 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 18:55:53,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 18:55:53,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:55:53,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:55:53,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:55:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:55:53,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:55:53,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 18:55:53,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1286864331] [2019-12-27 18:55:53,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:55:53,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:55:53,800 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:55:53,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:55:53,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:55:53,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:55:53,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:55:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:55:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:55:53,916 INFO L87 Difference]: Start difference. First operand 8093 states and 37675 transitions. Second operand 20 states. [2019-12-27 18:55:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:55:59,381 INFO L93 Difference]: Finished difference Result 41583 states and 152385 transitions. [2019-12-27 18:55:59,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-12-27 18:55:59,381 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-12-27 18:55:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:55:59,473 INFO L225 Difference]: With dead ends: 41583 [2019-12-27 18:55:59,474 INFO L226 Difference]: Without dead ends: 41575 [2019-12-27 18:55:59,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7065 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3167, Invalid=16855, Unknown=0, NotChecked=0, Total=20022 [2019-12-27 18:55:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41575 states. [2019-12-27 18:56:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41575 to 7675. [2019-12-27 18:56:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-27 18:56:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-27 18:56:00,802 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-27 18:56:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:00,802 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-27 18:56:00,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:56:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-27 18:56:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:00,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:00,803 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 18:56:01,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:01,007 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 18:56:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash -135537234, now seen corresponding path program 4 times [2019-12-27 18:56:01,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:01,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702971582] [2019-12-27 18:56:01,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:01,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702971582] [2019-12-27 18:56:01,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115517863] [2019-12-27 18:56:01,091 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 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 18:56:01,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:56:01,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:01,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:56:01,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:01,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:01,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:56:01,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1419120468] [2019-12-27 18:56:01,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:01,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:01,323 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 18:56:01,323 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:01,375 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:56:01,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:56:01,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:01,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:56:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:56:01,376 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 17 states. [2019-12-27 18:56:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:04,935 INFO L93 Difference]: Finished difference Result 33023 states and 122250 transitions. [2019-12-27 18:56:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 18:56:04,936 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 18:56:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:05,011 INFO L225 Difference]: With dead ends: 33023 [2019-12-27 18:56:05,011 INFO L226 Difference]: Without dead ends: 33012 [2019-12-27 18:56:05,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2804 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1539, Invalid=7391, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 18:56:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33012 states. [2019-12-27 18:56:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33012 to 7569. [2019-12-27 18:56:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-27 18:56:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-27 18:56:05,509 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-27 18:56:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:05,509 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-27 18:56:05,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:56:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-27 18:56:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:05,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:05,511 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 18:56:05,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:05,712 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 18:56:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:05,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1756772142, now seen corresponding path program 5 times [2019-12-27 18:56:05,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:05,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975361528] [2019-12-27 18:56:05,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:05,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975361528] [2019-12-27 18:56:05,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255971621] [2019-12-27 18:56:05,813 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_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 18:56:05,899 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 18:56:05,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:05,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:56:05,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:06,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:06,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:56:06,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297865518] [2019-12-27 18:56:06,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:06,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:06,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:56:06,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:06,054 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:06,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:56:06,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:56:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:56:06,055 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 13 states. [2019-12-27 18:56:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:07,615 INFO L93 Difference]: Finished difference Result 29274 states and 110026 transitions. [2019-12-27 18:56:07,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 18:56:07,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 18:56:07,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:07,680 INFO L225 Difference]: With dead ends: 29274 [2019-12-27 18:56:07,680 INFO L226 Difference]: Without dead ends: 29270 [2019-12-27 18:56:07,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=764, Invalid=3268, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 18:56:07,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29270 states. [2019-12-27 18:56:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29270 to 7359. [2019-12-27 18:56:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7359 states. [2019-12-27 18:56:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7359 states to 7359 states and 34126 transitions. [2019-12-27 18:56:07,983 INFO L78 Accepts]: Start accepts. Automaton has 7359 states and 34126 transitions. Word has length 21 [2019-12-27 18:56:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:07,983 INFO L462 AbstractCegarLoop]: Abstraction has 7359 states and 34126 transitions. [2019-12-27 18:56:07,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:56:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7359 states and 34126 transitions. [2019-12-27 18:56:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:07,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:07,984 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 18:56:08,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:08,185 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 18:56:08,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1746177582, now seen corresponding path program 6 times [2019-12-27 18:56:08,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:08,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334389646] [2019-12-27 18:56:08,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:08,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334389646] [2019-12-27 18:56:08,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779710807] [2019-12-27 18:56:08,311 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 18:56:08,396 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 18:56:08,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:08,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:56:08,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:08,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:08,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:56:08,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [628548574] [2019-12-27 18:56:08,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:08,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:08,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:56:08,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:08,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:08,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:56:08,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:56:08,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:56:08,542 INFO L87 Difference]: Start difference. First operand 7359 states and 34126 transitions. Second operand 13 states. [2019-12-27 18:56:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:10,160 INFO L93 Difference]: Finished difference Result 34122 states and 131436 transitions. [2019-12-27 18:56:10,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 18:56:10,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 18:56:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:10,237 INFO L225 Difference]: With dead ends: 34122 [2019-12-27 18:56:10,237 INFO L226 Difference]: Without dead ends: 34115 [2019-12-27 18:56:10,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=731, Invalid=3051, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 18:56:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34115 states. [2019-12-27 18:56:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34115 to 7074. [2019-12-27 18:56:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7074 states. [2019-12-27 18:56:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 32902 transitions. [2019-12-27 18:56:10,565 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 32902 transitions. Word has length 21 [2019-12-27 18:56:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:10,566 INFO L462 AbstractCegarLoop]: Abstraction has 7074 states and 32902 transitions. [2019-12-27 18:56:10,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:56:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 32902 transitions. [2019-12-27 18:56:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:56:10,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:10,567 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:10,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:10,770 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 18:56:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2118906939, now seen corresponding path program 1 times [2019-12-27 18:56:10,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:10,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198003835] [2019-12-27 18:56:10,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:10,799 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 18:56:10,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198003835] [2019-12-27 18:56:10,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:56:10,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:56:10,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [169225571] [2019-12-27 18:56:10,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:10,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:10,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 18:56:10,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:10,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:10,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:56:10,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:56:10,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:56:10,806 INFO L87 Difference]: Start difference. First operand 7074 states and 32902 transitions. Second operand 5 states. [2019-12-27 18:56:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:10,974 INFO L93 Difference]: Finished difference Result 13868 states and 59785 transitions. [2019-12-27 18:56:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:56:10,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 18:56:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:11,006 INFO L225 Difference]: With dead ends: 13868 [2019-12-27 18:56:11,006 INFO L226 Difference]: Without dead ends: 13852 [2019-12-27 18:56:11,006 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 18:56:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13852 states. [2019-12-27 18:56:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13852 to 8405. [2019-12-27 18:56:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 18:56:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 18:56:11,196 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 18:56:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:11,196 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 18:56:11,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:56:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 18:56:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:56:11,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:11,198 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:11,199 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 18:56:11,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:11,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1638190110, now seen corresponding path program 1 times [2019-12-27 18:56:11,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:11,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791771696] [2019-12-27 18:56:11,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:11,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791771696] [2019-12-27 18:56:11,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255049367] [2019-12-27 18:56:11,301 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 18:56:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:11,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 18:56:11,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:11,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:11,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2019-12-27 18:56:11,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126518819] [2019-12-27 18:56:11,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:11,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:11,616 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 18:56:11,617 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:11,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:56:11,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:56:11,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:56:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:56:11,757 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 18 states. [2019-12-27 18:56:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:13,402 INFO L93 Difference]: Finished difference Result 22366 states and 90141 transitions. [2019-12-27 18:56:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 18:56:13,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-12-27 18:56:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:13,452 INFO L225 Difference]: With dead ends: 22366 [2019-12-27 18:56:13,452 INFO L226 Difference]: Without dead ends: 22345 [2019-12-27 18:56:13,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=719, Invalid=3313, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 18:56:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22345 states. [2019-12-27 18:56:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22345 to 8674. [2019-12-27 18:56:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 18:56:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 18:56:13,903 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 18:56:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:13,903 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 18:56:13,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:56:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 18:56:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:56:13,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:13,905 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:14,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:14,108 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 18:56:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1029514864, now seen corresponding path program 1 times [2019-12-27 18:56:14,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:14,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765554310] [2019-12-27 18:56:14,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:14,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765554310] [2019-12-27 18:56:14,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076714127] [2019-12-27 18:56:14,189 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 18:56:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:14,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 18:56:14,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:14,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:14,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2019-12-27 18:56:14,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [209429088] [2019-12-27 18:56:14,403 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:14,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:14,410 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 18:56:14,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:14,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:56:14,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:56:14,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:14,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:56:14,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:56:14,473 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 17 states. [2019-12-27 18:56:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:16,233 INFO L93 Difference]: Finished difference Result 23364 states and 94401 transitions. [2019-12-27 18:56:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 18:56:16,234 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-12-27 18:56:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:16,286 INFO L225 Difference]: With dead ends: 23364 [2019-12-27 18:56:16,286 INFO L226 Difference]: Without dead ends: 23340 [2019-12-27 18:56:16,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=734, Invalid=2926, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 18:56:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23340 states. [2019-12-27 18:56:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23340 to 8938. [2019-12-27 18:56:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-27 18:56:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-27 18:56:16,569 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-27 18:56:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:16,569 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-27 18:56:16,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:56:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-27 18:56:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:56:16,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:16,571 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:16,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:16,773 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 18:56:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:16,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1109240027, now seen corresponding path program 1 times [2019-12-27 18:56:16,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:16,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74924204] [2019-12-27 18:56:16,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:16,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74924204] [2019-12-27 18:56:16,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640845438] [2019-12-27 18:56:16,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 18:56:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:16,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 18:56:16,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:17,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:17,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2019-12-27 18:56:17,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239588156] [2019-12-27 18:56:17,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:17,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:17,070 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 18:56:17,071 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:17,137 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:56:17,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:56:17,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:56:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:56:17,138 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 16 states. [2019-12-27 18:56:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:19,415 INFO L93 Difference]: Finished difference Result 23849 states and 97171 transitions. [2019-12-27 18:56:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:56:19,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-12-27 18:56:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:19,480 INFO L225 Difference]: With dead ends: 23849 [2019-12-27 18:56:19,481 INFO L226 Difference]: Without dead ends: 23818 [2019-12-27 18:56:19,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=569, Invalid=2187, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 18:56:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23818 states. [2019-12-27 18:56:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23818 to 9143. [2019-12-27 18:56:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-27 18:56:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42279 transitions. [2019-12-27 18:56:19,751 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42279 transitions. Word has length 23 [2019-12-27 18:56:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:19,751 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42279 transitions. [2019-12-27 18:56:19,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:56:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42279 transitions. [2019-12-27 18:56:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:56:19,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:19,754 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:19,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:19,957 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 18:56:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 455072759, now seen corresponding path program 2 times [2019-12-27 18:56:19,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:19,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407855139] [2019-12-27 18:56:19,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:20,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407855139] [2019-12-27 18:56:20,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152653788] [2019-12-27 18:56:20,083 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 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 18:56:20,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:56:20,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:20,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:56:20,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:56:20,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:20,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2019-12-27 18:56:20,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164080222] [2019-12-27 18:56:20,381 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:20,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:20,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:56:20,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:20,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:20,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:56:20,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:56:20,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:56:20,393 INFO L87 Difference]: Start difference. First operand 9143 states and 42279 transitions. Second operand 12 states. [2019-12-27 18:56:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:21,315 INFO L93 Difference]: Finished difference Result 21118 states and 87107 transitions. [2019-12-27 18:56:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:56:21,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 18:56:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:21,364 INFO L225 Difference]: With dead ends: 21118 [2019-12-27 18:56:21,364 INFO L226 Difference]: Without dead ends: 21099 [2019-12-27 18:56:21,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:56:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-27 18:56:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 9234. [2019-12-27 18:56:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 18:56:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 42669 transitions. [2019-12-27 18:56:21,627 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 42669 transitions. Word has length 23 [2019-12-27 18:56:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:21,627 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 42669 transitions. [2019-12-27 18:56:21,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:56:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 42669 transitions. [2019-12-27 18:56:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:56:21,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:21,631 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:56:21,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:21,834 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 18:56:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash 455088848, now seen corresponding path program 2 times [2019-12-27 18:56:21,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:21,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263046593] [2019-12-27 18:56:21,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:21,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263046593] [2019-12-27 18:56:21,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968684009] [2019-12-27 18:56:21,931 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 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 18:56:22,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:56:22,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:22,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:56:22,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:56:22,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:22,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2019-12-27 18:56:22,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574687826] [2019-12-27 18:56:22,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:22,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:22,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:56:22,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:22,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:22,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:56:22,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:56:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:56:22,104 INFO L87 Difference]: Start difference. First operand 9234 states and 42669 transitions. Second operand 12 states. [2019-12-27 18:56:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:22,839 INFO L93 Difference]: Finished difference Result 23686 states and 99702 transitions. [2019-12-27 18:56:22,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:56:22,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 18:56:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:22,895 INFO L225 Difference]: With dead ends: 23686 [2019-12-27 18:56:22,895 INFO L226 Difference]: Without dead ends: 23667 [2019-12-27 18:56:22,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:56:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23667 states. [2019-12-27 18:56:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23667 to 9243. [2019-12-27 18:56:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-27 18:56:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 42683 transitions. [2019-12-27 18:56:23,173 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 42683 transitions. Word has length 23 [2019-12-27 18:56:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:23,173 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 42683 transitions. [2019-12-27 18:56:23,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:56:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 42683 transitions. [2019-12-27 18:56:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 18:56:23,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:23,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 18:56:23,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:23,376 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 18:56:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:23,377 INFO L82 PathProgramCache]: Analyzing trace with hash 455077812, now seen corresponding path program 2 times [2019-12-27 18:56:23,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:23,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823133846] [2019-12-27 18:56:23,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:23,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823133846] [2019-12-27 18:56:23,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906486946] [2019-12-27 18:56:23,475 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 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 18:56:23,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:56:23,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:23,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:56:23,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 18:56:23,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:23,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2019-12-27 18:56:23,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118179897] [2019-12-27 18:56:23,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:23,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:23,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 18:56:23,723 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:23,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:56:23,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:56:23,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:23,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:56:23,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:56:23,725 INFO L87 Difference]: Start difference. First operand 9243 states and 42683 transitions. Second operand 12 states. [2019-12-27 18:56:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:24,488 INFO L93 Difference]: Finished difference Result 23587 states and 99024 transitions. [2019-12-27 18:56:24,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:56:24,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 18:56:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:24,542 INFO L225 Difference]: With dead ends: 23587 [2019-12-27 18:56:24,543 INFO L226 Difference]: Without dead ends: 23568 [2019-12-27 18:56:24,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:56:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23568 states. [2019-12-27 18:56:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23568 to 9286. [2019-12-27 18:56:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 18:56:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 18:56:24,832 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 18:56:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:24,832 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 18:56:24,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:56:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 18:56:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:56:24,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:24,835 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 18:56:25,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:25,036 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 18:56:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash 467716983, now seen corresponding path program 1 times [2019-12-27 18:56:25,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:25,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43049341] [2019-12-27 18:56:25,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:56:25,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43049341] [2019-12-27 18:56:25,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395903302] [2019-12-27 18:56:25,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 18:56:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:25,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:56:25,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:25,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:25,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 23 [2019-12-27 18:56:25,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103911455] [2019-12-27 18:56:25,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:25,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:25,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 18:56:25,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:25,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:56:25,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 18:56:25,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 18:56:25,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 18:56:25,581 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 24 states. [2019-12-27 18:56:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:32,653 INFO L93 Difference]: Finished difference Result 45894 states and 169989 transitions. [2019-12-27 18:56:32,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-12-27 18:56:32,653 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-12-27 18:56:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:32,753 INFO L225 Difference]: With dead ends: 45894 [2019-12-27 18:56:32,753 INFO L226 Difference]: Without dead ends: 45858 [2019-12-27 18:56:32,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12223 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5179, Invalid=28861, Unknown=0, NotChecked=0, Total=34040 [2019-12-27 18:56:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45858 states. [2019-12-27 18:56:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45858 to 9553. [2019-12-27 18:56:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9553 states. [2019-12-27 18:56:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9553 states to 9553 states and 44140 transitions. [2019-12-27 18:56:33,252 INFO L78 Accepts]: Start accepts. Automaton has 9553 states and 44140 transitions. Word has length 25 [2019-12-27 18:56:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:33,253 INFO L462 AbstractCegarLoop]: Abstraction has 9553 states and 44140 transitions. [2019-12-27 18:56:33,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 18:56:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9553 states and 44140 transitions. [2019-12-27 18:56:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:56:33,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:33,256 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 18:56:33,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:33,457 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 18:56:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1688495422, now seen corresponding path program 1 times [2019-12-27 18:56:33,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:33,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629507755] [2019-12-27 18:56:33,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:56:33,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629507755] [2019-12-27 18:56:33,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632137995] [2019-12-27 18:56:33,544 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 18:56:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:33,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:56:33,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:33,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:33,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2019-12-27 18:56:33,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132170703] [2019-12-27 18:56:33,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:33,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:33,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 18:56:33,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:33,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:56:33,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:56:33,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:56:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:56:33,968 INFO L87 Difference]: Start difference. First operand 9553 states and 44140 transitions. Second operand 22 states. [2019-12-27 18:56:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:39,934 INFO L93 Difference]: Finished difference Result 45192 states and 167676 transitions. [2019-12-27 18:56:39,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-12-27 18:56:39,934 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-27 18:56:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:40,044 INFO L225 Difference]: With dead ends: 45192 [2019-12-27 18:56:40,045 INFO L226 Difference]: Without dead ends: 45156 [2019-12-27 18:56:40,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9503 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3992, Invalid=22740, Unknown=0, NotChecked=0, Total=26732 [2019-12-27 18:56:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45156 states. [2019-12-27 18:56:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45156 to 9677. [2019-12-27 18:56:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9677 states. [2019-12-27 18:56:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9677 states to 9677 states and 44904 transitions. [2019-12-27 18:56:40,504 INFO L78 Accepts]: Start accepts. Automaton has 9677 states and 44904 transitions. Word has length 25 [2019-12-27 18:56:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:40,504 INFO L462 AbstractCegarLoop]: Abstraction has 9677 states and 44904 transitions. [2019-12-27 18:56:40,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:56:40,504 INFO L276 IsEmpty]: Start isEmpty. Operand 9677 states and 44904 transitions. [2019-12-27 18:56:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:56:40,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:40,508 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 18:56:40,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:40,709 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 18:56:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1952304606, now seen corresponding path program 2 times [2019-12-27 18:56:40,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:40,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121902338] [2019-12-27 18:56:40,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:40,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121902338] [2019-12-27 18:56:40,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149137678] [2019-12-27 18:56:40,830 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 18:56:40,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:56:40,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:40,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:56:40,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:56:41,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:41,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23 [2019-12-27 18:56:41,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1967736764] [2019-12-27 18:56:41,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:41,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:41,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:56:41,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:41,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:56:41,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:56:41,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:56:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:56:41,179 INFO L87 Difference]: Start difference. First operand 9677 states and 44904 transitions. Second operand 20 states. [2019-12-27 18:56:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:45,320 INFO L93 Difference]: Finished difference Result 35175 states and 133873 transitions. [2019-12-27 18:56:45,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-27 18:56:45,320 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2019-12-27 18:56:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:45,407 INFO L225 Difference]: With dead ends: 35175 [2019-12-27 18:56:45,407 INFO L226 Difference]: Without dead ends: 35155 [2019-12-27 18:56:45,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4357 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2162, Invalid=11880, Unknown=0, NotChecked=0, Total=14042 [2019-12-27 18:56:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35155 states. [2019-12-27 18:56:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35155 to 9674. [2019-12-27 18:56:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9674 states. [2019-12-27 18:56:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9674 states to 9674 states and 44853 transitions. [2019-12-27 18:56:45,820 INFO L78 Accepts]: Start accepts. Automaton has 9674 states and 44853 transitions. Word has length 25 [2019-12-27 18:56:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:45,820 INFO L462 AbstractCegarLoop]: Abstraction has 9674 states and 44853 transitions. [2019-12-27 18:56:45,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:56:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 9674 states and 44853 transitions. [2019-12-27 18:56:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:56:45,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:45,823 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 18:56:46,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:46,024 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 18:56:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:46,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1952320695, now seen corresponding path program 2 times [2019-12-27 18:56:46,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:46,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219787456] [2019-12-27 18:56:46,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:46,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219787456] [2019-12-27 18:56:46,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598736439] [2019-12-27 18:56:46,142 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 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 18:56:46,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:56:46,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:46,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:56:46,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:56:46,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:46,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23 [2019-12-27 18:56:46,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162016064] [2019-12-27 18:56:46,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:46,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:46,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:56:46,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:46,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:56:46,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:56:46,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:46,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:56:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:56:46,501 INFO L87 Difference]: Start difference. First operand 9674 states and 44853 transitions. Second operand 20 states. [2019-12-27 18:56:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:56:50,997 INFO L93 Difference]: Finished difference Result 34731 states and 132056 transitions. [2019-12-27 18:56:50,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-27 18:56:50,998 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2019-12-27 18:56:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:56:51,297 INFO L225 Difference]: With dead ends: 34731 [2019-12-27 18:56:51,297 INFO L226 Difference]: Without dead ends: 34711 [2019-12-27 18:56:51,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4733 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2324, Invalid=12928, Unknown=0, NotChecked=0, Total=15252 [2019-12-27 18:56:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34711 states. [2019-12-27 18:56:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34711 to 9567. [2019-12-27 18:56:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9567 states. [2019-12-27 18:56:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9567 states to 9567 states and 44317 transitions. [2019-12-27 18:56:51,665 INFO L78 Accepts]: Start accepts. Automaton has 9567 states and 44317 transitions. Word has length 25 [2019-12-27 18:56:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:56:51,665 INFO L462 AbstractCegarLoop]: Abstraction has 9567 states and 44317 transitions. [2019-12-27 18:56:51,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:56:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 9567 states and 44317 transitions. [2019-12-27 18:56:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:56:51,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:56:51,668 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 18:56:51,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:56:51,869 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 18:56:51,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:56:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash -864250889, now seen corresponding path program 3 times [2019-12-27 18:56:51,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:56:51,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695343866] [2019-12-27 18:56:51,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:56:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:56:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:56:51,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695343866] [2019-12-27 18:56:51,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409504056] [2019-12-27 18:56:51,965 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 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 18:56:52,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 18:56:52,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:56:52,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:56:52,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:56:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:56:52,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:56:52,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 23 [2019-12-27 18:56:52,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [587485153] [2019-12-27 18:56:52,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:56:52,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:56:52,234 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 18:56:52,234 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:56:52,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:56:52,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 18:56:52,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:56:52,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 18:56:52,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:56:52,391 INFO L87 Difference]: Start difference. First operand 9567 states and 44317 transitions. Second operand 23 states. [2019-12-27 18:57:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:00,030 INFO L93 Difference]: Finished difference Result 43384 states and 162365 transitions. [2019-12-27 18:57:00,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-12-27 18:57:00,030 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-12-27 18:57:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:00,140 INFO L225 Difference]: With dead ends: 43384 [2019-12-27 18:57:00,140 INFO L226 Difference]: Without dead ends: 43366 [2019-12-27 18:57:00,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11566 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4940, Invalid=27280, Unknown=0, NotChecked=0, Total=32220 [2019-12-27 18:57:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43366 states. [2019-12-27 18:57:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43366 to 9143. [2019-12-27 18:57:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-27 18:57:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42133 transitions. [2019-12-27 18:57:00,562 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42133 transitions. Word has length 25 [2019-12-27 18:57:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:00,562 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42133 transitions. [2019-12-27 18:57:00,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 18:57:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42133 transitions. [2019-12-27 18:57:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:00,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:00,566 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 18:57:00,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:00,767 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 18:57:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash -867136272, now seen corresponding path program 1 times [2019-12-27 18:57:00,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340608022] [2019-12-27 18:57:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 18:57:00,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340608022] [2019-12-27 18:57:00,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023826017] [2019-12-27 18:57:00,848 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 18:57:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:00,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:00,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:01,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:01,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2019-12-27 18:57:01,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114348268] [2019-12-27 18:57:01,122 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:01,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:01,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:57:01,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:01,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:57:01,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 18:57:01,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:01,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 18:57:01,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:57:01,276 INFO L87 Difference]: Start difference. First operand 9143 states and 42133 transitions. Second operand 21 states. [2019-12-27 18:57:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:07,658 INFO L93 Difference]: Finished difference Result 44231 states and 165347 transitions. [2019-12-27 18:57:07,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-12-27 18:57:07,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-12-27 18:57:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:07,988 INFO L225 Difference]: With dead ends: 44231 [2019-12-27 18:57:07,988 INFO L226 Difference]: Without dead ends: 44190 [2019-12-27 18:57:07,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9022 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3843, Invalid=21279, Unknown=0, NotChecked=0, Total=25122 [2019-12-27 18:57:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44190 states. [2019-12-27 18:57:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44190 to 9454. [2019-12-27 18:57:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9454 states. [2019-12-27 18:57:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9454 states to 9454 states and 43663 transitions. [2019-12-27 18:57:08,403 INFO L78 Accepts]: Start accepts. Automaton has 9454 states and 43663 transitions. Word has length 25 [2019-12-27 18:57:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:08,403 INFO L462 AbstractCegarLoop]: Abstraction has 9454 states and 43663 transitions. [2019-12-27 18:57:08,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 18:57:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 9454 states and 43663 transitions. [2019-12-27 18:57:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:08,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:08,407 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 18:57:08,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:08,610 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 18:57:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1521303540, now seen corresponding path program 2 times [2019-12-27 18:57:08,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:08,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727241523] [2019-12-27 18:57:08,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:08,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727241523] [2019-12-27 18:57:08,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936783819] [2019-12-27 18:57:08,738 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 18:57:08,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:57:08,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:08,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:57:08,817 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:57:08,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:08,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23 [2019-12-27 18:57:08,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2088688020] [2019-12-27 18:57:08,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:09,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:09,006 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:57:09,006 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:09,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:57:09,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:57:09,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:57:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:57:09,095 INFO L87 Difference]: Start difference. First operand 9454 states and 43663 transitions. Second operand 19 states. [2019-12-27 18:57:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:13,660 INFO L93 Difference]: Finished difference Result 33378 states and 127464 transitions. [2019-12-27 18:57:13,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-27 18:57:13,660 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 18:57:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:13,729 INFO L225 Difference]: With dead ends: 33378 [2019-12-27 18:57:13,729 INFO L226 Difference]: Without dead ends: 33354 [2019-12-27 18:57:13,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2074, Invalid=9916, Unknown=0, NotChecked=0, Total=11990 [2019-12-27 18:57:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33354 states. [2019-12-27 18:57:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33354 to 9419. [2019-12-27 18:57:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9419 states. [2019-12-27 18:57:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 43489 transitions. [2019-12-27 18:57:14,077 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 43489 transitions. Word has length 25 [2019-12-27 18:57:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:14,077 INFO L462 AbstractCegarLoop]: Abstraction has 9419 states and 43489 transitions. [2019-12-27 18:57:14,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:57:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 43489 transitions. [2019-12-27 18:57:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:14,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:14,081 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 18:57:14,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:14,281 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 18:57:14,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:14,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1521298487, now seen corresponding path program 4 times [2019-12-27 18:57:14,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:14,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028448066] [2019-12-27 18:57:14,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:14,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028448066] [2019-12-27 18:57:14,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653925286] [2019-12-27 18:57:14,372 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 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 18:57:14,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:57:14,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:14,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:14,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:14,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:14,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:14,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1392894595] [2019-12-27 18:57:14,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:14,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:14,616 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:57:14,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:14,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:57:14,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:57:14,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:14,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:57:14,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:57:14,685 INFO L87 Difference]: Start difference. First operand 9419 states and 43489 transitions. Second operand 19 states. [2019-12-27 18:57:19,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:19,563 INFO L93 Difference]: Finished difference Result 39028 states and 152302 transitions. [2019-12-27 18:57:19,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-27 18:57:19,563 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 18:57:19,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:19,650 INFO L225 Difference]: With dead ends: 39028 [2019-12-27 18:57:19,650 INFO L226 Difference]: Without dead ends: 39008 [2019-12-27 18:57:19,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4579 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2323, Invalid=11719, Unknown=0, NotChecked=0, Total=14042 [2019-12-27 18:57:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-27 18:57:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 9325. [2019-12-27 18:57:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9325 states. [2019-12-27 18:57:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9325 states to 9325 states and 43013 transitions. [2019-12-27 18:57:20,051 INFO L78 Accepts]: Start accepts. Automaton has 9325 states and 43013 transitions. Word has length 25 [2019-12-27 18:57:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:20,051 INFO L462 AbstractCegarLoop]: Abstraction has 9325 states and 43013 transitions. [2019-12-27 18:57:20,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:57:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9325 states and 43013 transitions. [2019-12-27 18:57:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:20,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:20,056 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 18:57:20,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:20,257 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 18:57:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:20,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1805640486, now seen corresponding path program 3 times [2019-12-27 18:57:20,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:20,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568519336] [2019-12-27 18:57:20,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:20,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568519336] [2019-12-27 18:57:20,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646158972] [2019-12-27 18:57:20,361 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 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 18:57:20,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 18:57:20,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:20,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:20,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:20,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:20,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 23 [2019-12-27 18:57:20,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1845026170] [2019-12-27 18:57:20,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:20,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:20,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:57:20,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:20,735 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:57:20,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 18:57:20,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 18:57:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:57:20,736 INFO L87 Difference]: Start difference. First operand 9325 states and 43013 transitions. Second operand 21 states. [2019-12-27 18:57:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:26,461 INFO L93 Difference]: Finished difference Result 39450 states and 149158 transitions. [2019-12-27 18:57:26,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-12-27 18:57:26,462 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-12-27 18:57:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:26,550 INFO L225 Difference]: With dead ends: 39450 [2019-12-27 18:57:26,550 INFO L226 Difference]: Without dead ends: 39432 [2019-12-27 18:57:26,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7025 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3153, Invalid=17153, Unknown=0, NotChecked=0, Total=20306 [2019-12-27 18:57:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39432 states. [2019-12-27 18:57:26,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39432 to 8861. [2019-12-27 18:57:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8861 states. [2019-12-27 18:57:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8861 states to 8861 states and 40696 transitions. [2019-12-27 18:57:26,952 INFO L78 Accepts]: Start accepts. Automaton has 8861 states and 40696 transitions. Word has length 25 [2019-12-27 18:57:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:26,952 INFO L462 AbstractCegarLoop]: Abstraction has 8861 states and 40696 transitions. [2019-12-27 18:57:26,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 18:57:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 8861 states and 40696 transitions. [2019-12-27 18:57:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:26,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:26,956 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 18:57:27,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:27,157 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 18:57:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2003485014, now seen corresponding path program 3 times [2019-12-27 18:57:27,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:27,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790337498] [2019-12-27 18:57:27,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:27,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790337498] [2019-12-27 18:57:27,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757766113] [2019-12-27 18:57:27,319 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:27,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 18:57:27,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:27,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:27,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:27,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:27,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:27,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137270458] [2019-12-27 18:57:27,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:27,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:27,609 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 18:57:27,609 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:27,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:57:27,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:57:27,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:27,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:57:27,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 18:57:27,763 INFO L87 Difference]: Start difference. First operand 8861 states and 40696 transitions. Second operand 22 states. [2019-12-27 18:57:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:34,867 INFO L93 Difference]: Finished difference Result 46267 states and 175448 transitions. [2019-12-27 18:57:34,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-12-27 18:57:34,868 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-27 18:57:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:34,974 INFO L225 Difference]: With dead ends: 46267 [2019-12-27 18:57:34,975 INFO L226 Difference]: Without dead ends: 46247 [2019-12-27 18:57:34,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9397 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3973, Invalid=22109, Unknown=0, NotChecked=0, Total=26082 [2019-12-27 18:57:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46247 states. [2019-12-27 18:57:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46247 to 8486. [2019-12-27 18:57:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8486 states. [2019-12-27 18:57:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 38801 transitions. [2019-12-27 18:57:35,402 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 38801 transitions. Word has length 25 [2019-12-27 18:57:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:35,403 INFO L462 AbstractCegarLoop]: Abstraction has 8486 states and 38801 transitions. [2019-12-27 18:57:35,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:57:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 38801 transitions. [2019-12-27 18:57:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:35,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:35,406 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 18:57:35,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:35,607 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 18:57:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:35,608 INFO L82 PathProgramCache]: Analyzing trace with hash 827795312, now seen corresponding path program 4 times [2019-12-27 18:57:35,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:35,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572606728] [2019-12-27 18:57:35,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:35,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572606728] [2019-12-27 18:57:35,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100800256] [2019-12-27 18:57:35,701 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:35,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:57:35,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:35,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:35,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:35,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:35,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:35,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1824980428] [2019-12-27 18:57:35,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:35,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:35,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 18:57:35,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:36,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:57:36,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:57:36,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:36,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:57:36,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:57:36,013 INFO L87 Difference]: Start difference. First operand 8486 states and 38801 transitions. Second operand 18 states. [2019-12-27 18:57:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:39,777 INFO L93 Difference]: Finished difference Result 31743 states and 120728 transitions. [2019-12-27 18:57:39,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 18:57:39,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-12-27 18:57:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:39,846 INFO L225 Difference]: With dead ends: 31743 [2019-12-27 18:57:39,846 INFO L226 Difference]: Without dead ends: 31719 [2019-12-27 18:57:39,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1680, Invalid=8022, Unknown=0, NotChecked=0, Total=9702 [2019-12-27 18:57:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31719 states. [2019-12-27 18:57:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31719 to 8455. [2019-12-27 18:57:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8455 states. [2019-12-27 18:57:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 38635 transitions. [2019-12-27 18:57:40,180 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 38635 transitions. Word has length 25 [2019-12-27 18:57:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:40,180 INFO L462 AbstractCegarLoop]: Abstraction has 8455 states and 38635 transitions. [2019-12-27 18:57:40,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:57:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 38635 transitions. [2019-12-27 18:57:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:40,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:40,183 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 18:57:40,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:40,384 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 18:57:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash 827784276, now seen corresponding path program 4 times [2019-12-27 18:57:40,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:40,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870133041] [2019-12-27 18:57:40,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:40,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870133041] [2019-12-27 18:57:40,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534561965] [2019-12-27 18:57:40,492 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:40,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 18:57:40,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:40,577 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:40,578 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:40,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:40,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:40,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545387532] [2019-12-27 18:57:40,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:40,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:40,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 18:57:40,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:40,819 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:57:40,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:57:40,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:57:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:57:40,820 INFO L87 Difference]: Start difference. First operand 8455 states and 38635 transitions. Second operand 18 states. [2019-12-27 18:57:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:44,571 INFO L93 Difference]: Finished difference Result 36873 states and 143534 transitions. [2019-12-27 18:57:44,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 18:57:44,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-12-27 18:57:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:44,654 INFO L225 Difference]: With dead ends: 36873 [2019-12-27 18:57:44,654 INFO L226 Difference]: Without dead ends: 36849 [2019-12-27 18:57:44,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2953 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1680, Invalid=8022, Unknown=0, NotChecked=0, Total=9702 [2019-12-27 18:57:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36849 states. [2019-12-27 18:57:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36849 to 8320. [2019-12-27 18:57:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2019-12-27 18:57:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 37984 transitions. [2019-12-27 18:57:45,018 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 37984 transitions. Word has length 25 [2019-12-27 18:57:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:45,018 INFO L462 AbstractCegarLoop]: Abstraction has 8320 states and 37984 transitions. [2019-12-27 18:57:45,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:57:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 37984 transitions. [2019-12-27 18:57:45,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:45,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:45,021 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 18:57:45,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:45,222 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 18:57:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:45,222 INFO L82 PathProgramCache]: Analyzing trace with hash -761724020, now seen corresponding path program 5 times [2019-12-27 18:57:45,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:45,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803895561] [2019-12-27 18:57:45,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:45,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803895561] [2019-12-27 18:57:45,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664067732] [2019-12-27 18:57:45,330 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:45,412 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 18:57:45,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:45,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:45,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:45,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:45,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:45,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339499085] [2019-12-27 18:57:45,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:45,577 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:45,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:57:45,581 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:45,581 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:45,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:57:45,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:57:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:57:45,582 INFO L87 Difference]: Start difference. First operand 8320 states and 37984 transitions. Second operand 14 states. [2019-12-27 18:57:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:47,323 INFO L93 Difference]: Finished difference Result 28033 states and 108022 transitions. [2019-12-27 18:57:47,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 18:57:47,324 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 18:57:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:47,390 INFO L225 Difference]: With dead ends: 28033 [2019-12-27 18:57:47,390 INFO L226 Difference]: Without dead ends: 28023 [2019-12-27 18:57:47,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=828, Invalid=3332, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 18:57:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28023 states. [2019-12-27 18:57:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28023 to 8182. [2019-12-27 18:57:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8182 states. [2019-12-27 18:57:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8182 states to 8182 states and 37339 transitions. [2019-12-27 18:57:47,686 INFO L78 Accepts]: Start accepts. Automaton has 8182 states and 37339 transitions. Word has length 25 [2019-12-27 18:57:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:47,687 INFO L462 AbstractCegarLoop]: Abstraction has 8182 states and 37339 transitions. [2019-12-27 18:57:47,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:57:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 8182 states and 37339 transitions. [2019-12-27 18:57:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:47,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:47,690 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 18:57:47,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:47,891 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 18:57:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:47,891 INFO L82 PathProgramCache]: Analyzing trace with hash -761735056, now seen corresponding path program 5 times [2019-12-27 18:57:47,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:47,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48704094] [2019-12-27 18:57:47,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:47,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48704094] [2019-12-27 18:57:47,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615133676] [2019-12-27 18:57:47,992 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:48,079 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 18:57:48,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:48,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:48,082 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:48,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:48,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:48,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [972229569] [2019-12-27 18:57:48,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:48,240 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:48,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:57:48,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:48,245 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:48,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:57:48,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:57:48,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:57:48,246 INFO L87 Difference]: Start difference. First operand 8182 states and 37339 transitions. Second operand 14 states. [2019-12-27 18:57:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:50,328 INFO L93 Difference]: Finished difference Result 32378 states and 127558 transitions. [2019-12-27 18:57:50,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 18:57:50,328 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 18:57:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:50,397 INFO L225 Difference]: With dead ends: 32378 [2019-12-27 18:57:50,397 INFO L226 Difference]: Without dead ends: 32368 [2019-12-27 18:57:50,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=828, Invalid=3332, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 18:57:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32368 states. [2019-12-27 18:57:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32368 to 8038. [2019-12-27 18:57:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8038 states. [2019-12-27 18:57:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8038 states to 8038 states and 36672 transitions. [2019-12-27 18:57:50,871 INFO L78 Accepts]: Start accepts. Automaton has 8038 states and 36672 transitions. Word has length 25 [2019-12-27 18:57:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:50,872 INFO L462 AbstractCegarLoop]: Abstraction has 8038 states and 36672 transitions. [2019-12-27 18:57:50,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:57:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 8038 states and 36672 transitions. [2019-12-27 18:57:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:50,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:50,875 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 18:57:51,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:51,076 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 18:57:51,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash -746278580, now seen corresponding path program 6 times [2019-12-27 18:57:51,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:51,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662967470] [2019-12-27 18:57:51,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:51,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662967470] [2019-12-27 18:57:51,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088129559] [2019-12-27 18:57:51,182 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:51,262 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 18:57:51,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:51,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:51,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:51,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:51,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:51,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749980216] [2019-12-27 18:57:51,421 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:51,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:51,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:57:51,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:51,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:51,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:57:51,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:57:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:57:51,428 INFO L87 Difference]: Start difference. First operand 8038 states and 36672 transitions. Second operand 14 states. [2019-12-27 18:57:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:53,028 INFO L93 Difference]: Finished difference Result 31179 states and 122581 transitions. [2019-12-27 18:57:53,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 18:57:53,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 18:57:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:53,098 INFO L225 Difference]: With dead ends: 31179 [2019-12-27 18:57:53,098 INFO L226 Difference]: Without dead ends: 31165 [2019-12-27 18:57:53,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=3126, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 18:57:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31165 states. [2019-12-27 18:57:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31165 to 7767. [2019-12-27 18:57:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7767 states. [2019-12-27 18:57:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7767 states to 7767 states and 35467 transitions. [2019-12-27 18:57:53,412 INFO L78 Accepts]: Start accepts. Automaton has 7767 states and 35467 transitions. Word has length 25 [2019-12-27 18:57:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:53,412 INFO L462 AbstractCegarLoop]: Abstraction has 7767 states and 35467 transitions. [2019-12-27 18:57:53,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:57:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7767 states and 35467 transitions. [2019-12-27 18:57:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:53,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:53,415 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 18:57:53,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:53,616 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 18:57:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -746273527, now seen corresponding path program 5 times [2019-12-27 18:57:53,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:53,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609932540] [2019-12-27 18:57:53,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:53,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609932540] [2019-12-27 18:57:53,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62354871] [2019-12-27 18:57:53,715 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:53,799 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 18:57:53,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:53,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:53,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:53,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:53,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:53,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1654439996] [2019-12-27 18:57:53,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:53,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:53,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:57:53,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:53,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:53,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:57:53,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:53,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:57:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:57:53,963 INFO L87 Difference]: Start difference. First operand 7767 states and 35467 transitions. Second operand 14 states. [2019-12-27 18:57:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:55,760 INFO L93 Difference]: Finished difference Result 35036 states and 140723 transitions. [2019-12-27 18:57:55,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 18:57:55,761 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 18:57:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:55,843 INFO L225 Difference]: With dead ends: 35036 [2019-12-27 18:57:55,843 INFO L226 Difference]: Without dead ends: 35026 [2019-12-27 18:57:55,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=828, Invalid=3332, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 18:57:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35026 states. [2019-12-27 18:57:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35026 to 7673. [2019-12-27 18:57:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7673 states. [2019-12-27 18:57:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7673 states to 7673 states and 35043 transitions. [2019-12-27 18:57:56,181 INFO L78 Accepts]: Start accepts. Automaton has 7673 states and 35043 transitions. Word has length 25 [2019-12-27 18:57:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:56,182 INFO L462 AbstractCegarLoop]: Abstraction has 7673 states and 35043 transitions. [2019-12-27 18:57:56,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:57:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7673 states and 35043 transitions. [2019-12-27 18:57:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:56,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:56,185 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 18:57:56,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:56,386 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 18:57:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash -756884176, now seen corresponding path program 6 times [2019-12-27 18:57:56,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:56,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005007927] [2019-12-27 18:57:56,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:56,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005007927] [2019-12-27 18:57:56,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712335569] [2019-12-27 18:57:56,491 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:56,578 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 18:57:56,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:56,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:56,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:56,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:56,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:56,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [627907461] [2019-12-27 18:57:56,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:56,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:56,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:57:56,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:56,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:56,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:57:56,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:57:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:57:56,737 INFO L87 Difference]: Start difference. First operand 7673 states and 35043 transitions. Second operand 14 states. [2019-12-27 18:57:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:57:58,373 INFO L93 Difference]: Finished difference Result 30461 states and 119581 transitions. [2019-12-27 18:57:58,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 18:57:58,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 18:57:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:57:58,441 INFO L225 Difference]: With dead ends: 30461 [2019-12-27 18:57:58,441 INFO L226 Difference]: Without dead ends: 30447 [2019-12-27 18:57:58,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=3126, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 18:57:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30447 states. [2019-12-27 18:57:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30447 to 7474. [2019-12-27 18:57:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7474 states. [2019-12-27 18:57:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7474 states to 7474 states and 34176 transitions. [2019-12-27 18:57:58,888 INFO L78 Accepts]: Start accepts. Automaton has 7474 states and 34176 transitions. Word has length 25 [2019-12-27 18:57:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:57:58,888 INFO L462 AbstractCegarLoop]: Abstraction has 7474 states and 34176 transitions. [2019-12-27 18:57:58,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:57:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7474 states and 34176 transitions. [2019-12-27 18:57:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:57:58,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:57:58,891 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 18:57:59,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:59,091 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 18:57:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:57:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -756868087, now seen corresponding path program 6 times [2019-12-27 18:57:59,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:57:59,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771925456] [2019-12-27 18:57:59,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:57:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:57:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:59,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771925456] [2019-12-27 18:57:59,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186281352] [2019-12-27 18:57:59,199 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:57:59,279 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 18:57:59,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:57:59,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 18:57:59,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:57:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:57:59,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:57:59,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2019-12-27 18:57:59,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983678768] [2019-12-27 18:57:59,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:57:59,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:57:59,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:57:59,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:57:59,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:57:59,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:57:59,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:57:59,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:57:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:57:59,440 INFO L87 Difference]: Start difference. First operand 7474 states and 34176 transitions. Second operand 14 states. [2019-12-27 18:58:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:01,329 INFO L93 Difference]: Finished difference Result 30176 states and 118381 transitions. [2019-12-27 18:58:01,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 18:58:01,329 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-12-27 18:58:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:01,396 INFO L225 Difference]: With dead ends: 30176 [2019-12-27 18:58:01,396 INFO L226 Difference]: Without dead ends: 30162 [2019-12-27 18:58:01,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=828, Invalid=3332, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 18:58:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30162 states. [2019-12-27 18:58:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30162 to 7225. [2019-12-27 18:58:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7225 states. [2019-12-27 18:58:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 33097 transitions. [2019-12-27 18:58:01,693 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 33097 transitions. Word has length 25 [2019-12-27 18:58:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:01,693 INFO L462 AbstractCegarLoop]: Abstraction has 7225 states and 33097 transitions. [2019-12-27 18:58:01,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:58:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 33097 transitions. [2019-12-27 18:58:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:58:01,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:01,696 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:01,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:01,897 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 18:58:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash 562424737, now seen corresponding path program 1 times [2019-12-27 18:58:01,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:01,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991692432] [2019-12-27 18:58:01,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:01,934 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 18:58:01,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991692432] [2019-12-27 18:58:01,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:01,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:58:01,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358103108] [2019-12-27 18:58:01,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:01,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:01,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:58:01,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:01,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:01,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:58:01,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:58:01,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:58:01,944 INFO L87 Difference]: Start difference. First operand 7225 states and 33097 transitions. Second operand 5 states. [2019-12-27 18:58:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:02,115 INFO L93 Difference]: Finished difference Result 13551 states and 58105 transitions. [2019-12-27 18:58:02,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:58:02,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:58:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:02,144 INFO L225 Difference]: With dead ends: 13551 [2019-12-27 18:58:02,144 INFO L226 Difference]: Without dead ends: 13519 [2019-12-27 18:58:02,145 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 18:58:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13519 states. [2019-12-27 18:58:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13519 to 8516. [2019-12-27 18:58:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 18:58:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 18:58:02,326 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 18:58:02,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:02,327 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 18:58:02,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:58:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 18:58:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 18:58:02,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:02,330 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:02,330 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 18:58:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash 250099127, now seen corresponding path program 1 times [2019-12-27 18:58:02,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:02,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312524608] [2019-12-27 18:58:02,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:58:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:58:02,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:58:02,348 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:58:02,348 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 18:58:02,348 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 18:58:02,362 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,362 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,362 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,362 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,362 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,363 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,363 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,363 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,363 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,363 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,363 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,364 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,364 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,364 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,365 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,365 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,365 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,366 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,366 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,367 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,367 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,367 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,367 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,368 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,368 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,368 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,368 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,369 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,369 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,369 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,369 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,369 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,379 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,379 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,379 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,379 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,380 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,387 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,387 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,387 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,387 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,387 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,388 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,389 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,389 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,390 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,390 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,391 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,391 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,391 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,391 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,392 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:58:02,401 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 18:58:02,402 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:58:02,402 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:58:02,402 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:58:02,402 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:58:02,402 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:58:02,402 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:58:02,403 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:58:02,403 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:58:02,405 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 146 transitions [2019-12-27 18:58:02,405 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 146 transitions [2019-12-27 18:58:02,431 INFO L132 PetriNetUnfolder]: 8/176 cut-off events. [2019-12-27 18:58:02,431 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 18:58:02,434 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 176 events. 8/176 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 333 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 211. Up to 14 conditions per place. [2019-12-27 18:58:02,444 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 146 transitions [2019-12-27 18:58:02,468 INFO L132 PetriNetUnfolder]: 8/176 cut-off events. [2019-12-27 18:58:02,469 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 18:58:02,472 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 176 events. 8/176 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 333 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 211. Up to 14 conditions per place. [2019-12-27 18:58:02,481 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-27 18:58:02,481 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:58:04,494 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-12-27 18:58:04,810 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4228 [2019-12-27 18:58:04,811 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 18:58:04,811 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 18:58:06,086 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 18:58:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 18:58:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:58:06,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:06,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:58:06,087 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 18:58:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1340409, now seen corresponding path program 1 times [2019-12-27 18:58:06,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:06,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253302775] [2019-12-27 18:58:06,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:06,099 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 18:58:06,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253302775] [2019-12-27 18:58:06,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:06,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:58:06,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1168240627] [2019-12-27 18:58:06,099 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:06,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:06,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:58:06,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:06,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:06,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:58:06,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:58:06,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:58:06,101 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 18:58:06,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:06,233 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 18:58:06,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:58:06,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:58:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:06,280 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 18:58:06,280 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 18:58:06,280 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 18:58:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 18:58:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 18:58:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 18:58:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 18:58:06,892 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 18:58:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:06,892 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 18:58:06,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:58:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 18:58:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 18:58:06,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:06,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:06,893 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 18:58:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1372716845, now seen corresponding path program 1 times [2019-12-27 18:58:06,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:06,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150305381] [2019-12-27 18:58:06,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:06,921 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 18:58:06,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150305381] [2019-12-27 18:58:06,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:06,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:58:06,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2117196642] [2019-12-27 18:58:06,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:06,923 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:06,924 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 18:58:06,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:06,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:06,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:58:06,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:58:06,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:58:06,925 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 18:58:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:07,211 INFO L93 Difference]: Finished difference Result 35534 states and 172291 transitions. [2019-12-27 18:58:07,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:58:07,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 18:58:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:07,308 INFO L225 Difference]: With dead ends: 35534 [2019-12-27 18:58:07,309 INFO L226 Difference]: Without dead ends: 35531 [2019-12-27 18:58:07,309 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 18:58:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-27 18:58:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 19122. [2019-12-27 18:58:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 18:58:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 18:58:07,913 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 18:58:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:07,913 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 18:58:07,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:58:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 18:58:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:58:07,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:07,914 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:07,914 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 18:58:07,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:07,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1607639463, now seen corresponding path program 1 times [2019-12-27 18:58:07,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:07,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830661224] [2019-12-27 18:58:07,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:07,940 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 18:58:07,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830661224] [2019-12-27 18:58:07,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:07,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:58:07,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1194505147] [2019-12-27 18:58:07,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:07,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:07,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:58:07,943 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:07,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:07,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:58:07,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:58:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:58:07,943 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 18:58:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:08,255 INFO L93 Difference]: Finished difference Result 40612 states and 199911 transitions. [2019-12-27 18:58:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:58:08,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:58:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:08,368 INFO L225 Difference]: With dead ends: 40612 [2019-12-27 18:58:08,368 INFO L226 Difference]: Without dead ends: 40608 [2019-12-27 18:58:08,368 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 18:58:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40608 states. [2019-12-27 18:58:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40608 to 22883. [2019-12-27 18:58:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 18:58:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 18:58:09,072 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 18:58:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:09,072 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 18:58:09,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:58:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 18:58:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:58:09,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:09,073 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:09,073 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 18:58:09,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1246718830, now seen corresponding path program 1 times [2019-12-27 18:58:09,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:09,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124667390] [2019-12-27 18:58:09,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:09,140 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 18:58:09,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124667390] [2019-12-27 18:58:09,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150447022] [2019-12-27 18:58:09,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:09,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:58:09,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:09,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:09,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 18:58:09,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290906457] [2019-12-27 18:58:09,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:09,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:09,326 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 18:58:09,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:09,326 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:09,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:58:09,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:09,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:58:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:58:09,327 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 10 states. [2019-12-27 18:58:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:10,186 INFO L93 Difference]: Finished difference Result 63392 states and 294425 transitions. [2019-12-27 18:58:10,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:58:10,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-27 18:58:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:12,474 INFO L225 Difference]: With dead ends: 63392 [2019-12-27 18:58:12,474 INFO L226 Difference]: Without dead ends: 63388 [2019-12-27 18:58:12,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 18:58:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63388 states. [2019-12-27 18:58:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63388 to 22725. [2019-12-27 18:58:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 18:58:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 18:58:13,357 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 18:58:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:13,357 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 18:58:13,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:58:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 18:58:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 18:58:13,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:13,358 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:13,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:13,559 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 18:58:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1237701550, now seen corresponding path program 2 times [2019-12-27 18:58:13,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:13,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826820844] [2019-12-27 18:58:13,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:13,624 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 18:58:13,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826820844] [2019-12-27 18:58:13,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350496657] [2019-12-27 18:58:13,625 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:13,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:58:13,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:58:13,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:58:13,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:13,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:13,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 18:58:13,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [818367432] [2019-12-27 18:58:13,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:13,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:13,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 18:58:13,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:13,865 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:58:13,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:58:13,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:58:13,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:58:13,866 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 14 states. [2019-12-27 18:58:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:15,361 INFO L93 Difference]: Finished difference Result 71023 states and 324811 transitions. [2019-12-27 18:58:15,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 18:58:15,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-12-27 18:58:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:15,555 INFO L225 Difference]: With dead ends: 71023 [2019-12-27 18:58:15,555 INFO L226 Difference]: Without dead ends: 71017 [2019-12-27 18:58:15,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=545, Invalid=2107, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 18:58:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71017 states. [2019-12-27 18:58:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71017 to 22254. [2019-12-27 18:58:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 18:58:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 18:58:16,532 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 18:58:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:16,532 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 18:58:16,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:58:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 18:58:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:58:16,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:16,533 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:16,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:16,733 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 18:58:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2128527741, now seen corresponding path program 1 times [2019-12-27 18:58:16,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:16,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767679212] [2019-12-27 18:58:16,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:16,758 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 18:58:16,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767679212] [2019-12-27 18:58:16,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:58:16,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:58:16,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [347192974] [2019-12-27 18:58:16,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:16,760 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:16,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 18:58:16,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:16,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:16,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:58:16,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:58:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:58:16,762 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 18:58:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:17,509 INFO L93 Difference]: Finished difference Result 46028 states and 230205 transitions. [2019-12-27 18:58:17,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:58:17,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:58:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:17,650 INFO L225 Difference]: With dead ends: 46028 [2019-12-27 18:58:17,650 INFO L226 Difference]: Without dead ends: 46020 [2019-12-27 18:58:17,651 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 18:58:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46020 states. [2019-12-27 18:58:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46020 to 27169. [2019-12-27 18:58:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 18:58:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 18:58:18,448 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 18:58:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:18,449 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 18:58:18,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:58:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 18:58:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:58:18,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:18,450 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:18,450 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 18:58:18,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:18,450 INFO L82 PathProgramCache]: Analyzing trace with hash 128523593, now seen corresponding path program 1 times [2019-12-27 18:58:18,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:18,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062374407] [2019-12-27 18:58:18,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:18,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062374407] [2019-12-27 18:58:18,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046864477] [2019-12-27 18:58:18,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:18,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 18:58:18,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:18,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:18,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 18:58:18,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1202277803] [2019-12-27 18:58:18,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:18,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:18,717 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 18:58:18,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:18,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:58:18,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:58:18,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:18,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:58:18,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:58:18,760 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 15 states. [2019-12-27 18:58:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:20,435 INFO L93 Difference]: Finished difference Result 74945 states and 352854 transitions. [2019-12-27 18:58:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 18:58:20,435 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-12-27 18:58:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:20,645 INFO L225 Difference]: With dead ends: 74945 [2019-12-27 18:58:20,645 INFO L226 Difference]: Without dead ends: 74934 [2019-12-27 18:58:20,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=543, Invalid=2109, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 18:58:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74934 states. [2019-12-27 18:58:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74934 to 27590. [2019-12-27 18:58:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 18:58:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 18:58:21,760 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 18:58:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:21,760 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 18:58:21,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:58:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 18:58:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:58:21,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:21,761 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:21,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:21,962 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 18:58:21,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:21,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1113537192, now seen corresponding path program 1 times [2019-12-27 18:58:21,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:21,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122563321] [2019-12-27 18:58:21,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:22,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122563321] [2019-12-27 18:58:22,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518953289] [2019-12-27 18:58:22,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:22,153 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 18:58:22,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:22,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:22,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 18:58:22,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999232485] [2019-12-27 18:58:22,507 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:22,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:22,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 18:58:22,513 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:22,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:58:22,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:58:22,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:22,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:58:22,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:58:22,634 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 17 states. [2019-12-27 18:58:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:24,394 INFO L93 Difference]: Finished difference Result 75553 states and 353386 transitions. [2019-12-27 18:58:24,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 18:58:24,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-12-27 18:58:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:24,612 INFO L225 Difference]: With dead ends: 75553 [2019-12-27 18:58:24,612 INFO L226 Difference]: Without dead ends: 75540 [2019-12-27 18:58:24,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=686, Invalid=2620, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 18:58:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75540 states. [2019-12-27 18:58:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75540 to 27791. [2019-12-27 18:58:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-12-27 18:58:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 150081 transitions. [2019-12-27 18:58:25,732 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 150081 transitions. Word has length 19 [2019-12-27 18:58:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:25,733 INFO L462 AbstractCegarLoop]: Abstraction has 27791 states and 150081 transitions. [2019-12-27 18:58:25,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:58:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 150081 transitions. [2019-12-27 18:58:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:58:25,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:25,734 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:25,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:25,934 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 18:58:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1110700599, now seen corresponding path program 2 times [2019-12-27 18:58:25,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:25,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228125449] [2019-12-27 18:58:25,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:26,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228125449] [2019-12-27 18:58:26,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774771357] [2019-12-27 18:58:26,006 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:26,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:58:26,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:58:26,099 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:58:26,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:58:26,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:26,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 18:58:26,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [560095620] [2019-12-27 18:58:26,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:26,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:26,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:58:26,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:26,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:26,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:58:26,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:26,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:58:26,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:58:26,191 INFO L87 Difference]: Start difference. First operand 27791 states and 150081 transitions. Second operand 11 states. [2019-12-27 18:58:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:27,212 INFO L93 Difference]: Finished difference Result 68100 states and 326949 transitions. [2019-12-27 18:58:27,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:58:27,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 18:58:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:27,420 INFO L225 Difference]: With dead ends: 68100 [2019-12-27 18:58:27,421 INFO L226 Difference]: Without dead ends: 68091 [2019-12-27 18:58:27,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:58:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-27 18:58:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 27884. [2019-12-27 18:58:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-27 18:58:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 150616 transitions. [2019-12-27 18:58:28,972 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 150616 transitions. Word has length 19 [2019-12-27 18:58:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:28,972 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 150616 transitions. [2019-12-27 18:58:28,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:58:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 150616 transitions. [2019-12-27 18:58:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:58:28,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:28,973 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:58:29,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:29,174 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 18:58:29,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1110709992, now seen corresponding path program 2 times [2019-12-27 18:58:29,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:29,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703061887] [2019-12-27 18:58:29,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:29,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703061887] [2019-12-27 18:58:29,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850321223] [2019-12-27 18:58:29,248 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:29,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:58:29,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:58:29,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 18:58:29,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 18:58:29,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:29,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 18:58:29,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [819261184] [2019-12-27 18:58:29,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:29,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:29,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 18:58:29,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:29,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:58:29,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:58:29,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:58:29,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:58:29,513 INFO L87 Difference]: Start difference. First operand 27884 states and 150616 transitions. Second operand 11 states. [2019-12-27 18:58:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:30,773 INFO L93 Difference]: Finished difference Result 76779 states and 376141 transitions. [2019-12-27 18:58:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 18:58:30,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 18:58:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:31,007 INFO L225 Difference]: With dead ends: 76779 [2019-12-27 18:58:31,007 INFO L226 Difference]: Without dead ends: 76770 [2019-12-27 18:58:31,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 18:58:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76770 states. [2019-12-27 18:58:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76770 to 28053. [2019-12-27 18:58:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 18:58:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 18:58:32,137 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 18:58:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:32,137 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 18:58:32,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:58:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 18:58:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:58:32,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:32,138 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 18:58:32,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:32,341 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 18:58:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1045689698, now seen corresponding path program 1 times [2019-12-27 18:58:32,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:32,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571525573] [2019-12-27 18:58:32,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:32,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571525573] [2019-12-27 18:58:32,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795911229] [2019-12-27 18:58:32,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:32,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:58:32,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:32,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:32,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:58:32,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1958873127] [2019-12-27 18:58:32,654 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:32,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:32,661 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 18:58:32,661 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:32,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:58:32,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 18:58:32,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:32,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 18:58:32,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:58:32,788 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 21 states. [2019-12-27 18:58:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:58:39,578 INFO L93 Difference]: Finished difference Result 135023 states and 587582 transitions. [2019-12-27 18:58:39,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-12-27 18:58:39,578 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-12-27 18:58:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:58:39,943 INFO L225 Difference]: With dead ends: 135023 [2019-12-27 18:58:39,943 INFO L226 Difference]: Without dead ends: 135015 [2019-12-27 18:58:39,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6935 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3318, Invalid=16422, Unknown=0, NotChecked=0, Total=19740 [2019-12-27 18:58:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135015 states. [2019-12-27 18:58:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135015 to 27697. [2019-12-27 18:58:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27697 states. [2019-12-27 18:58:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 149567 transitions. [2019-12-27 18:58:45,006 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 149567 transitions. Word has length 21 [2019-12-27 18:58:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:58:45,007 INFO L462 AbstractCegarLoop]: Abstraction has 27697 states and 149567 transitions. [2019-12-27 18:58:45,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 18:58:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 149567 transitions. [2019-12-27 18:58:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 18:58:45,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:58:45,008 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 18:58:45,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:45,210 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 18:58:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:58:45,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1042862498, now seen corresponding path program 2 times [2019-12-27 18:58:45,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:58:45,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991064380] [2019-12-27 18:58:45,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:58:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:58:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:45,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991064380] [2019-12-27 18:58:45,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800809716] [2019-12-27 18:58:45,295 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:45,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 18:58:45,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 18:58:45,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 18:58:45,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 18:58:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:58:45,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 18:58:45,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 18:58:45,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86604559] [2019-12-27 18:58:45,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:58:45,577 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:58:45,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 18:58:45,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:58:45,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:58:45,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:58:45,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:58:45,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:58:45,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:58:45,682 INFO L87 Difference]: Start difference. First operand 27697 states and 149567 transitions. Second operand 17 states. Received shutdown request... [2019-12-27 18:58:48,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 18:58:48,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 18:58:48,291 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 18:58:48,298 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 18:58:48,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:58:48 BasicIcfg [2019-12-27 18:58:48,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:58:48,299 INFO L168 Benchmark]: Toolchain (without parser) took 249202.26 ms. Allocated memory was 145.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 18:58:48,300 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:58:48,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.12 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 100.1 MB in the beginning and 159.0 MB in the end (delta: -59.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:48,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.79 ms. Allocated memory is still 201.3 MB. Free memory was 159.0 MB in the beginning and 157.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:48,300 INFO L168 Benchmark]: Boogie Preprocessor took 30.99 ms. Allocated memory is still 201.3 MB. Free memory was 157.1 MB in the beginning and 155.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:48,300 INFO L168 Benchmark]: RCFGBuilder took 410.43 ms. Allocated memory is still 201.3 MB. Free memory was 155.7 MB in the beginning and 136.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:58:48,301 INFO L168 Benchmark]: TraceAbstraction took 247975.98 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 135.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 18:58:48,303 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.18 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.12 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 100.1 MB in the beginning and 159.0 MB in the end (delta: -59.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.79 ms. Allocated memory is still 201.3 MB. Free memory was 159.0 MB in the beginning and 157.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.99 ms. Allocated memory is still 201.3 MB. Free memory was 157.1 MB in the beginning and 155.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 410.43 ms. Allocated memory is still 201.3 MB. Free memory was 155.7 MB in the beginning and 136.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247975.98 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 135.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 60 ProgramPointsBefore, 15 ProgramPointsAfterwards, 56 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 7 FixpointIterations, 18 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 351 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 4 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 47 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 81 ProgramPointsBefore, 26 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 555 VarBasedMoverChecksPositive, 10 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 14 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1223 CheckedPairsTotal, 61 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 102 ProgramPointsBefore, 34 ProgramPointsAfterwards, 92 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 801 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 1840 CheckedPairsTotal, 80 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 123 ProgramPointsBefore, 42 ProgramPointsAfterwards, 110 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1106 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2220 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 144 ProgramPointsBefore, 50 ProgramPointsAfterwards, 128 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 58 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 1461 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3419 CheckedPairsTotal, 108 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 165 ProgramPointsBefore, 58 ProgramPointsAfterwards, 146 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 71 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 3 ConcurrentYvCompositions, 7 ChoiceCompositions, 1773 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 4228 CheckedPairsTotal, 122 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (27697states) and FLOYD_HOARE automaton (currently 60 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (499 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. Result: TIMEOUT, OverallTime: 45.8s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 540 SDtfs, 3666 SDslu, 2523 SDs, 0 SdLazy, 6897 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28053occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 434348 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 32772 SizeOfPredicates, 44 NumberOfNonLiveVariables, 866 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 31/114 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