/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:55:51,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:55:51,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:55:51,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:55:51,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:55:51,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:55:51,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:55:51,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:55:51,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:55:51,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:55:51,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:55:51,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:55:51,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:55:51,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:55:51,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:55:51,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:55:51,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:55:51,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:55:51,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:55:51,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:55:51,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:55:51,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:55:51,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:55:51,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:55:51,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:55:51,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:55:51,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:55:51,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:55:51,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:55:51,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:55:51,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:55:51,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:55:51,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:55:51,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:55:51,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:55:51,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:55:51,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:55:51,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:55:51,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:55:51,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:55:51,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:55:51,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 04:55:51,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:55:51,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:55:51,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:55:51,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:55:51,894 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:55:51,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:55:51,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:55:51,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:55:51,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:55:51,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:55:51,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:55:51,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:55:51,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:55:51,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:55:51,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:55:51,898 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:55:51,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:55:51,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:55:51,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:55:51,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:55:51,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:55:51,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:55:51,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:55:51,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:55:51,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:55:51,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:55:51,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:55:51,901 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 04:55:51,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:55:51,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:55:52,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:55:52,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:55:52,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:55:52,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:55:52,211 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:55:52,211 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2019-12-27 04:55:52,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa0a1096/d8913767c4514e9e9103303ba86a80c1/FLAG4cf20bdb6 [2019-12-27 04:55:52,783 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:55:52,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2019-12-27 04:55:52,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa0a1096/d8913767c4514e9e9103303ba86a80c1/FLAG4cf20bdb6 [2019-12-27 04:55:53,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa0a1096/d8913767c4514e9e9103303ba86a80c1 [2019-12-27 04:55:53,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:55:53,100 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:55:53,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:55:53,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:55:53,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:55:53,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b44772f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53, skipping insertion in model container [2019-12-27 04:55:53,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:55:53,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:55:53,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:55:53,654 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:55:53,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:55:53,764 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:55:53,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53 WrapperNode [2019-12-27 04:55:53,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:55:53,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:55:53,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:55:53,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:55:53,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:55:53,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:55:53,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:55:53,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:55:53,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (1/1) ... [2019-12-27 04:55:53,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:55:53,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:55:53,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:55:53,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:55:53,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (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 04:55:53,899 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 04:55:53,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 04:55:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:55:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:55:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:55:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:55:53,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:55:53,902 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 04:55:54,211 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:55:54,211 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-27 04:55:54,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:55:54 BoogieIcfgContainer [2019-12-27 04:55:54,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:55:54,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:55:54,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:55:54,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:55:54,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:55:53" (1/3) ... [2019-12-27 04:55:54,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1ff6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:55:54, skipping insertion in model container [2019-12-27 04:55:54,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:53" (2/3) ... [2019-12-27 04:55:54,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1ff6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:55:54, skipping insertion in model container [2019-12-27 04:55:54,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:55:54" (3/3) ... [2019-12-27 04:55:54,221 INFO L109 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2019-12-27 04:55:54,230 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:55:54,230 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:55:54,236 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 04:55:54,237 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:55:54,261 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,261 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,262 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,262 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,263 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,263 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,263 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,264 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,264 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,264 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,265 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,265 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,265 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,266 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,270 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,270 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,271 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,271 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,271 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,272 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:54,287 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 04:55:54,303 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:55:54,303 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:55:54,303 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:55:54,304 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:55:54,304 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:55:54,304 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:55:54,304 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:55:54,304 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:55:54,317 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions [2019-12-27 04:55:54,319 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions [2019-12-27 04:55:54,354 INFO L132 PetriNetUnfolder]: 3/41 cut-off events. [2019-12-27 04:55:54,354 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:55:54,359 INFO L76 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-27 04:55:54,361 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions [2019-12-27 04:55:54,374 INFO L132 PetriNetUnfolder]: 3/41 cut-off events. [2019-12-27 04:55:54,375 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:55:54,376 INFO L76 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-27 04:55:54,377 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 240 [2019-12-27 04:55:54,378 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:55:55,018 INFO L206 etLargeBlockEncoding]: Checked pairs total: 160 [2019-12-27 04:55:55,018 INFO L214 etLargeBlockEncoding]: Total number of compositions: 29 [2019-12-27 04:55:55,022 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 9 places, 8 transitions [2019-12-27 04:55:55,030 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 19 states. [2019-12-27 04:55:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-12-27 04:55:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 04:55:55,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:55,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 04:55:55,040 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:55:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:55,046 INFO L82 PathProgramCache]: Analyzing trace with hash 4687879, now seen corresponding path program 1 times [2019-12-27 04:55:55,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:55,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492432614] [2019-12-27 04:55:55,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:55,204 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 04:55:55,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492432614] [2019-12-27 04:55:55,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:55,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:55:55,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281659476] [2019-12-27 04:55:55,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 04:55:55,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 04:55:55,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 04:55:55,233 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-12-27 04:55:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:55,246 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-12-27 04:55:55,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 04:55:55,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-27 04:55:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:55,257 INFO L225 Difference]: With dead ends: 11 [2019-12-27 04:55:55,257 INFO L226 Difference]: Without dead ends: 11 [2019-12-27 04:55:55,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 04:55:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-12-27 04:55:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-12-27 04:55:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-27 04:55:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-12-27 04:55:55,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 4 [2019-12-27 04:55:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:55,292 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-12-27 04:55:55,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 04:55:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-12-27 04:55:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 04:55:55,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:55,293 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-27 04:55:55,294 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:55:55,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:55,294 INFO L82 PathProgramCache]: Analyzing trace with hash 210024220, now seen corresponding path program 1 times [2019-12-27 04:55:55,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:55,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618020983] [2019-12-27 04:55:55,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:55:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:55:55,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:55:55,355 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:55:55,356 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:55:55,356 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 04:55:55,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,364 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,364 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,367 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:55,377 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 04:55:55,378 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:55:55,378 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:55:55,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:55:55,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:55:55,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:55:55,378 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:55:55,378 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:55:55,378 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:55:55,381 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions [2019-12-27 04:55:55,381 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions [2019-12-27 04:55:55,398 INFO L132 PetriNetUnfolder]: 5/63 cut-off events. [2019-12-27 04:55:55,398 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 04:55:55,400 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2019-12-27 04:55:55,403 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions [2019-12-27 04:55:55,419 INFO L132 PetriNetUnfolder]: 5/63 cut-off events. [2019-12-27 04:55:55,419 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 04:55:55,421 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2019-12-27 04:55:55,423 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 792 [2019-12-27 04:55:55,424 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:55:56,042 INFO L206 etLargeBlockEncoding]: Checked pairs total: 964 [2019-12-27 04:55:56,044 INFO L214 etLargeBlockEncoding]: Total number of compositions: 35 [2019-12-27 04:55:56,045 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 13 transitions [2019-12-27 04:55:56,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100 states. [2019-12-27 04:55:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-12-27 04:55:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:55:56,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:56,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:55:56,057 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:56,058 INFO L82 PathProgramCache]: Analyzing trace with hash 238718261, now seen corresponding path program 1 times [2019-12-27 04:55:56,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:56,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513057656] [2019-12-27 04:55:56,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:56,128 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 04:55:56,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513057656] [2019-12-27 04:55:56,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:56,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:55:56,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445142284] [2019-12-27 04:55:56,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:55:56,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:56,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:55:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:56,130 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2019-12-27 04:55:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:56,160 INFO L93 Difference]: Finished difference Result 96 states and 197 transitions. [2019-12-27 04:55:56,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:56,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:55:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:56,165 INFO L225 Difference]: With dead ends: 96 [2019-12-27 04:55:56,166 INFO L226 Difference]: Without dead ends: 96 [2019-12-27 04:55:56,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-27 04:55:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2019-12-27 04:55:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-27 04:55:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 180 transitions. [2019-12-27 04:55:56,190 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 180 transitions. Word has length 5 [2019-12-27 04:55:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:56,190 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 180 transitions. [2019-12-27 04:55:56,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:55:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 180 transitions. [2019-12-27 04:55:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:55:56,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:56,192 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:56,192 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:56,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:56,192 INFO L82 PathProgramCache]: Analyzing trace with hash -885466150, now seen corresponding path program 1 times [2019-12-27 04:55:56,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:56,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955329751] [2019-12-27 04:55:56,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:55:56,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955329751] [2019-12-27 04:55:56,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:56,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:55:56,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262756713] [2019-12-27 04:55:56,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:55:56,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:56,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:55:56,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:56,256 INFO L87 Difference]: Start difference. First operand 84 states and 180 transitions. Second operand 3 states. [2019-12-27 04:55:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:56,274 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2019-12-27 04:55:56,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:56,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 04:55:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:56,276 INFO L225 Difference]: With dead ends: 84 [2019-12-27 04:55:56,276 INFO L226 Difference]: Without dead ends: 84 [2019-12-27 04:55:56,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-27 04:55:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2019-12-27 04:55:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-27 04:55:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2019-12-27 04:55:56,289 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 8 [2019-12-27 04:55:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:56,290 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2019-12-27 04:55:56,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:55:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2019-12-27 04:55:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:55:56,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:56,291 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:56,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:56,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1678754413, now seen corresponding path program 1 times [2019-12-27 04:55:56,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:56,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48069366] [2019-12-27 04:55:56,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 04:55:56,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48069366] [2019-12-27 04:55:56,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:56,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:55:56,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69651305] [2019-12-27 04:55:56,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:55:56,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:55:56,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:55:56,357 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 4 states. [2019-12-27 04:55:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:56,391 INFO L93 Difference]: Finished difference Result 68 states and 136 transitions. [2019-12-27 04:55:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:56,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:55:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:56,392 INFO L225 Difference]: With dead ends: 68 [2019-12-27 04:55:56,393 INFO L226 Difference]: Without dead ends: 68 [2019-12-27 04:55:56,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:55:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-27 04:55:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-12-27 04:55:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-27 04:55:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 129 transitions. [2019-12-27 04:55:56,401 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 129 transitions. Word has length 9 [2019-12-27 04:55:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:56,402 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 129 transitions. [2019-12-27 04:55:56,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:55:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 129 transitions. [2019-12-27 04:55:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:55:56,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:56,403 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-12-27 04:55:56,403 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1679727603, now seen corresponding path program 1 times [2019-12-27 04:55:56,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:56,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388327851] [2019-12-27 04:55:56,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:55:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:55:56,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:55:56,449 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:55:56,451 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:55:56,451 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 04:55:56,459 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,460 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,460 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,460 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,460 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,461 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,461 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,461 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,461 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,461 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,461 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,462 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,462 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,462 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,462 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,463 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,463 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,463 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,463 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,463 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,463 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,464 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,465 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,465 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,465 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,465 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,466 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,466 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,466 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,467 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,468 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,471 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,471 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,471 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,471 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,471 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,474 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,475 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,475 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:56,477 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 04:55:56,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:55:56,477 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:55:56,477 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:55:56,477 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:55:56,478 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:55:56,478 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:55:56,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:55:56,478 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:55:56,480 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 59 transitions [2019-12-27 04:55:56,480 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions [2019-12-27 04:55:56,499 INFO L132 PetriNetUnfolder]: 7/85 cut-off events. [2019-12-27 04:55:56,499 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 04:55:56,501 INFO L76 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2019-12-27 04:55:56,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions [2019-12-27 04:55:56,520 INFO L132 PetriNetUnfolder]: 7/85 cut-off events. [2019-12-27 04:55:56,520 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 04:55:56,522 INFO L76 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2019-12-27 04:55:56,525 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1656 [2019-12-27 04:55:56,526 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:55:57,154 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2078 [2019-12-27 04:55:57,155 INFO L214 etLargeBlockEncoding]: Total number of compositions: 45 [2019-12-27 04:55:57,155 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 17 transitions [2019-12-27 04:55:57,174 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 404 states. [2019-12-27 04:55:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states. [2019-12-27 04:55:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:55:57,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:57,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:55:57,176 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:57,176 INFO L82 PathProgramCache]: Analyzing trace with hash 353939392, now seen corresponding path program 1 times [2019-12-27 04:55:57,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:57,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254445030] [2019-12-27 04:55:57,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:57,210 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 04:55:57,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254445030] [2019-12-27 04:55:57,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:57,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:55:57,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360907528] [2019-12-27 04:55:57,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:55:57,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:55:57,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:57,213 INFO L87 Difference]: Start difference. First operand 404 states. Second operand 3 states. [2019-12-27 04:55:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:57,260 INFO L93 Difference]: Finished difference Result 447 states and 1247 transitions. [2019-12-27 04:55:57,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:57,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:55:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:57,267 INFO L225 Difference]: With dead ends: 447 [2019-12-27 04:55:57,267 INFO L226 Difference]: Without dead ends: 447 [2019-12-27 04:55:57,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-27 04:55:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 378. [2019-12-27 04:55:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-27 04:55:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1099 transitions. [2019-12-27 04:55:57,321 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1099 transitions. Word has length 5 [2019-12-27 04:55:57,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:57,321 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 1099 transitions. [2019-12-27 04:55:57,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:55:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1099 transitions. [2019-12-27 04:55:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:55:57,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:57,322 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:57,323 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash -36478308, now seen corresponding path program 1 times [2019-12-27 04:55:57,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:57,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061373744] [2019-12-27 04:55:57,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:57,347 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 04:55:57,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061373744] [2019-12-27 04:55:57,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:57,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:55:57,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861962653] [2019-12-27 04:55:57,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:55:57,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:55:57,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:57,349 INFO L87 Difference]: Start difference. First operand 378 states and 1099 transitions. Second operand 3 states. [2019-12-27 04:55:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:57,377 INFO L93 Difference]: Finished difference Result 486 states and 1356 transitions. [2019-12-27 04:55:57,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:57,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 04:55:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:57,384 INFO L225 Difference]: With dead ends: 486 [2019-12-27 04:55:57,384 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 04:55:57,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 04:55:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 412. [2019-12-27 04:55:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-27 04:55:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1196 transitions. [2019-12-27 04:55:57,415 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1196 transitions. Word has length 8 [2019-12-27 04:55:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:57,415 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 1196 transitions. [2019-12-27 04:55:57,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:55:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1196 transitions. [2019-12-27 04:55:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:55:57,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:57,416 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:57,416 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1917227077, now seen corresponding path program 1 times [2019-12-27 04:55:57,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:57,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800127371] [2019-12-27 04:55:57,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:55:57,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800127371] [2019-12-27 04:55:57,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:57,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:55:57,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466386802] [2019-12-27 04:55:57,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:55:57,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:55:57,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:55:57,458 INFO L87 Difference]: Start difference. First operand 412 states and 1196 transitions. Second operand 4 states. [2019-12-27 04:55:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:57,495 INFO L93 Difference]: Finished difference Result 338 states and 962 transitions. [2019-12-27 04:55:57,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:57,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:55:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:57,500 INFO L225 Difference]: With dead ends: 338 [2019-12-27 04:55:57,500 INFO L226 Difference]: Without dead ends: 338 [2019-12-27 04:55:57,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:55:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-27 04:55:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 283. [2019-12-27 04:55:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-27 04:55:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 793 transitions. [2019-12-27 04:55:57,518 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 793 transitions. Word has length 9 [2019-12-27 04:55:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:57,518 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 793 transitions. [2019-12-27 04:55:57,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:55:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 793 transitions. [2019-12-27 04:55:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:55:57,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:57,519 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:57,520 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:57,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1130826520, now seen corresponding path program 1 times [2019-12-27 04:55:57,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:57,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647784829] [2019-12-27 04:55:57,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:57,573 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 04:55:57,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647784829] [2019-12-27 04:55:57,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:57,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:55:57,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548838793] [2019-12-27 04:55:57,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:55:57,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:57,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:55:57,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:55:57,576 INFO L87 Difference]: Start difference. First operand 283 states and 793 transitions. Second operand 4 states. [2019-12-27 04:55:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:57,612 INFO L93 Difference]: Finished difference Result 233 states and 641 transitions. [2019-12-27 04:55:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:57,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:55:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:57,615 INFO L225 Difference]: With dead ends: 233 [2019-12-27 04:55:57,616 INFO L226 Difference]: Without dead ends: 233 [2019-12-27 04:55:57,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:55:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-27 04:55:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 183. [2019-12-27 04:55:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-27 04:55:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 489 transitions. [2019-12-27 04:55:57,627 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 489 transitions. Word has length 9 [2019-12-27 04:55:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:57,627 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 489 transitions. [2019-12-27 04:55:57,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:55:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 489 transitions. [2019-12-27 04:55:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:55:57,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:57,629 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:57,630 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:57,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash -197280631, now seen corresponding path program 1 times [2019-12-27 04:55:57,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:57,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577965094] [2019-12-27 04:55:57,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:55:57,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577965094] [2019-12-27 04:55:57,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:57,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:55:57,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607503538] [2019-12-27 04:55:57,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:55:57,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:55:57,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:57,690 INFO L87 Difference]: Start difference. First operand 183 states and 489 transitions. Second operand 3 states. [2019-12-27 04:55:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:57,718 INFO L93 Difference]: Finished difference Result 243 states and 634 transitions. [2019-12-27 04:55:57,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:57,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 04:55:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:57,721 INFO L225 Difference]: With dead ends: 243 [2019-12-27 04:55:57,721 INFO L226 Difference]: Without dead ends: 243 [2019-12-27 04:55:57,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-27 04:55:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2019-12-27 04:55:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-27 04:55:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 570 transitions. [2019-12-27 04:55:57,729 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 570 transitions. Word has length 11 [2019-12-27 04:55:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:57,730 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 570 transitions. [2019-12-27 04:55:57,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:55:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 570 transitions. [2019-12-27 04:55:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:55:57,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:57,731 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:57,732 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:57,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:57,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1820731179, now seen corresponding path program 1 times [2019-12-27 04:55:57,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:57,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073930126] [2019-12-27 04:55:57,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:55:57,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073930126] [2019-12-27 04:55:57,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:57,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:55:57,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545719574] [2019-12-27 04:55:57,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:55:57,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:55:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:55:57,799 INFO L87 Difference]: Start difference. First operand 211 states and 570 transitions. Second operand 4 states. [2019-12-27 04:55:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:57,842 INFO L93 Difference]: Finished difference Result 179 states and 474 transitions. [2019-12-27 04:55:57,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:57,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 04:55:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:57,846 INFO L225 Difference]: With dead ends: 179 [2019-12-27 04:55:57,847 INFO L226 Difference]: Without dead ends: 179 [2019-12-27 04:55:57,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:55:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-27 04:55:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2019-12-27 04:55:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-27 04:55:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 378 transitions. [2019-12-27 04:55:57,856 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 378 transitions. Word has length 12 [2019-12-27 04:55:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:57,856 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 378 transitions. [2019-12-27 04:55:57,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:55:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 378 transitions. [2019-12-27 04:55:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:55:57,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:57,859 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-12-27 04:55:57,859 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:55:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:57,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1820837778, now seen corresponding path program 1 times [2019-12-27 04:55:57,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:57,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815846745] [2019-12-27 04:55:57,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:55:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:55:57,902 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:55:57,903 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:55:57,903 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:55:57,903 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 04:55:57,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,919 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,919 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,930 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,932 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,932 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,933 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,937 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,938 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:55:57,942 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:55:57,942 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:55:57,942 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:55:57,943 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:55:57,943 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:55:57,943 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:55:57,943 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:55:57,943 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:55:57,943 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:55:57,944 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 72 transitions [2019-12-27 04:55:57,944 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions [2019-12-27 04:55:57,973 INFO L132 PetriNetUnfolder]: 9/107 cut-off events. [2019-12-27 04:55:57,973 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 04:55:57,975 INFO L76 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2019-12-27 04:55:57,980 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions [2019-12-27 04:55:57,996 INFO L132 PetriNetUnfolder]: 9/107 cut-off events. [2019-12-27 04:55:57,996 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 04:55:57,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2019-12-27 04:55:58,004 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 04:55:58,004 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:55:58,723 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3472 [2019-12-27 04:55:58,723 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 04:55:58,723 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 23 transitions [2019-12-27 04:55:58,819 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2020 states. [2019-12-27 04:55:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states. [2019-12-27 04:55:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:55:58,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:58,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:55:58,820 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:55:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:58,820 INFO L82 PathProgramCache]: Analyzing trace with hash 491318823, now seen corresponding path program 1 times [2019-12-27 04:55:58,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:58,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649782570] [2019-12-27 04:55:58,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:58,838 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 04:55:58,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649782570] [2019-12-27 04:55:58,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:58,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:55:58,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705043266] [2019-12-27 04:55:58,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:55:58,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:55:58,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:58,841 INFO L87 Difference]: Start difference. First operand 2020 states. Second operand 3 states. [2019-12-27 04:55:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:58,923 INFO L93 Difference]: Finished difference Result 2352 states and 8424 transitions. [2019-12-27 04:55:58,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:58,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:55:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:58,944 INFO L225 Difference]: With dead ends: 2352 [2019-12-27 04:55:58,944 INFO L226 Difference]: Without dead ends: 2352 [2019-12-27 04:55:58,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2019-12-27 04:55:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1967. [2019-12-27 04:55:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 04:55:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7298 transitions. [2019-12-27 04:55:59,060 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7298 transitions. Word has length 5 [2019-12-27 04:55:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:59,060 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7298 transitions. [2019-12-27 04:55:59,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:55:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7298 transitions. [2019-12-27 04:55:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:55:59,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:59,061 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:59,061 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:55:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash -487037178, now seen corresponding path program 1 times [2019-12-27 04:55:59,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:59,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940513131] [2019-12-27 04:55:59,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:59,076 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 04:55:59,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940513131] [2019-12-27 04:55:59,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:59,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:55:59,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266920579] [2019-12-27 04:55:59,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:55:59,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:59,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:55:59,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:59,078 INFO L87 Difference]: Start difference. First operand 1967 states and 7298 transitions. Second operand 3 states. [2019-12-27 04:55:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:59,150 INFO L93 Difference]: Finished difference Result 2953 states and 10780 transitions. [2019-12-27 04:55:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:59,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 04:55:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:59,180 INFO L225 Difference]: With dead ends: 2953 [2019-12-27 04:55:59,181 INFO L226 Difference]: Without dead ends: 2953 [2019-12-27 04:55:59,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2019-12-27 04:55:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2223. [2019-12-27 04:55:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-12-27 04:55:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 8283 transitions. [2019-12-27 04:55:59,303 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 8283 transitions. Word has length 8 [2019-12-27 04:55:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:59,304 INFO L462 AbstractCegarLoop]: Abstraction has 2223 states and 8283 transitions. [2019-12-27 04:55:59,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:55:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 8283 transitions. [2019-12-27 04:55:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:55:59,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:59,304 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:59,306 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:55:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1358722116, now seen corresponding path program 1 times [2019-12-27 04:55:59,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:59,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608542332] [2019-12-27 04:55:59,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:55:59,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608542332] [2019-12-27 04:55:59,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:59,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:55:59,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947252706] [2019-12-27 04:55:59,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:55:59,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:59,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:55:59,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:55:59,352 INFO L87 Difference]: Start difference. First operand 2223 states and 8283 transitions. Second operand 4 states. [2019-12-27 04:55:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:59,414 INFO L93 Difference]: Finished difference Result 1779 states and 6526 transitions. [2019-12-27 04:55:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:59,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:55:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:59,430 INFO L225 Difference]: With dead ends: 1779 [2019-12-27 04:55:59,430 INFO L226 Difference]: Without dead ends: 1779 [2019-12-27 04:55:59,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:55:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-27 04:55:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1414. [2019-12-27 04:55:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-27 04:55:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 5095 transitions. [2019-12-27 04:55:59,531 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 5095 transitions. Word has length 9 [2019-12-27 04:55:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:59,532 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 5095 transitions. [2019-12-27 04:55:59,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:55:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 5095 transitions. [2019-12-27 04:55:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:55:59,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:59,533 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:59,533 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:55:59,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:59,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2081718434, now seen corresponding path program 1 times [2019-12-27 04:55:59,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:59,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196683045] [2019-12-27 04:55:59,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:59,565 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 04:55:59,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196683045] [2019-12-27 04:55:59,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:59,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:55:59,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301930224] [2019-12-27 04:55:59,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:55:59,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:55:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:55:59,567 INFO L87 Difference]: Start difference. First operand 1414 states and 5095 transitions. Second operand 4 states. [2019-12-27 04:55:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:59,641 INFO L93 Difference]: Finished difference Result 1187 states and 4236 transitions. [2019-12-27 04:55:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:59,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:55:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:59,655 INFO L225 Difference]: With dead ends: 1187 [2019-12-27 04:55:59,655 INFO L226 Difference]: Without dead ends: 1187 [2019-12-27 04:55:59,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:55:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-12-27 04:55:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 960. [2019-12-27 04:55:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-27 04:55:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 3377 transitions. [2019-12-27 04:55:59,707 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 3377 transitions. Word has length 9 [2019-12-27 04:55:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:59,708 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 3377 transitions. [2019-12-27 04:55:59,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:55:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 3377 transitions. [2019-12-27 04:55:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:55:59,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:59,709 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:59,709 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:55:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1050664949, now seen corresponding path program 1 times [2019-12-27 04:55:59,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:59,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458583235] [2019-12-27 04:55:59,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:55:59,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458583235] [2019-12-27 04:55:59,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:59,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:55:59,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147865350] [2019-12-27 04:55:59,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:55:59,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:55:59,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:59,739 INFO L87 Difference]: Start difference. First operand 960 states and 3377 transitions. Second operand 3 states. [2019-12-27 04:55:59,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:59,799 INFO L93 Difference]: Finished difference Result 1395 states and 4813 transitions. [2019-12-27 04:55:59,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:59,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 04:55:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:59,815 INFO L225 Difference]: With dead ends: 1395 [2019-12-27 04:55:59,815 INFO L226 Difference]: Without dead ends: 1395 [2019-12-27 04:55:59,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:55:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2019-12-27 04:55:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1174. [2019-12-27 04:55:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-12-27 04:55:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4190 transitions. [2019-12-27 04:55:59,865 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4190 transitions. Word has length 11 [2019-12-27 04:55:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:55:59,866 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 4190 transitions. [2019-12-27 04:55:59,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:55:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4190 transitions. [2019-12-27 04:55:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:55:59,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:55:59,869 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:55:59,869 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:55:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:55:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1789126636, now seen corresponding path program 1 times [2019-12-27 04:55:59,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:55:59,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716106759] [2019-12-27 04:55:59,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:55:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:55:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:55:59,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716106759] [2019-12-27 04:55:59,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:55:59,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:55:59,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192224879] [2019-12-27 04:55:59,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:55:59,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:55:59,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:55:59,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:55:59,899 INFO L87 Difference]: Start difference. First operand 1174 states and 4190 transitions. Second operand 4 states. [2019-12-27 04:55:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:55:59,950 INFO L93 Difference]: Finished difference Result 953 states and 3346 transitions. [2019-12-27 04:55:59,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:55:59,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 04:55:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:55:59,969 INFO L225 Difference]: With dead ends: 953 [2019-12-27 04:55:59,970 INFO L226 Difference]: Without dead ends: 953 [2019-12-27 04:55:59,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:55:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-12-27 04:55:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 732. [2019-12-27 04:55:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-12-27 04:55:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2502 transitions. [2019-12-27 04:56:00,000 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2502 transitions. Word has length 12 [2019-12-27 04:56:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:00,000 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 2502 transitions. [2019-12-27 04:56:00,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2502 transitions. [2019-12-27 04:56:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:56:00,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:00,002 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:00,002 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:56:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1243568347, now seen corresponding path program 1 times [2019-12-27 04:56:00,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:00,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105908856] [2019-12-27 04:56:00,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 04:56:00,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105908856] [2019-12-27 04:56:00,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:00,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:00,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526018266] [2019-12-27 04:56:00,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:00,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:00,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:00,028 INFO L87 Difference]: Start difference. First operand 732 states and 2502 transitions. Second operand 3 states. [2019-12-27 04:56:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:00,066 INFO L93 Difference]: Finished difference Result 1008 states and 3409 transitions. [2019-12-27 04:56:00,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:00,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 04:56:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:00,079 INFO L225 Difference]: With dead ends: 1008 [2019-12-27 04:56:00,079 INFO L226 Difference]: Without dead ends: 1008 [2019-12-27 04:56:00,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-27 04:56:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 868. [2019-12-27 04:56:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-27 04:56:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 3016 transitions. [2019-12-27 04:56:00,110 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 3016 transitions. Word has length 14 [2019-12-27 04:56:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:00,111 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 3016 transitions. [2019-12-27 04:56:00,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 3016 transitions. [2019-12-27 04:56:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:56:00,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:00,112 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:00,113 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:56:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash -104085370, now seen corresponding path program 1 times [2019-12-27 04:56:00,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:00,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379343552] [2019-12-27 04:56:00,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 04:56:00,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379343552] [2019-12-27 04:56:00,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:00,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:00,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154014544] [2019-12-27 04:56:00,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:00,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:00,137 INFO L87 Difference]: Start difference. First operand 868 states and 3016 transitions. Second operand 4 states. [2019-12-27 04:56:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:00,169 INFO L93 Difference]: Finished difference Result 728 states and 2483 transitions. [2019-12-27 04:56:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:00,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 04:56:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:00,173 INFO L225 Difference]: With dead ends: 728 [2019-12-27 04:56:00,173 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 04:56:00,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 04:56:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 588. [2019-12-27 04:56:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-27 04:56:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1950 transitions. [2019-12-27 04:56:00,195 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1950 transitions. Word has length 15 [2019-12-27 04:56:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:00,195 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1950 transitions. [2019-12-27 04:56:00,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1950 transitions. [2019-12-27 04:56:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:56:00,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:00,197 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:00,197 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:56:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash -104215289, now seen corresponding path program 1 times [2019-12-27 04:56:00,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:00,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986361650] [2019-12-27 04:56:00,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:56:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:56:00,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:56:00,216 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:56:00,217 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:56:00,217 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 04:56:00,225 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,225 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,226 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,226 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,226 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,226 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,226 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,226 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,226 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,227 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,227 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,227 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,227 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,227 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,227 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,228 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,228 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,228 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,228 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,228 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,228 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,228 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,228 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,229 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,229 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,229 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,229 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,229 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,230 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,231 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,231 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,231 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,231 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,231 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,231 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,231 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,233 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,233 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,233 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,233 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,234 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,234 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,234 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,234 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,234 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,234 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,235 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,235 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,236 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,236 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,236 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,236 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,244 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,244 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,244 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,245 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,247 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,247 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,248 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,250 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,251 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,251 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,251 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:00,253 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 04:56:00,253 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:56:00,253 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:56:00,253 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:56:00,254 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:56:00,254 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:56:00,254 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:56:00,254 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:56:00,254 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:56:00,255 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions [2019-12-27 04:56:00,255 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions [2019-12-27 04:56:00,287 INFO L132 PetriNetUnfolder]: 11/129 cut-off events. [2019-12-27 04:56:00,288 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 04:56:00,292 INFO L76 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-27 04:56:00,302 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions [2019-12-27 04:56:00,343 INFO L132 PetriNetUnfolder]: 11/129 cut-off events. [2019-12-27 04:56:00,343 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 04:56:00,346 INFO L76 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-27 04:56:00,353 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4320 [2019-12-27 04:56:00,354 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:56:01,137 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5838 [2019-12-27 04:56:01,137 INFO L214 etLargeBlockEncoding]: Total number of compositions: 65 [2019-12-27 04:56:01,138 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 25 transitions [2019-12-27 04:56:01,544 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6484 states. [2019-12-27 04:56:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states. [2019-12-27 04:56:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:56:01,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:01,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:56:01,546 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash 652705188, now seen corresponding path program 1 times [2019-12-27 04:56:01,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:01,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288028784] [2019-12-27 04:56:01,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:01,568 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 04:56:01,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288028784] [2019-12-27 04:56:01,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:01,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:01,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330669388] [2019-12-27 04:56:01,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:01,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:01,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:01,570 INFO L87 Difference]: Start difference. First operand 6484 states. Second operand 3 states. [2019-12-27 04:56:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:01,722 INFO L93 Difference]: Finished difference Result 7629 states and 32588 transitions. [2019-12-27 04:56:01,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:01,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:56:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:01,765 INFO L225 Difference]: With dead ends: 7629 [2019-12-27 04:56:01,765 INFO L226 Difference]: Without dead ends: 7629 [2019-12-27 04:56:01,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7629 states. [2019-12-27 04:56:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7629 to 6366. [2019-12-27 04:56:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6366 states. [2019-12-27 04:56:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6366 states to 6366 states and 28029 transitions. [2019-12-27 04:56:02,237 INFO L78 Accepts]: Start accepts. Automaton has 6366 states and 28029 transitions. Word has length 5 [2019-12-27 04:56:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:02,238 INFO L462 AbstractCegarLoop]: Abstraction has 6366 states and 28029 transitions. [2019-12-27 04:56:02,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6366 states and 28029 transitions. [2019-12-27 04:56:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:56:02,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:02,239 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:02,239 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1277107584, now seen corresponding path program 1 times [2019-12-27 04:56:02,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:02,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496645185] [2019-12-27 04:56:02,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:02,254 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 04:56:02,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496645185] [2019-12-27 04:56:02,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:02,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:02,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356267037] [2019-12-27 04:56:02,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:02,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:02,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:02,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:02,256 INFO L87 Difference]: Start difference. First operand 6366 states and 28029 transitions. Second operand 3 states. [2019-12-27 04:56:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:02,375 INFO L93 Difference]: Finished difference Result 9120 states and 39254 transitions. [2019-12-27 04:56:02,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:02,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 04:56:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:02,434 INFO L225 Difference]: With dead ends: 9120 [2019-12-27 04:56:02,434 INFO L226 Difference]: Without dead ends: 9120 [2019-12-27 04:56:02,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2019-12-27 04:56:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 7564. [2019-12-27 04:56:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-12-27 04:56:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 33556 transitions. [2019-12-27 04:56:03,482 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 33556 transitions. Word has length 8 [2019-12-27 04:56:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:03,482 INFO L462 AbstractCegarLoop]: Abstraction has 7564 states and 33556 transitions. [2019-12-27 04:56:03,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 33556 transitions. [2019-12-27 04:56:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:56:03,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:03,485 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:03,485 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash 935631175, now seen corresponding path program 1 times [2019-12-27 04:56:03,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:03,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733591621] [2019-12-27 04:56:03,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:03,514 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 04:56:03,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733591621] [2019-12-27 04:56:03,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:03,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:03,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431968281] [2019-12-27 04:56:03,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:03,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:03,518 INFO L87 Difference]: Start difference. First operand 7564 states and 33556 transitions. Second operand 4 states. [2019-12-27 04:56:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:03,658 INFO L93 Difference]: Finished difference Result 6008 states and 26302 transitions. [2019-12-27 04:56:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:03,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:56:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:03,694 INFO L225 Difference]: With dead ends: 6008 [2019-12-27 04:56:03,694 INFO L226 Difference]: Without dead ends: 6008 [2019-12-27 04:56:03,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2019-12-27 04:56:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 4771. [2019-12-27 04:56:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-12-27 04:56:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 20598 transitions. [2019-12-27 04:56:04,069 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 20598 transitions. Word has length 9 [2019-12-27 04:56:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:04,070 INFO L462 AbstractCegarLoop]: Abstraction has 4771 states and 20598 transitions. [2019-12-27 04:56:04,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 20598 transitions. [2019-12-27 04:56:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:56:04,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:04,071 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:04,071 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash 935633007, now seen corresponding path program 1 times [2019-12-27 04:56:04,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:04,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831053430] [2019-12-27 04:56:04,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:04,091 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 04:56:04,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831053430] [2019-12-27 04:56:04,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:04,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:04,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332259464] [2019-12-27 04:56:04,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:04,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:04,093 INFO L87 Difference]: Start difference. First operand 4771 states and 20598 transitions. Second operand 4 states. [2019-12-27 04:56:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:04,167 INFO L93 Difference]: Finished difference Result 3827 states and 16326 transitions. [2019-12-27 04:56:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:04,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:56:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:04,190 INFO L225 Difference]: With dead ends: 3827 [2019-12-27 04:56:04,190 INFO L226 Difference]: Without dead ends: 3827 [2019-12-27 04:56:04,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2019-12-27 04:56:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2883. [2019-12-27 04:56:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-12-27 04:56:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 12054 transitions. [2019-12-27 04:56:04,326 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 12054 transitions. Word has length 9 [2019-12-27 04:56:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:04,329 INFO L462 AbstractCegarLoop]: Abstraction has 2883 states and 12054 transitions. [2019-12-27 04:56:04,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 12054 transitions. [2019-12-27 04:56:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:56:04,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:04,330 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:04,330 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:04,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1346541726, now seen corresponding path program 1 times [2019-12-27 04:56:04,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:04,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537192578] [2019-12-27 04:56:04,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:56:04,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537192578] [2019-12-27 04:56:04,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:04,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:04,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658653716] [2019-12-27 04:56:04,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:04,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:04,372 INFO L87 Difference]: Start difference. First operand 2883 states and 12054 transitions. Second operand 3 states. [2019-12-27 04:56:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:04,432 INFO L93 Difference]: Finished difference Result 4275 states and 17545 transitions. [2019-12-27 04:56:04,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:04,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 04:56:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:04,455 INFO L225 Difference]: With dead ends: 4275 [2019-12-27 04:56:04,455 INFO L226 Difference]: Without dead ends: 4275 [2019-12-27 04:56:04,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-12-27 04:56:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3574. [2019-12-27 04:56:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-12-27 04:56:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 15125 transitions. [2019-12-27 04:56:04,593 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 15125 transitions. Word has length 11 [2019-12-27 04:56:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:04,593 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 15125 transitions. [2019-12-27 04:56:04,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 15125 transitions. [2019-12-27 04:56:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:56:04,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:04,595 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:04,595 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1206877661, now seen corresponding path program 1 times [2019-12-27 04:56:04,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:04,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345393560] [2019-12-27 04:56:04,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:56:04,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345393560] [2019-12-27 04:56:04,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:04,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:04,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520165791] [2019-12-27 04:56:04,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:04,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:04,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:04,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:04,620 INFO L87 Difference]: Start difference. First operand 3574 states and 15125 transitions. Second operand 4 states. [2019-12-27 04:56:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:04,670 INFO L93 Difference]: Finished difference Result 2873 states and 12004 transitions. [2019-12-27 04:56:04,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:04,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 04:56:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:04,684 INFO L225 Difference]: With dead ends: 2873 [2019-12-27 04:56:04,684 INFO L226 Difference]: Without dead ends: 2873 [2019-12-27 04:56:04,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2019-12-27 04:56:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2172. [2019-12-27 04:56:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2019-12-27 04:56:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 8883 transitions. [2019-12-27 04:56:04,847 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 8883 transitions. Word has length 12 [2019-12-27 04:56:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:04,847 INFO L462 AbstractCegarLoop]: Abstraction has 2172 states and 8883 transitions. [2019-12-27 04:56:04,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 8883 transitions. [2019-12-27 04:56:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:56:04,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:04,848 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:04,848 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash -315974263, now seen corresponding path program 1 times [2019-12-27 04:56:04,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:04,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372093728] [2019-12-27 04:56:04,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 04:56:04,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372093728] [2019-12-27 04:56:04,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:04,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:04,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453310814] [2019-12-27 04:56:04,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:04,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:04,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:04,877 INFO L87 Difference]: Start difference. First operand 2172 states and 8883 transitions. Second operand 3 states. [2019-12-27 04:56:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:04,921 INFO L93 Difference]: Finished difference Result 3177 states and 12799 transitions. [2019-12-27 04:56:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:04,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 04:56:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:04,936 INFO L225 Difference]: With dead ends: 3177 [2019-12-27 04:56:04,936 INFO L226 Difference]: Without dead ends: 3177 [2019-12-27 04:56:04,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2019-12-27 04:56:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2671. [2019-12-27 04:56:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2019-12-27 04:56:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 11075 transitions. [2019-12-27 04:56:05,021 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 11075 transitions. Word has length 14 [2019-12-27 04:56:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:05,022 INFO L462 AbstractCegarLoop]: Abstraction has 2671 states and 11075 transitions. [2019-12-27 04:56:05,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 11075 transitions. [2019-12-27 04:56:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:56:05,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:05,024 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:05,024 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1205265918, now seen corresponding path program 1 times [2019-12-27 04:56:05,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:05,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240729297] [2019-12-27 04:56:05,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 04:56:05,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240729297] [2019-12-27 04:56:05,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:05,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:05,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318090029] [2019-12-27 04:56:05,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:05,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:05,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:05,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:05,051 INFO L87 Difference]: Start difference. First operand 2671 states and 11075 transitions. Second operand 4 states. [2019-12-27 04:56:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:05,096 INFO L93 Difference]: Finished difference Result 2165 states and 8845 transitions. [2019-12-27 04:56:05,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:05,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 04:56:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:05,111 INFO L225 Difference]: With dead ends: 2165 [2019-12-27 04:56:05,111 INFO L226 Difference]: Without dead ends: 2165 [2019-12-27 04:56:05,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2019-12-27 04:56:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1659. [2019-12-27 04:56:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-12-27 04:56:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 6615 transitions. [2019-12-27 04:56:05,163 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 6615 transitions. Word has length 15 [2019-12-27 04:56:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:05,163 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 6615 transitions. [2019-12-27 04:56:05,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 6615 transitions. [2019-12-27 04:56:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:56:05,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:05,165 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:05,165 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1240295411, now seen corresponding path program 1 times [2019-12-27 04:56:05,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:05,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443195449] [2019-12-27 04:56:05,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 04:56:05,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443195449] [2019-12-27 04:56:05,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:05,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:05,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841284833] [2019-12-27 04:56:05,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:05,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:05,194 INFO L87 Difference]: Start difference. First operand 1659 states and 6615 transitions. Second operand 3 states. [2019-12-27 04:56:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:05,232 INFO L93 Difference]: Finished difference Result 2295 states and 9088 transitions. [2019-12-27 04:56:05,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:05,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 04:56:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:05,243 INFO L225 Difference]: With dead ends: 2295 [2019-12-27 04:56:05,244 INFO L226 Difference]: Without dead ends: 2295 [2019-12-27 04:56:05,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-12-27 04:56:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1975. [2019-12-27 04:56:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-27 04:56:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 8000 transitions. [2019-12-27 04:56:05,303 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 8000 transitions. Word has length 17 [2019-12-27 04:56:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:05,304 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 8000 transitions. [2019-12-27 04:56:05,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 8000 transitions. [2019-12-27 04:56:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:56:05,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:05,306 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:05,306 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -205702466, now seen corresponding path program 1 times [2019-12-27 04:56:05,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:05,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489825700] [2019-12-27 04:56:05,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:56:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:56:05,334 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:56:05,335 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:56:05,335 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:56:05,335 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 04:56:05,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,353 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,353 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,353 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,354 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,354 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,355 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,355 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,355 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,355 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,355 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,355 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,356 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,356 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,356 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,356 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,356 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,356 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,356 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,357 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,357 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,358 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,358 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,358 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,358 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,358 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,358 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,358 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,360 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,360 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,361 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,361 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,361 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,361 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,361 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,361 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,363 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,364 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:05,375 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 04:56:05,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:56:05,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:56:05,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:56:05,376 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:56:05,376 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:56:05,376 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:56:05,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:56:05,376 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:56:05,379 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 98 transitions [2019-12-27 04:56:05,379 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions [2019-12-27 04:56:05,403 INFO L132 PetriNetUnfolder]: 13/151 cut-off events. [2019-12-27 04:56:05,403 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 04:56:05,407 INFO L76 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-27 04:56:05,419 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions [2019-12-27 04:56:05,446 INFO L132 PetriNetUnfolder]: 13/151 cut-off events. [2019-12-27 04:56:05,446 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 04:56:05,450 INFO L76 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-27 04:56:05,461 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 6120 [2019-12-27 04:56:05,461 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:56:06,352 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8349 [2019-12-27 04:56:06,352 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2019-12-27 04:56:06,352 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 31 transitions [2019-12-27 04:56:09,897 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32404 states. [2019-12-27 04:56:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32404 states. [2019-12-27 04:56:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:56:09,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:09,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:56:09,897 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:09,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:09,898 INFO L82 PathProgramCache]: Analyzing trace with hash 837410524, now seen corresponding path program 1 times [2019-12-27 04:56:09,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:09,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733261563] [2019-12-27 04:56:09,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:09,929 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 04:56:09,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733261563] [2019-12-27 04:56:09,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:09,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:09,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754390892] [2019-12-27 04:56:09,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:09,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:09,930 INFO L87 Difference]: Start difference. First operand 32404 states. Second operand 3 states. [2019-12-27 04:56:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:11,044 INFO L93 Difference]: Finished difference Result 38316 states and 194259 transitions. [2019-12-27 04:56:11,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:11,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:56:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:11,286 INFO L225 Difference]: With dead ends: 38316 [2019-12-27 04:56:11,287 INFO L226 Difference]: Without dead ends: 38316 [2019-12-27 04:56:11,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38316 states. [2019-12-27 04:56:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38316 to 31940. [2019-12-27 04:56:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31940 states. [2019-12-27 04:56:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31940 states to 31940 states and 166174 transitions. [2019-12-27 04:56:13,192 INFO L78 Accepts]: Start accepts. Automaton has 31940 states and 166174 transitions. Word has length 5 [2019-12-27 04:56:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:13,192 INFO L462 AbstractCegarLoop]: Abstraction has 31940 states and 166174 transitions. [2019-12-27 04:56:13,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 31940 states and 166174 transitions. [2019-12-27 04:56:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:56:13,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:13,193 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:13,193 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1966218909, now seen corresponding path program 1 times [2019-12-27 04:56:13,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:13,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141668326] [2019-12-27 04:56:13,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:13,206 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 04:56:13,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141668326] [2019-12-27 04:56:13,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:13,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:13,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233155154] [2019-12-27 04:56:13,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:13,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:13,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:13,208 INFO L87 Difference]: Start difference. First operand 31940 states and 166174 transitions. Second operand 3 states. [2019-12-27 04:56:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:13,487 INFO L93 Difference]: Finished difference Result 46178 states and 235622 transitions. [2019-12-27 04:56:13,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:13,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 04:56:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:13,685 INFO L225 Difference]: With dead ends: 46178 [2019-12-27 04:56:13,685 INFO L226 Difference]: Without dead ends: 46178 [2019-12-27 04:56:13,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46178 states. [2019-12-27 04:56:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46178 to 38236. [2019-12-27 04:56:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38236 states. [2019-12-27 04:56:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38236 states to 38236 states and 200230 transitions. [2019-12-27 04:56:17,566 INFO L78 Accepts]: Start accepts. Automaton has 38236 states and 200230 transitions. Word has length 8 [2019-12-27 04:56:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:17,566 INFO L462 AbstractCegarLoop]: Abstraction has 38236 states and 200230 transitions. [2019-12-27 04:56:17,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 38236 states and 200230 transitions. [2019-12-27 04:56:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:56:17,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:17,567 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:17,567 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:17,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:17,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1411123806, now seen corresponding path program 1 times [2019-12-27 04:56:17,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:17,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13286149] [2019-12-27 04:56:17,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:56:17,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13286149] [2019-12-27 04:56:17,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:17,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:17,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976784032] [2019-12-27 04:56:17,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:17,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:17,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:17,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:17,597 INFO L87 Difference]: Start difference. First operand 38236 states and 200230 transitions. Second operand 4 states. [2019-12-27 04:56:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:18,332 INFO L93 Difference]: Finished difference Result 30294 states and 156896 transitions. [2019-12-27 04:56:18,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:18,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:56:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:18,427 INFO L225 Difference]: With dead ends: 30294 [2019-12-27 04:56:18,427 INFO L226 Difference]: Without dead ends: 30294 [2019-12-27 04:56:18,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30294 states. [2019-12-27 04:56:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30294 to 23950. [2019-12-27 04:56:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23950 states. [2019-12-27 04:56:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23950 states to 23950 states and 122597 transitions. [2019-12-27 04:56:21,549 INFO L78 Accepts]: Start accepts. Automaton has 23950 states and 122597 transitions. Word has length 9 [2019-12-27 04:56:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:21,549 INFO L462 AbstractCegarLoop]: Abstraction has 23950 states and 122597 transitions. [2019-12-27 04:56:21,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23950 states and 122597 transitions. [2019-12-27 04:56:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:56:21,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:21,550 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:21,550 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash 823246975, now seen corresponding path program 1 times [2019-12-27 04:56:21,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:21,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533637651] [2019-12-27 04:56:21,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:56:21,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533637651] [2019-12-27 04:56:21,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:21,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:21,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047391415] [2019-12-27 04:56:21,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:21,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:21,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:21,577 INFO L87 Difference]: Start difference. First operand 23950 states and 122597 transitions. Second operand 4 states. [2019-12-27 04:56:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:21,752 INFO L93 Difference]: Finished difference Result 19172 states and 97171 transitions. [2019-12-27 04:56:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:21,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:56:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:21,808 INFO L225 Difference]: With dead ends: 19172 [2019-12-27 04:56:21,808 INFO L226 Difference]: Without dead ends: 19172 [2019-12-27 04:56:21,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19172 states. [2019-12-27 04:56:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19172 to 14394. [2019-12-27 04:56:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14394 states. [2019-12-27 04:56:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14394 states to 14394 states and 71745 transitions. [2019-12-27 04:56:22,223 INFO L78 Accepts]: Start accepts. Automaton has 14394 states and 71745 transitions. Word has length 9 [2019-12-27 04:56:22,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:22,223 INFO L462 AbstractCegarLoop]: Abstraction has 14394 states and 71745 transitions. [2019-12-27 04:56:22,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 14394 states and 71745 transitions. [2019-12-27 04:56:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:56:22,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:22,223 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:22,224 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash 697229360, now seen corresponding path program 1 times [2019-12-27 04:56:22,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:22,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473435636] [2019-12-27 04:56:22,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:56:22,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473435636] [2019-12-27 04:56:22,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:22,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:22,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605033266] [2019-12-27 04:56:22,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:22,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:22,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:22,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:22,244 INFO L87 Difference]: Start difference. First operand 14394 states and 71745 transitions. Second operand 3 states. [2019-12-27 04:56:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:22,733 INFO L93 Difference]: Finished difference Result 22955 states and 113320 transitions. [2019-12-27 04:56:22,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:22,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 04:56:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:22,828 INFO L225 Difference]: With dead ends: 22955 [2019-12-27 04:56:22,828 INFO L226 Difference]: Without dead ends: 22955 [2019-12-27 04:56:22,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22955 states. [2019-12-27 04:56:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22955 to 17239. [2019-12-27 04:56:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17239 states. [2019-12-27 04:56:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17239 states to 17239 states and 86508 transitions. [2019-12-27 04:56:23,387 INFO L78 Accepts]: Start accepts. Automaton has 17239 states and 86508 transitions. Word has length 11 [2019-12-27 04:56:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:23,388 INFO L462 AbstractCegarLoop]: Abstraction has 17239 states and 86508 transitions. [2019-12-27 04:56:23,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 17239 states and 86508 transitions. [2019-12-27 04:56:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:56:23,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:23,388 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:23,388 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 139276080, now seen corresponding path program 1 times [2019-12-27 04:56:23,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:23,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580200546] [2019-12-27 04:56:23,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:56:23,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580200546] [2019-12-27 04:56:23,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:23,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:23,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075824559] [2019-12-27 04:56:23,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:23,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:23,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:23,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:23,414 INFO L87 Difference]: Start difference. First operand 17239 states and 86508 transitions. Second operand 4 states. [2019-12-27 04:56:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:23,564 INFO L93 Difference]: Finished difference Result 14381 states and 71673 transitions. [2019-12-27 04:56:23,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:23,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 04:56:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:23,624 INFO L225 Difference]: With dead ends: 14381 [2019-12-27 04:56:23,625 INFO L226 Difference]: Without dead ends: 14381 [2019-12-27 04:56:23,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14381 states. [2019-12-27 04:56:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14381 to 11523. [2019-12-27 04:56:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11523 states. [2019-12-27 04:56:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11523 states to 11523 states and 56838 transitions. [2019-12-27 04:56:24,270 INFO L78 Accepts]: Start accepts. Automaton has 11523 states and 56838 transitions. Word has length 12 [2019-12-27 04:56:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:24,271 INFO L462 AbstractCegarLoop]: Abstraction has 11523 states and 56838 transitions. [2019-12-27 04:56:24,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 11523 states and 56838 transitions. [2019-12-27 04:56:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:56:24,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:24,271 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:24,272 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash 533949827, now seen corresponding path program 1 times [2019-12-27 04:56:24,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:24,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853252691] [2019-12-27 04:56:24,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 04:56:24,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853252691] [2019-12-27 04:56:24,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:24,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:24,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523674410] [2019-12-27 04:56:24,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:24,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:24,295 INFO L87 Difference]: Start difference. First operand 11523 states and 56838 transitions. Second operand 3 states. [2019-12-27 04:56:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:24,452 INFO L93 Difference]: Finished difference Result 17181 states and 83458 transitions. [2019-12-27 04:56:24,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:24,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 04:56:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:24,516 INFO L225 Difference]: With dead ends: 17181 [2019-12-27 04:56:24,516 INFO L226 Difference]: Without dead ends: 17181 [2019-12-27 04:56:24,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17181 states. [2019-12-27 04:56:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17181 to 14347. [2019-12-27 04:56:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-27 04:56:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 71535 transitions. [2019-12-27 04:56:24,869 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 71535 transitions. Word has length 14 [2019-12-27 04:56:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:24,870 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 71535 transitions. [2019-12-27 04:56:24,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 71535 transitions. [2019-12-27 04:56:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:56:24,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:24,871 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:24,871 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash -627421727, now seen corresponding path program 1 times [2019-12-27 04:56:24,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:24,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854430967] [2019-12-27 04:56:24,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 04:56:24,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854430967] [2019-12-27 04:56:24,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:24,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:24,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342170213] [2019-12-27 04:56:24,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:24,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:24,899 INFO L87 Difference]: Start difference. First operand 14347 states and 71535 transitions. Second operand 4 states. [2019-12-27 04:56:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:25,025 INFO L93 Difference]: Finished difference Result 11513 states and 56778 transitions. [2019-12-27 04:56:25,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:25,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 04:56:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:25,065 INFO L225 Difference]: With dead ends: 11513 [2019-12-27 04:56:25,066 INFO L226 Difference]: Without dead ends: 11513 [2019-12-27 04:56:25,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11513 states. [2019-12-27 04:56:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11513 to 8679. [2019-12-27 04:56:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-12-27 04:56:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 42021 transitions. [2019-12-27 04:56:25,285 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 42021 transitions. Word has length 15 [2019-12-27 04:56:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:25,286 INFO L462 AbstractCegarLoop]: Abstraction has 8679 states and 42021 transitions. [2019-12-27 04:56:25,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 42021 transitions. [2019-12-27 04:56:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:56:25,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:25,287 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:25,287 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1825068028, now seen corresponding path program 1 times [2019-12-27 04:56:25,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:25,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596282715] [2019-12-27 04:56:25,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 04:56:25,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596282715] [2019-12-27 04:56:25,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:25,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:25,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54298231] [2019-12-27 04:56:25,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:25,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:25,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:25,312 INFO L87 Difference]: Start difference. First operand 8679 states and 42021 transitions. Second operand 3 states. [2019-12-27 04:56:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:25,408 INFO L93 Difference]: Finished difference Result 12762 states and 61063 transitions. [2019-12-27 04:56:25,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:25,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 04:56:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:25,550 INFO L225 Difference]: With dead ends: 12762 [2019-12-27 04:56:25,551 INFO L226 Difference]: Without dead ends: 12762 [2019-12-27 04:56:25,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-27 04:56:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 10717. [2019-12-27 04:56:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10717 states. [2019-12-27 04:56:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10717 states to 10717 states and 52542 transitions. [2019-12-27 04:56:25,782 INFO L78 Accepts]: Start accepts. Automaton has 10717 states and 52542 transitions. Word has length 17 [2019-12-27 04:56:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:25,782 INFO L462 AbstractCegarLoop]: Abstraction has 10717 states and 52542 transitions. [2019-12-27 04:56:25,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 10717 states and 52542 transitions. [2019-12-27 04:56:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:56:25,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:25,786 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:25,786 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash -742531920, now seen corresponding path program 1 times [2019-12-27 04:56:25,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:25,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577574187] [2019-12-27 04:56:25,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-27 04:56:25,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577574187] [2019-12-27 04:56:25,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:25,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:56:25,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27968399] [2019-12-27 04:56:25,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:56:25,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:56:25,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:56:25,808 INFO L87 Difference]: Start difference. First operand 10717 states and 52542 transitions. Second operand 4 states. [2019-12-27 04:56:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:25,902 INFO L93 Difference]: Finished difference Result 8672 states and 41976 transitions. [2019-12-27 04:56:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:25,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 04:56:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:25,925 INFO L225 Difference]: With dead ends: 8672 [2019-12-27 04:56:25,925 INFO L226 Difference]: Without dead ends: 8672 [2019-12-27 04:56:25,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:56:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2019-12-27 04:56:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 6627. [2019-12-27 04:56:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6627 states. [2019-12-27 04:56:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 31410 transitions. [2019-12-27 04:56:26,077 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 31410 transitions. Word has length 18 [2019-12-27 04:56:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:26,078 INFO L462 AbstractCegarLoop]: Abstraction has 6627 states and 31410 transitions. [2019-12-27 04:56:26,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:56:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 31410 transitions. [2019-12-27 04:56:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:56:26,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:26,081 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:26,081 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:26,081 INFO L82 PathProgramCache]: Analyzing trace with hash -766676883, now seen corresponding path program 1 times [2019-12-27 04:56:26,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:26,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885055403] [2019-12-27 04:56:26,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:56:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-27 04:56:26,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885055403] [2019-12-27 04:56:26,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:56:26,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:56:26,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589241409] [2019-12-27 04:56:26,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:56:26,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:56:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:56:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:26,098 INFO L87 Difference]: Start difference. First operand 6627 states and 31410 transitions. Second operand 3 states. [2019-12-27 04:56:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:56:26,185 INFO L93 Difference]: Finished difference Result 9207 states and 43429 transitions. [2019-12-27 04:56:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:56:26,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 04:56:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:56:26,208 INFO L225 Difference]: With dead ends: 9207 [2019-12-27 04:56:26,209 INFO L226 Difference]: Without dead ends: 9207 [2019-12-27 04:56:26,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:56:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9207 states. [2019-12-27 04:56:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9207 to 7915. [2019-12-27 04:56:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7915 states. [2019-12-27 04:56:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7915 states to 7915 states and 38052 transitions. [2019-12-27 04:56:26,371 INFO L78 Accepts]: Start accepts. Automaton has 7915 states and 38052 transitions. Word has length 20 [2019-12-27 04:56:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:56:26,371 INFO L462 AbstractCegarLoop]: Abstraction has 7915 states and 38052 transitions. [2019-12-27 04:56:26,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:56:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7915 states and 38052 transitions. [2019-12-27 04:56:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:56:26,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:56:26,374 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:56:26,374 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:56:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:56:26,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2002648867, now seen corresponding path program 1 times [2019-12-27 04:56:26,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:56:26,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693136864] [2019-12-27 04:56:26,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:56:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:56:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:56:26,392 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:56:26,392 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:56:26,392 WARN L364 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:56:26,392 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2019-12-27 04:56:26,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,403 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,403 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,410 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,410 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,410 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,414 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,414 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,414 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,415 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,415 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,415 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,421 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,421 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,421 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,422 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,422 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,424 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,424 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,424 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,424 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,425 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,425 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,426 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,426 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,426 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:56:26,433 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 04:56:26,434 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:56:26,434 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:56:26,434 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:56:26,434 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:56:26,434 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:56:26,434 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:56:26,434 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:56:26,434 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:56:26,435 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 111 transitions [2019-12-27 04:56:26,436 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions [2019-12-27 04:56:26,462 INFO L132 PetriNetUnfolder]: 15/173 cut-off events. [2019-12-27 04:56:26,463 INFO L133 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2019-12-27 04:56:26,467 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2019-12-27 04:56:26,482 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions [2019-12-27 04:56:26,509 INFO L132 PetriNetUnfolder]: 15/173 cut-off events. [2019-12-27 04:56:26,510 INFO L133 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2019-12-27 04:56:26,515 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2019-12-27 04:56:26,526 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8232 [2019-12-27 04:56:26,527 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:56:27,542 INFO L206 etLargeBlockEncoding]: Checked pairs total: 12199 [2019-12-27 04:56:27,542 INFO L214 etLargeBlockEncoding]: Total number of compositions: 88 [2019-12-27 04:56:27,542 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 37 transitions [2019-12-27 04:57:20,335 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160420 states. [2019-12-27 04:57:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 160420 states. [2019-12-27 04:57:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 04:57:20,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:57:20,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 04:57:20,335 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:57:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:57:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1044393949, now seen corresponding path program 1 times [2019-12-27 04:57:20,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:57:20,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393849252] [2019-12-27 04:57:20,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:57:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:57:20,346 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 04:57:20,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393849252] [2019-12-27 04:57:20,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:57:20,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:57:20,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812434859] [2019-12-27 04:57:20,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:57:20,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:57:20,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:57:20,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:57:20,348 INFO L87 Difference]: Start difference. First operand 160420 states. Second operand 3 states. [2019-12-27 04:57:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:57:26,936 INFO L93 Difference]: Finished difference Result 190005 states and 1117019 transitions. [2019-12-27 04:57:26,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:57:26,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 04:57:26,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:57:27,698 INFO L225 Difference]: With dead ends: 190005 [2019-12-27 04:57:27,698 INFO L226 Difference]: Without dead ends: 190005 [2019-12-27 04:57:27,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:57:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190005 states. [2019-12-27 04:57:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190005 to 158349. [2019-12-27 04:57:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158349 states. [2019-12-27 04:57:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158349 states to 158349 states and 952006 transitions. [2019-12-27 04:57:37,888 INFO L78 Accepts]: Start accepts. Automaton has 158349 states and 952006 transitions. Word has length 5 [2019-12-27 04:57:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:57:37,888 INFO L462 AbstractCegarLoop]: Abstraction has 158349 states and 952006 transitions. [2019-12-27 04:57:37,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:57:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 158349 states and 952006 transitions. [2019-12-27 04:57:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:57:37,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:57:37,888 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:57:37,889 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:57:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:57:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash 610026521, now seen corresponding path program 1 times [2019-12-27 04:57:37,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:57:37,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959549961] [2019-12-27 04:57:37,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:57:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:57:37,913 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 04:57:37,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959549961] [2019-12-27 04:57:37,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:57:37,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:57:37,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333343955] [2019-12-27 04:57:37,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:57:37,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:57:37,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:57:37,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:57:37,914 INFO L87 Difference]: Start difference. First operand 158349 states and 952006 transitions. Second operand 3 states. [2019-12-27 04:57:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:57:48,178 INFO L93 Difference]: Finished difference Result 246811 states and 1468819 transitions. [2019-12-27 04:57:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:57:48,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-27 04:57:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:57:49,116 INFO L225 Difference]: With dead ends: 246811 [2019-12-27 04:57:49,117 INFO L226 Difference]: Without dead ends: 246811 [2019-12-27 04:57:49,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:58:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246811 states. [2019-12-27 04:58:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246811 to 183575. [2019-12-27 04:58:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183575 states. [2019-12-27 04:58:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183575 states to 183575 states and 1107523 transitions. [2019-12-27 04:58:08,095 INFO L78 Accepts]: Start accepts. Automaton has 183575 states and 1107523 transitions. Word has length 8 [2019-12-27 04:58:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:58:08,095 INFO L462 AbstractCegarLoop]: Abstraction has 183575 states and 1107523 transitions. [2019-12-27 04:58:08,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:58:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 183575 states and 1107523 transitions. [2019-12-27 04:58:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:58:08,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:58:08,096 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:58:08,096 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:58:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:58:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1165029829, now seen corresponding path program 1 times [2019-12-27 04:58:08,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:58:08,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401733330] [2019-12-27 04:58:08,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:58:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:58:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:58:08,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401733330] [2019-12-27 04:58:08,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:58:08,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:58:08,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659144446] [2019-12-27 04:58:08,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:58:08,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:58:08,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:58:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:58:08,129 INFO L87 Difference]: Start difference. First operand 183575 states and 1107523 transitions. Second operand 4 states. [2019-12-27 04:58:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:58:16,559 INFO L93 Difference]: Finished difference Result 145622 states and 870444 transitions. [2019-12-27 04:58:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:58:16,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:58:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:58:17,882 INFO L225 Difference]: With dead ends: 145622 [2019-12-27 04:58:17,882 INFO L226 Difference]: Without dead ends: 145622 [2019-12-27 04:58:17,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:58:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145622 states. [2019-12-27 04:58:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145622 to 114004. [2019-12-27 04:58:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114004 states. [2019-12-27 04:58:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114004 states to 114004 states and 673987 transitions. [2019-12-27 04:58:29,183 INFO L78 Accepts]: Start accepts. Automaton has 114004 states and 673987 transitions. Word has length 9 [2019-12-27 04:58:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:58:29,183 INFO L462 AbstractCegarLoop]: Abstraction has 114004 states and 673987 transitions. [2019-12-27 04:58:29,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:58:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 114004 states and 673987 transitions. [2019-12-27 04:58:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:58:29,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:58:29,184 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:58:29,184 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:58:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:58:29,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1730955589, now seen corresponding path program 1 times [2019-12-27 04:58:29,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:58:29,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581504811] [2019-12-27 04:58:29,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:58:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:58:29,209 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 04:58:29,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581504811] [2019-12-27 04:58:29,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:58:29,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:58:29,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392980894] [2019-12-27 04:58:29,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:58:29,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:58:29,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:58:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:58:29,210 INFO L87 Difference]: Start difference. First operand 114004 states and 673987 transitions. Second operand 4 states. [2019-12-27 04:58:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:58:31,177 INFO L93 Difference]: Finished difference Result 95018 states and 558562 transitions. [2019-12-27 04:58:31,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:58:31,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 04:58:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:58:31,546 INFO L225 Difference]: With dead ends: 95018 [2019-12-27 04:58:31,546 INFO L226 Difference]: Without dead ends: 95018 [2019-12-27 04:58:31,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:58:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95018 states. [2019-12-27 04:58:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95018 to 76032. [2019-12-27 04:58:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76032 states. [2019-12-27 04:58:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76032 states to 76032 states and 443137 transitions. [2019-12-27 04:58:41,312 INFO L78 Accepts]: Start accepts. Automaton has 76032 states and 443137 transitions. Word has length 9 [2019-12-27 04:58:41,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:58:41,312 INFO L462 AbstractCegarLoop]: Abstraction has 76032 states and 443137 transitions. [2019-12-27 04:58:41,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:58:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 76032 states and 443137 transitions. [2019-12-27 04:58:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:58:41,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:58:41,313 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:58:41,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:58:41,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:58:41,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1101646248, now seen corresponding path program 1 times [2019-12-27 04:58:41,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:58:41,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673598794] [2019-12-27 04:58:41,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:58:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:58:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:58:41,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673598794] [2019-12-27 04:58:41,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:58:41,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:58:41,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018662677] [2019-12-27 04:58:41,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:58:41,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:58:41,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:58:41,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:58:41,326 INFO L87 Difference]: Start difference. First operand 76032 states and 443137 transitions. Second operand 3 states. [2019-12-27 04:58:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:58:43,070 INFO L93 Difference]: Finished difference Result 113976 states and 654880 transitions. [2019-12-27 04:58:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:58:43,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 04:58:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:58:43,477 INFO L225 Difference]: With dead ends: 113976 [2019-12-27 04:58:43,477 INFO L226 Difference]: Without dead ends: 113976 [2019-12-27 04:58:43,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:58:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113976 states. [2019-12-27 04:58:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113976 to 94996. [2019-12-27 04:58:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94996 states. [2019-12-27 04:58:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94996 states to 94996 states and 558450 transitions. [2019-12-27 04:58:53,248 INFO L78 Accepts]: Start accepts. Automaton has 94996 states and 558450 transitions. Word has length 11 [2019-12-27 04:58:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:58:53,249 INFO L462 AbstractCegarLoop]: Abstraction has 94996 states and 558450 transitions. [2019-12-27 04:58:53,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:58:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 94996 states and 558450 transitions. [2019-12-27 04:58:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 04:58:53,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:58:53,249 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:58:53,250 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:58:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:58:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash -208702148, now seen corresponding path program 1 times [2019-12-27 04:58:53,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:58:53,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874396003] [2019-12-27 04:58:53,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:58:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:58:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 04:58:53,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874396003] [2019-12-27 04:58:53,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:58:53,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:58:53,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918087672] [2019-12-27 04:58:53,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:58:53,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:58:53,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:58:53,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:58:53,267 INFO L87 Difference]: Start difference. First operand 94996 states and 558450 transitions. Second operand 4 states. [2019-12-27 04:58:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:58:53,868 INFO L93 Difference]: Finished difference Result 76016 states and 443040 transitions. [2019-12-27 04:58:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:58:53,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 04:58:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:58:54,154 INFO L225 Difference]: With dead ends: 76016 [2019-12-27 04:58:54,154 INFO L226 Difference]: Without dead ends: 76016 [2019-12-27 04:58:54,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:58:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76016 states. [2019-12-27 04:58:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76016 to 57036. [2019-12-27 04:58:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57036 states. [2019-12-27 04:58:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57036 states to 57036 states and 327630 transitions. [2019-12-27 04:58:57,925 INFO L78 Accepts]: Start accepts. Automaton has 57036 states and 327630 transitions. Word has length 12 [2019-12-27 04:58:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:58:57,925 INFO L462 AbstractCegarLoop]: Abstraction has 57036 states and 327630 transitions. [2019-12-27 04:58:57,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:58:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 57036 states and 327630 transitions. [2019-12-27 04:58:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:58:57,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:58:57,926 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:58:57,926 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:58:57,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:58:57,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1111906441, now seen corresponding path program 1 times [2019-12-27 04:58:57,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:58:57,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527905645] [2019-12-27 04:58:57,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:58:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:58:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 04:58:57,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527905645] [2019-12-27 04:58:57,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:58:57,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:58:57,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621345055] [2019-12-27 04:58:57,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:58:57,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:58:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:58:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:58:57,949 INFO L87 Difference]: Start difference. First operand 57036 states and 327630 transitions. Second operand 3 states. [2019-12-27 04:58:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:58:59,044 INFO L93 Difference]: Finished difference Result 85437 states and 483874 transitions. [2019-12-27 04:58:59,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:58:59,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 04:58:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:03,765 INFO L225 Difference]: With dead ends: 85437 [2019-12-27 04:59:03,766 INFO L226 Difference]: Without dead ends: 85437 [2019-12-27 04:59:03,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85437 states. [2019-12-27 04:59:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85437 to 71230. [2019-12-27 04:59:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71230 states. [2019-12-27 04:59:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71230 states to 71230 states and 412813 transitions. [2019-12-27 04:59:06,306 INFO L78 Accepts]: Start accepts. Automaton has 71230 states and 412813 transitions. Word has length 14 [2019-12-27 04:59:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:06,307 INFO L462 AbstractCegarLoop]: Abstraction has 71230 states and 412813 transitions. [2019-12-27 04:59:06,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 71230 states and 412813 transitions. [2019-12-27 04:59:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:59:06,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:06,307 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:06,308 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:06,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:06,308 INFO L82 PathProgramCache]: Analyzing trace with hash 109363834, now seen corresponding path program 1 times [2019-12-27 04:59:06,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:06,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573467016] [2019-12-27 04:59:06,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 04:59:06,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573467016] [2019-12-27 04:59:06,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:06,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:06,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792344566] [2019-12-27 04:59:06,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:06,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:06,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:06,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:06,328 INFO L87 Difference]: Start difference. First operand 71230 states and 412813 transitions. Second operand 4 states. [2019-12-27 04:59:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:07,561 INFO L93 Difference]: Finished difference Result 57023 states and 327545 transitions. [2019-12-27 04:59:07,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:07,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 04:59:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:07,747 INFO L225 Difference]: With dead ends: 57023 [2019-12-27 04:59:07,747 INFO L226 Difference]: Without dead ends: 57023 [2019-12-27 04:59:07,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57023 states. Received shutdown request... [2019-12-27 04:59:13,045 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 04:59:13,048 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 04:59:13,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:59:13 BasicIcfg [2019-12-27 04:59:13,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:59:13,051 INFO L168 Benchmark]: Toolchain (without parser) took 199951.61 ms. Allocated memory was 147.8 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 104.9 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 04:59:13,051 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 147.8 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 04:59:13,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.52 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 104.9 MB in the beginning and 165.3 MB in the end (delta: -60.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:13,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.29 ms. Allocated memory is still 204.5 MB. Free memory was 165.3 MB in the beginning and 162.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:13,052 INFO L168 Benchmark]: Boogie Preprocessor took 25.09 ms. Allocated memory is still 204.5 MB. Free memory was 162.6 MB in the beginning and 161.6 MB in the end (delta: 916.5 kB). Peak memory consumption was 916.5 kB. Max. memory is 7.1 GB. [2019-12-27 04:59:13,053 INFO L168 Benchmark]: RCFGBuilder took 376.89 ms. Allocated memory is still 204.5 MB. Free memory was 161.6 MB in the beginning and 145.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:13,053 INFO L168 Benchmark]: TraceAbstraction took 198834.20 ms. Allocated memory was 204.5 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 145.7 MB in the beginning and 2.9 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 04:59:13,056 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.36 ms. Allocated memory is still 147.8 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 663.52 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 104.9 MB in the beginning and 165.3 MB in the end (delta: -60.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.29 ms. Allocated memory is still 204.5 MB. Free memory was 165.3 MB in the beginning and 162.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.09 ms. Allocated memory is still 204.5 MB. Free memory was 162.6 MB in the beginning and 161.6 MB in the end (delta: 916.5 kB). Peak memory consumption was 916.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 376.89 ms. Allocated memory is still 204.5 MB. Free memory was 161.6 MB in the beginning and 145.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198834.20 ms. Allocated memory was 204.5 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 145.7 MB in the beginning and 2.9 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 34 ProgramPointsBefore, 9 ProgramPointsAfterwards, 33 TransitionsBefore, 8 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 160 CheckedPairsTotal, 29 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.6s, 48 ProgramPointsBefore, 15 ProgramPointsAfterwards, 46 TransitionsBefore, 13 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 430 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 964 CheckedPairsTotal, 35 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.6s, 62 ProgramPointsBefore, 20 ProgramPointsAfterwards, 59 TransitionsBefore, 17 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 4 ChoiceCompositions, 887 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2078 CheckedPairsTotal, 45 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 72 TransitionsBefore, 23 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 1513 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3472 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 90 ProgramPointsBefore, 30 ProgramPointsAfterwards, 85 TransitionsBefore, 25 TransitionsAfterwards, 4320 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 6 ChoiceCompositions, 2340 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5838 CheckedPairsTotal, 65 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 104 ProgramPointsBefore, 36 ProgramPointsAfterwards, 98 TransitionsBefore, 31 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 3292 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 8349 CheckedPairsTotal, 76 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.1s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 111 TransitionsBefore, 37 TransitionsAfterwards, 8232 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 6 ChoiceCompositions, 4486 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 12199 CheckedPairsTotal, 88 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 680). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Result: TIMEOUT, OverallTime: 166.6s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 369 SDtfs, 274 SDslu, 200 SDs, 0 SdLazy, 274 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183575occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 71.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 197663 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 50/50 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