/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 11:58:36,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 11:58:36,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 11:58:36,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 11:58:36,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 11:58:36,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 11:58:36,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 11:58:36,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 11:58:36,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 11:58:36,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 11:58:36,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 11:58:36,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 11:58:36,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 11:58:36,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 11:58:36,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 11:58:36,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 11:58:36,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 11:58:36,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 11:58:36,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 11:58:36,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 11:58:36,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 11:58:36,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 11:58:36,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 11:58:36,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 11:58:36,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 11:58:36,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 11:58:36,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 11:58:36,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 11:58:36,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 11:58:36,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 11:58:36,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 11:58:36,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 11:58:36,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 11:58:36,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 11:58:36,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 11:58:36,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 11:58:36,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 11:58:36,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 11:58:36,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 11:58:36,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 11:58:36,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 11:58:36,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 11:58:36,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 11:58:36,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 11:58:36,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 11:58:36,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 11:58:36,607 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 11:58:36,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 11:58:36,608 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 11:58:36,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 11:58:36,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 11:58:36,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 11:58:36,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 11:58:36,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 11:58:36,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 11:58:36,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 11:58:36,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 11:58:36,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 11:58:36,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 11:58:36,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 11:58:36,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 11:58:36,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 11:58:36,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 11:58:36,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 11:58:36,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 11:58:36,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 11:58:36,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 11:58:36,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 11:58:36,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 11:58:36,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 11:58:36,616 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 11:58:36,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 11:58:36,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 11:58:36,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 11:58:36,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 11:58:36,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 11:58:36,912 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 11:58:36,913 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-18 11:58:36,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3549765a/9828801749e547a58b995fd4eb04d302/FLAGc90f1f9be [2019-12-18 11:58:37,554 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 11:58:37,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2019-12-18 11:58:37,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3549765a/9828801749e547a58b995fd4eb04d302/FLAGc90f1f9be [2019-12-18 11:58:37,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3549765a/9828801749e547a58b995fd4eb04d302 [2019-12-18 11:58:37,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 11:58:37,855 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 11:58:37,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 11:58:37,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 11:58:37,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 11:58:37,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:58:37" (1/1) ... [2019-12-18 11:58:37,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7ed1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:37, skipping insertion in model container [2019-12-18 11:58:37,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:58:37" (1/1) ... [2019-12-18 11:58:37,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 11:58:37,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 11:58:38,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 11:58:38,372 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 11:58:38,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 11:58:38,487 INFO L208 MainTranslator]: Completed translation [2019-12-18 11:58:38,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38 WrapperNode [2019-12-18 11:58:38,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 11:58:38,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 11:58:38,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 11:58:38,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 11:58:38,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 11:58:38,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 11:58:38,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 11:58:38,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 11:58:38,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (1/1) ... [2019-12-18 11:58:38,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 11:58:38,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 11:58:38,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 11:58:38,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 11:58:38,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (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-18 11:58:38,627 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 11:58:38,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 11:58:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 11:58:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 11:58:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 11:58:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 11:58:38,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 11:58:38,630 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 11:58:38,935 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 11:58:38,936 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-18 11:58:38,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:58:38 BoogieIcfgContainer [2019-12-18 11:58:38,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 11:58:38,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 11:58:38,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 11:58:38,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 11:58:38,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:58:37" (1/3) ... [2019-12-18 11:58:38,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182c874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:58:38, skipping insertion in model container [2019-12-18 11:58:38,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:58:38" (2/3) ... [2019-12-18 11:58:38,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182c874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:58:38, skipping insertion in model container [2019-12-18 11:58:38,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:58:38" (3/3) ... [2019-12-18 11:58:38,946 INFO L109 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2019-12-18 11:58:38,956 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 11:58:38,957 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 11:58:38,964 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 11:58:38,965 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 11:58:38,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,992 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,994 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,994 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,994 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,995 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,995 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:38,995 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:39,006 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:39,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:39,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:39,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:39,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:39,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:39,027 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-18 11:58:39,044 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:58:39,044 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:58:39,044 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:58:39,044 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:58:39,044 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:58:39,044 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:58:39,045 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:58:39,045 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:58:39,056 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions [2019-12-18 11:58:39,058 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions [2019-12-18 11:58:39,088 INFO L126 PetriNetUnfolder]: 3/41 cut-off events. [2019-12-18 11:58:39,088 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:39,094 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. 5/40 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-18 11:58:39,099 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions [2019-12-18 11:58:39,114 INFO L126 PetriNetUnfolder]: 3/41 cut-off events. [2019-12-18 11:58:39,115 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:39,116 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. 5/40 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-18 11:58:39,117 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 240 [2019-12-18 11:58:39,119 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:58:39,788 INFO L206 etLargeBlockEncoding]: Checked pairs total: 160 [2019-12-18 11:58:39,788 INFO L214 etLargeBlockEncoding]: Total number of compositions: 29 [2019-12-18 11:58:39,792 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 9 places, 8 transitions [2019-12-18 11:58:39,800 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 19 states. [2019-12-18 11:58:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-12-18 11:58:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-18 11:58:39,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:39,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-18 11:58:39,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 11:58:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash 4687879, now seen corresponding path program 1 times [2019-12-18 11:58:39,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:39,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132989429] [2019-12-18 11:58:39,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:39,972 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-18 11:58:39,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132989429] [2019-12-18 11:58:39,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:39,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 11:58:39,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036905752] [2019-12-18 11:58:39,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 11:58:39,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:39,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 11:58:40,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 11:58:40,004 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-12-18 11:58:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:40,021 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-12-18 11:58:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 11:58:40,022 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-18 11:58:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:40,045 INFO L225 Difference]: With dead ends: 11 [2019-12-18 11:58:40,045 INFO L226 Difference]: Without dead ends: 11 [2019-12-18 11:58:40,052 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-18 11:58:40,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-12-18 11:58:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-12-18 11:58:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-18 11:58:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-12-18 11:58:40,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 4 [2019-12-18 11:58:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:40,090 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-12-18 11:58:40,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 11:58:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-12-18 11:58:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-18 11:58:40,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:40,091 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-18 11:58:40,092 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 11:58:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash 210024220, now seen corresponding path program 1 times [2019-12-18 11:58:40,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:40,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179154229] [2019-12-18 11:58:40,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:40,157 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 11:58:40,157 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 11:58:40,159 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 11:58:40,159 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 11:58:40,166 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,168 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,168 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,169 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,169 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,169 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,169 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,176 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,176 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,177 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,177 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,177 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,177 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:40,179 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 11:58:40,179 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:58:40,179 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:58:40,180 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:58:40,180 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:58:40,180 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:58:40,180 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:58:40,180 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:58:40,180 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:58:40,183 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions [2019-12-18 11:58:40,183 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions [2019-12-18 11:58:40,198 INFO L126 PetriNetUnfolder]: 5/63 cut-off events. [2019-12-18 11:58:40,198 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:40,200 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs. 14/67 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2019-12-18 11:58:40,203 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions [2019-12-18 11:58:40,217 INFO L126 PetriNetUnfolder]: 5/63 cut-off events. [2019-12-18 11:58:40,217 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:40,219 INFO L76 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs. 14/67 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2019-12-18 11:58:40,221 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 792 [2019-12-18 11:58:40,222 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:58:40,963 INFO L206 etLargeBlockEncoding]: Checked pairs total: 964 [2019-12-18 11:58:40,963 INFO L214 etLargeBlockEncoding]: Total number of compositions: 35 [2019-12-18 11:58:40,964 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 13 transitions [2019-12-18 11:58:40,969 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100 states. [2019-12-18 11:58:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2019-12-18 11:58:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 11:58:40,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:40,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 11:58:40,971 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash 238718261, now seen corresponding path program 1 times [2019-12-18 11:58:40,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:40,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076877103] [2019-12-18 11:58:40,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:41,016 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-18 11:58:41,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076877103] [2019-12-18 11:58:41,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:41,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:41,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056392073] [2019-12-18 11:58:41,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:41,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:41,019 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2019-12-18 11:58:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:41,051 INFO L93 Difference]: Finished difference Result 96 states and 197 transitions. [2019-12-18 11:58:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:41,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 11:58:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:41,056 INFO L225 Difference]: With dead ends: 96 [2019-12-18 11:58:41,057 INFO L226 Difference]: Without dead ends: 96 [2019-12-18 11:58:41,057 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-18 11:58:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-18 11:58:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2019-12-18 11:58:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-18 11:58:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 180 transitions. [2019-12-18 11:58:41,074 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 180 transitions. Word has length 5 [2019-12-18 11:58:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:41,074 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 180 transitions. [2019-12-18 11:58:41,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 180 transitions. [2019-12-18 11:58:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 11:58:41,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:41,075 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:41,076 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash -885466150, now seen corresponding path program 1 times [2019-12-18 11:58:41,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:41,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166846098] [2019-12-18 11:58:41,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:41,113 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-18 11:58:41,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166846098] [2019-12-18 11:58:41,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:41,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:41,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831918976] [2019-12-18 11:58:41,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:41,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:41,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:41,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:41,116 INFO L87 Difference]: Start difference. First operand 84 states and 180 transitions. Second operand 3 states. [2019-12-18 11:58:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:41,142 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2019-12-18 11:58:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:41,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-18 11:58:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:41,144 INFO L225 Difference]: With dead ends: 84 [2019-12-18 11:58:41,144 INFO L226 Difference]: Without dead ends: 84 [2019-12-18 11:58:41,146 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-18 11:58:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-18 11:58:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2019-12-18 11:58:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-18 11:58:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2019-12-18 11:58:41,165 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 8 [2019-12-18 11:58:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:41,166 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2019-12-18 11:58:41,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2019-12-18 11:58:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:58:41,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:41,170 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:41,170 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:41,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:41,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1678754413, now seen corresponding path program 1 times [2019-12-18 11:58:41,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:41,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136205283] [2019-12-18 11:58:41,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:41,265 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-18 11:58:41,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136205283] [2019-12-18 11:58:41,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:41,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:41,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102806925] [2019-12-18 11:58:41,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:41,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:41,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:41,269 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 4 states. [2019-12-18 11:58:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:41,304 INFO L93 Difference]: Finished difference Result 68 states and 136 transitions. [2019-12-18 11:58:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:41,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:58:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:41,308 INFO L225 Difference]: With dead ends: 68 [2019-12-18 11:58:41,308 INFO L226 Difference]: Without dead ends: 68 [2019-12-18 11:58:41,308 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-18 11:58:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-18 11:58:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-12-18 11:58:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-18 11:58:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 129 transitions. [2019-12-18 11:58:41,320 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 129 transitions. Word has length 9 [2019-12-18 11:58:41,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:41,321 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 129 transitions. [2019-12-18 11:58:41,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 129 transitions. [2019-12-18 11:58:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:58:41,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:41,322 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-12-18 11:58:41,322 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1679727603, now seen corresponding path program 1 times [2019-12-18 11:58:41,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:41,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649061583] [2019-12-18 11:58:41,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:41,351 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 11:58:41,351 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 11:58:41,352 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 11:58:41,352 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 11:58:41,363 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,364 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,364 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,367 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,367 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,367 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:41,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 11:58:41,380 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:58:41,380 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:58:41,380 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:58:41,380 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:58:41,380 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:58:41,380 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:58:41,380 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:58:41,381 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:58:41,382 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 59 transitions [2019-12-18 11:58:41,383 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions [2019-12-18 11:58:41,399 INFO L126 PetriNetUnfolder]: 7/85 cut-off events. [2019-12-18 11:58:41,399 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:41,401 INFO L76 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs. 27/98 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2019-12-18 11:58:41,405 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions [2019-12-18 11:58:41,419 INFO L126 PetriNetUnfolder]: 7/85 cut-off events. [2019-12-18 11:58:41,419 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:41,421 INFO L76 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs. 27/98 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2019-12-18 11:58:41,425 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1656 [2019-12-18 11:58:41,426 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:58:42,105 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2078 [2019-12-18 11:58:42,105 INFO L214 etLargeBlockEncoding]: Total number of compositions: 45 [2019-12-18 11:58:42,106 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 17 transitions [2019-12-18 11:58:42,122 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 404 states. [2019-12-18 11:58:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states. [2019-12-18 11:58:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 11:58:42,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:42,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 11:58:42,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 353939392, now seen corresponding path program 1 times [2019-12-18 11:58:42,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:42,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502994792] [2019-12-18 11:58:42,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:42,155 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-18 11:58:42,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502994792] [2019-12-18 11:58:42,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:42,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:42,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257058714] [2019-12-18 11:58:42,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:42,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:42,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:42,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:42,157 INFO L87 Difference]: Start difference. First operand 404 states. Second operand 3 states. [2019-12-18 11:58:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:42,202 INFO L93 Difference]: Finished difference Result 447 states and 1247 transitions. [2019-12-18 11:58:42,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:42,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 11:58:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:42,213 INFO L225 Difference]: With dead ends: 447 [2019-12-18 11:58:42,213 INFO L226 Difference]: Without dead ends: 447 [2019-12-18 11:58:42,213 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-18 11:58:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-18 11:58:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 378. [2019-12-18 11:58:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-18 11:58:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1099 transitions. [2019-12-18 11:58:42,263 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1099 transitions. Word has length 5 [2019-12-18 11:58:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:42,263 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 1099 transitions. [2019-12-18 11:58:42,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1099 transitions. [2019-12-18 11:58:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 11:58:42,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:42,264 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:42,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash -36478308, now seen corresponding path program 1 times [2019-12-18 11:58:42,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:42,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478767632] [2019-12-18 11:58:42,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:42,313 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-18 11:58:42,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478767632] [2019-12-18 11:58:42,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:42,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:42,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595935691] [2019-12-18 11:58:42,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:42,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:42,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:42,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:42,317 INFO L87 Difference]: Start difference. First operand 378 states and 1099 transitions. Second operand 3 states. [2019-12-18 11:58:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:42,351 INFO L93 Difference]: Finished difference Result 486 states and 1356 transitions. [2019-12-18 11:58:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:42,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-18 11:58:42,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:42,356 INFO L225 Difference]: With dead ends: 486 [2019-12-18 11:58:42,356 INFO L226 Difference]: Without dead ends: 486 [2019-12-18 11:58:42,357 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-18 11:58:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-18 11:58:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 412. [2019-12-18 11:58:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-18 11:58:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1196 transitions. [2019-12-18 11:58:42,382 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1196 transitions. Word has length 8 [2019-12-18 11:58:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:42,383 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 1196 transitions. [2019-12-18 11:58:42,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1196 transitions. [2019-12-18 11:58:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:58:42,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:42,384 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:42,384 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1917227077, now seen corresponding path program 1 times [2019-12-18 11:58:42,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:42,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018603776] [2019-12-18 11:58:42,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:42,420 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-18 11:58:42,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018603776] [2019-12-18 11:58:42,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:42,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:42,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705499477] [2019-12-18 11:58:42,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:42,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:42,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:42,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:42,423 INFO L87 Difference]: Start difference. First operand 412 states and 1196 transitions. Second operand 4 states. [2019-12-18 11:58:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:42,459 INFO L93 Difference]: Finished difference Result 338 states and 962 transitions. [2019-12-18 11:58:42,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:42,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:58:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:42,463 INFO L225 Difference]: With dead ends: 338 [2019-12-18 11:58:42,463 INFO L226 Difference]: Without dead ends: 338 [2019-12-18 11:58:42,464 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-18 11:58:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-18 11:58:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 283. [2019-12-18 11:58:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-18 11:58:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 793 transitions. [2019-12-18 11:58:42,476 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 793 transitions. Word has length 9 [2019-12-18 11:58:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:42,477 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 793 transitions. [2019-12-18 11:58:42,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 793 transitions. [2019-12-18 11:58:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:58:42,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:42,478 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:42,478 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1130826520, now seen corresponding path program 1 times [2019-12-18 11:58:42,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:42,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926184546] [2019-12-18 11:58:42,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:42,519 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-18 11:58:42,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926184546] [2019-12-18 11:58:42,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:42,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:42,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234295938] [2019-12-18 11:58:42,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:42,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:42,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:42,526 INFO L87 Difference]: Start difference. First operand 283 states and 793 transitions. Second operand 4 states. [2019-12-18 11:58:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:42,560 INFO L93 Difference]: Finished difference Result 233 states and 641 transitions. [2019-12-18 11:58:42,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:42,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:58:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:42,563 INFO L225 Difference]: With dead ends: 233 [2019-12-18 11:58:42,563 INFO L226 Difference]: Without dead ends: 233 [2019-12-18 11:58:42,566 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-18 11:58:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-18 11:58:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 183. [2019-12-18 11:58:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-18 11:58:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 489 transitions. [2019-12-18 11:58:42,577 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 489 transitions. Word has length 9 [2019-12-18 11:58:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:42,577 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 489 transitions. [2019-12-18 11:58:42,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 489 transitions. [2019-12-18 11:58:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 11:58:42,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:42,579 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:42,579 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash -197280631, now seen corresponding path program 1 times [2019-12-18 11:58:42,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:42,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125778516] [2019-12-18 11:58:42,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:42,628 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-18 11:58:42,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125778516] [2019-12-18 11:58:42,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:42,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:42,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699888588] [2019-12-18 11:58:42,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:42,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:42,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:42,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:42,630 INFO L87 Difference]: Start difference. First operand 183 states and 489 transitions. Second operand 3 states. [2019-12-18 11:58:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:42,665 INFO L93 Difference]: Finished difference Result 243 states and 634 transitions. [2019-12-18 11:58:42,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:42,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 11:58:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:42,667 INFO L225 Difference]: With dead ends: 243 [2019-12-18 11:58:42,667 INFO L226 Difference]: Without dead ends: 243 [2019-12-18 11:58:42,668 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-18 11:58:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-18 11:58:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2019-12-18 11:58:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-18 11:58:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 570 transitions. [2019-12-18 11:58:42,676 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 570 transitions. Word has length 11 [2019-12-18 11:58:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:42,678 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 570 transitions. [2019-12-18 11:58:42,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 570 transitions. [2019-12-18 11:58:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 11:58:42,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:42,679 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:42,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:42,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1820731179, now seen corresponding path program 1 times [2019-12-18 11:58:42,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:42,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258276791] [2019-12-18 11:58:42,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:42,703 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-18 11:58:42,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258276791] [2019-12-18 11:58:42,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:42,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:42,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852607666] [2019-12-18 11:58:42,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:42,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:42,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:42,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:42,705 INFO L87 Difference]: Start difference. First operand 211 states and 570 transitions. Second operand 4 states. [2019-12-18 11:58:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:42,738 INFO L93 Difference]: Finished difference Result 179 states and 474 transitions. [2019-12-18 11:58:42,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:42,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-18 11:58:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:42,739 INFO L225 Difference]: With dead ends: 179 [2019-12-18 11:58:42,740 INFO L226 Difference]: Without dead ends: 179 [2019-12-18 11:58:42,740 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-18 11:58:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-18 11:58:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2019-12-18 11:58:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-18 11:58:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 378 transitions. [2019-12-18 11:58:42,745 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 378 transitions. Word has length 12 [2019-12-18 11:58:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:42,745 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 378 transitions. [2019-12-18 11:58:42,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 378 transitions. [2019-12-18 11:58:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 11:58:42,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:42,747 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-12-18 11:58:42,747 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:58:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1820837778, now seen corresponding path program 1 times [2019-12-18 11:58:42,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:42,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269718365] [2019-12-18 11:58:42,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:42,767 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 11:58:42,767 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 11:58:42,767 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 11:58:42,767 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 11:58:42,775 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,775 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,776 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,776 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,777 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,777 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,778 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,778 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,779 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,779 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,779 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,783 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,783 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,784 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,784 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,785 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,785 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,785 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,785 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,786 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,786 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,786 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,786 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,786 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,787 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,788 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,788 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,789 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,789 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,789 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,789 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,791 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,791 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:42,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 11:58:42,796 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:58:42,796 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:58:42,796 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:58:42,796 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:58:42,796 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:58:42,796 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:58:42,796 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:58:42,796 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:58:42,798 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 72 transitions [2019-12-18 11:58:42,798 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions [2019-12-18 11:58:42,833 INFO L126 PetriNetUnfolder]: 9/107 cut-off events. [2019-12-18 11:58:42,833 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:42,836 INFO L76 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs. 44/133 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2019-12-18 11:58:42,840 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions [2019-12-18 11:58:42,852 INFO L126 PetriNetUnfolder]: 9/107 cut-off events. [2019-12-18 11:58:42,852 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:42,854 INFO L76 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs. 44/133 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2019-12-18 11:58:42,859 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-18 11:58:42,859 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:58:43,735 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3457 [2019-12-18 11:58:43,735 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-18 11:58:43,735 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 23 transitions [2019-12-18 11:58:43,852 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2020 states. [2019-12-18 11:58:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states. [2019-12-18 11:58:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 11:58:43,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:43,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 11:58:43,853 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-18 11:58:43,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:43,854 INFO L82 PathProgramCache]: Analyzing trace with hash 491318823, now seen corresponding path program 1 times [2019-12-18 11:58:43,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:43,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147793729] [2019-12-18 11:58:43,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:43,870 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-18 11:58:43,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147793729] [2019-12-18 11:58:43,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:43,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:43,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305601472] [2019-12-18 11:58:43,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:43,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:43,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:43,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:43,872 INFO L87 Difference]: Start difference. First operand 2020 states. Second operand 3 states. [2019-12-18 11:58:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:43,924 INFO L93 Difference]: Finished difference Result 2352 states and 8424 transitions. [2019-12-18 11:58:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:43,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 11:58:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:43,946 INFO L225 Difference]: With dead ends: 2352 [2019-12-18 11:58:43,946 INFO L226 Difference]: Without dead ends: 2352 [2019-12-18 11:58:43,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2019-12-18 11:58:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1967. [2019-12-18 11:58:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-18 11:58:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7298 transitions. [2019-12-18 11:58:44,053 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7298 transitions. Word has length 5 [2019-12-18 11:58:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:44,053 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7298 transitions. [2019-12-18 11:58:44,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7298 transitions. [2019-12-18 11:58:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 11:58:44,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:44,054 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:44,055 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-18 11:58:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash -487037178, now seen corresponding path program 1 times [2019-12-18 11:58:44,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:44,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93459780] [2019-12-18 11:58:44,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 11:58:44,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93459780] [2019-12-18 11:58:44,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:44,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:44,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197833059] [2019-12-18 11:58:44,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:44,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:44,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:44,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:44,078 INFO L87 Difference]: Start difference. First operand 1967 states and 7298 transitions. Second operand 3 states. [2019-12-18 11:58:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:44,160 INFO L93 Difference]: Finished difference Result 2953 states and 10780 transitions. [2019-12-18 11:58:44,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:44,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-18 11:58:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:44,193 INFO L225 Difference]: With dead ends: 2953 [2019-12-18 11:58:44,194 INFO L226 Difference]: Without dead ends: 2953 [2019-12-18 11:58:44,194 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-18 11:58:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2019-12-18 11:58:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2223. [2019-12-18 11:58:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-12-18 11:58:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 8283 transitions. [2019-12-18 11:58:44,314 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 8283 transitions. Word has length 8 [2019-12-18 11:58:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:44,314 INFO L462 AbstractCegarLoop]: Abstraction has 2223 states and 8283 transitions. [2019-12-18 11:58:44,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 8283 transitions. [2019-12-18 11:58:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:58:44,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:44,315 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:44,315 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-18 11:58:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1358722116, now seen corresponding path program 1 times [2019-12-18 11:58:44,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:44,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337827073] [2019-12-18 11:58:44,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:44,351 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-18 11:58:44,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337827073] [2019-12-18 11:58:44,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:44,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:44,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439504426] [2019-12-18 11:58:44,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:44,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:44,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:44,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:44,354 INFO L87 Difference]: Start difference. First operand 2223 states and 8283 transitions. Second operand 4 states. [2019-12-18 11:58:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:44,409 INFO L93 Difference]: Finished difference Result 1779 states and 6526 transitions. [2019-12-18 11:58:44,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:44,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:58:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:44,425 INFO L225 Difference]: With dead ends: 1779 [2019-12-18 11:58:44,425 INFO L226 Difference]: Without dead ends: 1779 [2019-12-18 11:58:44,425 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-18 11:58:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-18 11:58:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1414. [2019-12-18 11:58:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-18 11:58:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 5095 transitions. [2019-12-18 11:58:44,543 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 5095 transitions. Word has length 9 [2019-12-18 11:58:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:44,544 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 5095 transitions. [2019-12-18 11:58:44,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 5095 transitions. [2019-12-18 11:58:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:58:44,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:44,545 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:44,545 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-18 11:58:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2081718434, now seen corresponding path program 1 times [2019-12-18 11:58:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:44,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930585583] [2019-12-18 11:58:44,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:44,602 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-18 11:58:44,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930585583] [2019-12-18 11:58:44,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:44,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:44,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584639191] [2019-12-18 11:58:44,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:44,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:44,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:44,605 INFO L87 Difference]: Start difference. First operand 1414 states and 5095 transitions. Second operand 4 states. [2019-12-18 11:58:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:44,671 INFO L93 Difference]: Finished difference Result 1187 states and 4236 transitions. [2019-12-18 11:58:44,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:44,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:58:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:44,684 INFO L225 Difference]: With dead ends: 1187 [2019-12-18 11:58:44,684 INFO L226 Difference]: Without dead ends: 1187 [2019-12-18 11:58:44,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-18 11:58:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-12-18 11:58:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 960. [2019-12-18 11:58:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-18 11:58:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 3377 transitions. [2019-12-18 11:58:44,742 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 3377 transitions. Word has length 9 [2019-12-18 11:58:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:44,743 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 3377 transitions. [2019-12-18 11:58:44,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 3377 transitions. [2019-12-18 11:58:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 11:58:44,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:44,744 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:44,744 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-18 11:58:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1050664949, now seen corresponding path program 1 times [2019-12-18 11:58:44,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:44,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544691924] [2019-12-18 11:58:44,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:44,789 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-18 11:58:44,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544691924] [2019-12-18 11:58:44,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:44,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:44,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349313451] [2019-12-18 11:58:44,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:44,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:44,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:44,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:44,793 INFO L87 Difference]: Start difference. First operand 960 states and 3377 transitions. Second operand 3 states. [2019-12-18 11:58:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:44,846 INFO L93 Difference]: Finished difference Result 1395 states and 4813 transitions. [2019-12-18 11:58:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:44,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 11:58:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:44,864 INFO L225 Difference]: With dead ends: 1395 [2019-12-18 11:58:44,864 INFO L226 Difference]: Without dead ends: 1395 [2019-12-18 11:58:44,867 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-18 11:58:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2019-12-18 11:58:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1174. [2019-12-18 11:58:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-12-18 11:58:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4190 transitions. [2019-12-18 11:58:44,930 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4190 transitions. Word has length 11 [2019-12-18 11:58:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:44,930 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 4190 transitions. [2019-12-18 11:58:44,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4190 transitions. [2019-12-18 11:58:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 11:58:44,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:44,931 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:44,932 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-18 11:58:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:44,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1789126636, now seen corresponding path program 1 times [2019-12-18 11:58:44,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:44,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670100434] [2019-12-18 11:58:44,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:44,965 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-18 11:58:44,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670100434] [2019-12-18 11:58:44,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:44,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:44,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855034315] [2019-12-18 11:58:44,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:44,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:44,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:44,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:44,967 INFO L87 Difference]: Start difference. First operand 1174 states and 4190 transitions. Second operand 4 states. [2019-12-18 11:58:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:45,007 INFO L93 Difference]: Finished difference Result 953 states and 3346 transitions. [2019-12-18 11:58:45,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:45,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-18 11:58:45,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:45,027 INFO L225 Difference]: With dead ends: 953 [2019-12-18 11:58:45,027 INFO L226 Difference]: Without dead ends: 953 [2019-12-18 11:58:45,027 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-18 11:58:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-12-18 11:58:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 732. [2019-12-18 11:58:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-12-18 11:58:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2502 transitions. [2019-12-18 11:58:45,059 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2502 transitions. Word has length 12 [2019-12-18 11:58:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:45,060 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 2502 transitions. [2019-12-18 11:58:45,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2502 transitions. [2019-12-18 11:58:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 11:58:45,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:45,062 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:45,062 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-18 11:58:45,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:45,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1243568347, now seen corresponding path program 1 times [2019-12-18 11:58:45,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:45,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869081390] [2019-12-18 11:58:45,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:45,088 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-18 11:58:45,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869081390] [2019-12-18 11:58:45,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:45,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:45,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781798785] [2019-12-18 11:58:45,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:45,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:45,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:45,090 INFO L87 Difference]: Start difference. First operand 732 states and 2502 transitions. Second operand 3 states. [2019-12-18 11:58:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:45,132 INFO L93 Difference]: Finished difference Result 1008 states and 3409 transitions. [2019-12-18 11:58:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:45,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 11:58:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:45,151 INFO L225 Difference]: With dead ends: 1008 [2019-12-18 11:58:45,151 INFO L226 Difference]: Without dead ends: 1008 [2019-12-18 11:58:45,151 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-18 11:58:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-18 11:58:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 868. [2019-12-18 11:58:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-18 11:58:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 3016 transitions. [2019-12-18 11:58:45,185 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 3016 transitions. Word has length 14 [2019-12-18 11:58:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:45,186 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 3016 transitions. [2019-12-18 11:58:45,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 3016 transitions. [2019-12-18 11:58:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:58:45,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:45,187 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:45,187 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-18 11:58:45,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash -104085370, now seen corresponding path program 1 times [2019-12-18 11:58:45,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:45,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585583506] [2019-12-18 11:58:45,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-18 11:58:45,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585583506] [2019-12-18 11:58:45,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:45,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:45,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093262387] [2019-12-18 11:58:45,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:45,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:45,232 INFO L87 Difference]: Start difference. First operand 868 states and 3016 transitions. Second operand 4 states. [2019-12-18 11:58:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:45,266 INFO L93 Difference]: Finished difference Result 728 states and 2483 transitions. [2019-12-18 11:58:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:45,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 11:58:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:45,271 INFO L225 Difference]: With dead ends: 728 [2019-12-18 11:58:45,271 INFO L226 Difference]: Without dead ends: 728 [2019-12-18 11:58:45,271 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-18 11:58:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-18 11:58:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 588. [2019-12-18 11:58:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-18 11:58:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1950 transitions. [2019-12-18 11:58:45,293 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1950 transitions. Word has length 15 [2019-12-18 11:58:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:45,293 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1950 transitions. [2019-12-18 11:58:45,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1950 transitions. [2019-12-18 11:58:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:58:45,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:45,294 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:45,295 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-18 11:58:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:45,295 INFO L82 PathProgramCache]: Analyzing trace with hash -104215289, now seen corresponding path program 1 times [2019-12-18 11:58:45,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:45,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544603099] [2019-12-18 11:58:45,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:45,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 11:58:45,329 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 11:58:45,329 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 11:58:45,329 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-18 11:58:45,338 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,338 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,339 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,339 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,339 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,339 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,339 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,339 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,339 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,340 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,340 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,340 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,340 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,340 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,340 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,341 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,341 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,341 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,341 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,341 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,341 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,341 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,342 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,342 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,342 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,342 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,342 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,343 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,343 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,343 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,343 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,343 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,343 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,354 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,355 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,355 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,355 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,355 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,357 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,357 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,357 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,357 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,358 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,358 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,360 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,362 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,362 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,362 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,362 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:45,365 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 11:58:45,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:58:45,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:58:45,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:58:45,366 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:58:45,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:58:45,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:58:45,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:58:45,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:58:45,367 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions [2019-12-18 11:58:45,367 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions [2019-12-18 11:58:45,386 INFO L126 PetriNetUnfolder]: 11/129 cut-off events. [2019-12-18 11:58:45,387 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:45,389 INFO L76 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs. 65/172 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-18 11:58:45,396 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions [2019-12-18 11:58:45,409 INFO L126 PetriNetUnfolder]: 11/129 cut-off events. [2019-12-18 11:58:45,410 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:45,412 INFO L76 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs. 65/172 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-18 11:58:45,421 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4320 [2019-12-18 11:58:45,421 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:58:46,482 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5838 [2019-12-18 11:58:46,483 INFO L214 etLargeBlockEncoding]: Total number of compositions: 65 [2019-12-18 11:58:46,483 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 25 transitions [2019-12-18 11:58:46,898 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6484 states. [2019-12-18 11:58:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states. [2019-12-18 11:58:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 11:58:46,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:46,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 11:58:46,901 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-18 11:58:46,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash 652705188, now seen corresponding path program 1 times [2019-12-18 11:58:46,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:46,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787356352] [2019-12-18 11:58:46,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:46,919 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-18 11:58:46,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787356352] [2019-12-18 11:58:46,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:46,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:46,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027967988] [2019-12-18 11:58:46,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:46,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:46,922 INFO L87 Difference]: Start difference. First operand 6484 states. Second operand 3 states. [2019-12-18 11:58:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:47,028 INFO L93 Difference]: Finished difference Result 7629 states and 32588 transitions. [2019-12-18 11:58:47,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:47,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 11:58:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:47,068 INFO L225 Difference]: With dead ends: 7629 [2019-12-18 11:58:47,068 INFO L226 Difference]: Without dead ends: 7629 [2019-12-18 11:58:47,069 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-18 11:58:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7629 states. [2019-12-18 11:58:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7629 to 6366. [2019-12-18 11:58:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6366 states. [2019-12-18 11:58:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6366 states to 6366 states and 28029 transitions. [2019-12-18 11:58:47,564 INFO L78 Accepts]: Start accepts. Automaton has 6366 states and 28029 transitions. Word has length 5 [2019-12-18 11:58:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:47,565 INFO L462 AbstractCegarLoop]: Abstraction has 6366 states and 28029 transitions. [2019-12-18 11:58:47,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6366 states and 28029 transitions. [2019-12-18 11:58:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 11:58:47,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:47,565 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:47,565 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-18 11:58:47,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1277107584, now seen corresponding path program 1 times [2019-12-18 11:58:47,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:47,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838175301] [2019-12-18 11:58:47,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:47,591 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-18 11:58:47,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838175301] [2019-12-18 11:58:47,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:47,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:47,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145060672] [2019-12-18 11:58:47,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:47,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:47,593 INFO L87 Difference]: Start difference. First operand 6366 states and 28029 transitions. Second operand 3 states. [2019-12-18 11:58:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:47,683 INFO L93 Difference]: Finished difference Result 9120 states and 39254 transitions. [2019-12-18 11:58:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:47,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-18 11:58:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:47,727 INFO L225 Difference]: With dead ends: 9120 [2019-12-18 11:58:47,728 INFO L226 Difference]: Without dead ends: 9120 [2019-12-18 11:58:47,728 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-18 11:58:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2019-12-18 11:58:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 7564. [2019-12-18 11:58:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-12-18 11:58:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 33556 transitions. [2019-12-18 11:58:48,726 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 33556 transitions. Word has length 8 [2019-12-18 11:58:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:48,726 INFO L462 AbstractCegarLoop]: Abstraction has 7564 states and 33556 transitions. [2019-12-18 11:58:48,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 33556 transitions. [2019-12-18 11:58:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:58:48,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:48,729 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:48,729 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-18 11:58:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash 935631175, now seen corresponding path program 1 times [2019-12-18 11:58:48,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:48,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464000554] [2019-12-18 11:58:48,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:48,752 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-18 11:58:48,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464000554] [2019-12-18 11:58:48,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:48,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:48,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703703343] [2019-12-18 11:58:48,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:48,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:48,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:48,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:48,754 INFO L87 Difference]: Start difference. First operand 7564 states and 33556 transitions. Second operand 4 states. [2019-12-18 11:58:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:48,836 INFO L93 Difference]: Finished difference Result 6008 states and 26302 transitions. [2019-12-18 11:58:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:48,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:58:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:48,864 INFO L225 Difference]: With dead ends: 6008 [2019-12-18 11:58:48,865 INFO L226 Difference]: Without dead ends: 6008 [2019-12-18 11:58:48,867 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-18 11:58:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2019-12-18 11:58:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 4771. [2019-12-18 11:58:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-12-18 11:58:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 20598 transitions. [2019-12-18 11:58:49,062 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 20598 transitions. Word has length 9 [2019-12-18 11:58:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:49,062 INFO L462 AbstractCegarLoop]: Abstraction has 4771 states and 20598 transitions. [2019-12-18 11:58:49,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 20598 transitions. [2019-12-18 11:58:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:58:49,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:49,063 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:49,063 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-18 11:58:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash 935633007, now seen corresponding path program 1 times [2019-12-18 11:58:49,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:49,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789299810] [2019-12-18 11:58:49,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:49,082 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-18 11:58:49,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789299810] [2019-12-18 11:58:49,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:49,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:49,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368273240] [2019-12-18 11:58:49,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:49,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:49,084 INFO L87 Difference]: Start difference. First operand 4771 states and 20598 transitions. Second operand 4 states. [2019-12-18 11:58:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:49,141 INFO L93 Difference]: Finished difference Result 3827 states and 16326 transitions. [2019-12-18 11:58:49,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:49,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:58:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:49,158 INFO L225 Difference]: With dead ends: 3827 [2019-12-18 11:58:49,158 INFO L226 Difference]: Without dead ends: 3827 [2019-12-18 11:58:49,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 11:58:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2019-12-18 11:58:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2883. [2019-12-18 11:58:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-12-18 11:58:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 12054 transitions. [2019-12-18 11:58:49,274 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 12054 transitions. Word has length 9 [2019-12-18 11:58:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:49,274 INFO L462 AbstractCegarLoop]: Abstraction has 2883 states and 12054 transitions. [2019-12-18 11:58:49,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 12054 transitions. [2019-12-18 11:58:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 11:58:49,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:49,275 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:49,275 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-18 11:58:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1346541726, now seen corresponding path program 1 times [2019-12-18 11:58:49,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:49,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544694725] [2019-12-18 11:58:49,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:49,291 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-18 11:58:49,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544694725] [2019-12-18 11:58:49,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:49,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:49,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220501910] [2019-12-18 11:58:49,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:49,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:49,293 INFO L87 Difference]: Start difference. First operand 2883 states and 12054 transitions. Second operand 3 states. [2019-12-18 11:58:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:49,447 INFO L93 Difference]: Finished difference Result 4275 states and 17545 transitions. [2019-12-18 11:58:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:49,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 11:58:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:49,465 INFO L225 Difference]: With dead ends: 4275 [2019-12-18 11:58:49,466 INFO L226 Difference]: Without dead ends: 4275 [2019-12-18 11:58:49,466 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-18 11:58:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-12-18 11:58:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3574. [2019-12-18 11:58:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-12-18 11:58:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 15125 transitions. [2019-12-18 11:58:49,576 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 15125 transitions. Word has length 11 [2019-12-18 11:58:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:49,577 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 15125 transitions. [2019-12-18 11:58:49,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 15125 transitions. [2019-12-18 11:58:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 11:58:49,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:49,577 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:49,578 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-18 11:58:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1206877661, now seen corresponding path program 1 times [2019-12-18 11:58:49,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:49,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738759053] [2019-12-18 11:58:49,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-18 11:58:49,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738759053] [2019-12-18 11:58:49,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:49,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:49,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227641823] [2019-12-18 11:58:49,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:49,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:49,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:49,603 INFO L87 Difference]: Start difference. First operand 3574 states and 15125 transitions. Second operand 4 states. [2019-12-18 11:58:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:49,650 INFO L93 Difference]: Finished difference Result 2873 states and 12004 transitions. [2019-12-18 11:58:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:49,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-18 11:58:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:49,664 INFO L225 Difference]: With dead ends: 2873 [2019-12-18 11:58:49,665 INFO L226 Difference]: Without dead ends: 2873 [2019-12-18 11:58:49,665 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-18 11:58:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2019-12-18 11:58:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2172. [2019-12-18 11:58:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2019-12-18 11:58:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 8883 transitions. [2019-12-18 11:58:49,732 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 8883 transitions. Word has length 12 [2019-12-18 11:58:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:49,732 INFO L462 AbstractCegarLoop]: Abstraction has 2172 states and 8883 transitions. [2019-12-18 11:58:49,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 8883 transitions. [2019-12-18 11:58:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 11:58:49,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:49,733 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:49,733 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-18 11:58:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:49,734 INFO L82 PathProgramCache]: Analyzing trace with hash -315974263, now seen corresponding path program 1 times [2019-12-18 11:58:49,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:49,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711830432] [2019-12-18 11:58:49,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:49,750 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-18 11:58:49,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711830432] [2019-12-18 11:58:49,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:49,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:49,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066299525] [2019-12-18 11:58:49,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:49,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:49,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:49,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:49,751 INFO L87 Difference]: Start difference. First operand 2172 states and 8883 transitions. Second operand 3 states. [2019-12-18 11:58:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:49,792 INFO L93 Difference]: Finished difference Result 3177 states and 12799 transitions. [2019-12-18 11:58:49,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:49,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 11:58:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:49,805 INFO L225 Difference]: With dead ends: 3177 [2019-12-18 11:58:49,805 INFO L226 Difference]: Without dead ends: 3177 [2019-12-18 11:58:49,805 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-18 11:58:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2019-12-18 11:58:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2671. [2019-12-18 11:58:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2019-12-18 11:58:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 11075 transitions. [2019-12-18 11:58:49,881 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 11075 transitions. Word has length 14 [2019-12-18 11:58:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:49,881 INFO L462 AbstractCegarLoop]: Abstraction has 2671 states and 11075 transitions. [2019-12-18 11:58:49,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 11075 transitions. [2019-12-18 11:58:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:58:49,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:49,882 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:49,882 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-18 11:58:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1205265918, now seen corresponding path program 1 times [2019-12-18 11:58:49,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:49,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734198750] [2019-12-18 11:58:49,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:49,901 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-18 11:58:49,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734198750] [2019-12-18 11:58:49,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:49,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:58:49,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366269073] [2019-12-18 11:58:49,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:58:49,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:49,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:58:49,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:58:49,903 INFO L87 Difference]: Start difference. First operand 2671 states and 11075 transitions. Second operand 4 states. [2019-12-18 11:58:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:49,945 INFO L93 Difference]: Finished difference Result 2165 states and 8845 transitions. [2019-12-18 11:58:49,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:49,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 11:58:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:49,955 INFO L225 Difference]: With dead ends: 2165 [2019-12-18 11:58:49,955 INFO L226 Difference]: Without dead ends: 2165 [2019-12-18 11:58:49,955 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-18 11:58:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2019-12-18 11:58:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1659. [2019-12-18 11:58:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-12-18 11:58:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 6615 transitions. [2019-12-18 11:58:50,002 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 6615 transitions. Word has length 15 [2019-12-18 11:58:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:50,002 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 6615 transitions. [2019-12-18 11:58:50,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:58:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 6615 transitions. [2019-12-18 11:58:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 11:58:50,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:50,003 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:50,003 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-18 11:58:50,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:50,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1240295411, now seen corresponding path program 1 times [2019-12-18 11:58:50,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:50,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831478387] [2019-12-18 11:58:50,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:50,018 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-18 11:58:50,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831478387] [2019-12-18 11:58:50,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:50,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:50,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772940459] [2019-12-18 11:58:50,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:50,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:50,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:50,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:50,020 INFO L87 Difference]: Start difference. First operand 1659 states and 6615 transitions. Second operand 3 states. [2019-12-18 11:58:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:50,055 INFO L93 Difference]: Finished difference Result 2295 states and 9088 transitions. [2019-12-18 11:58:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:50,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 11:58:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:50,063 INFO L225 Difference]: With dead ends: 2295 [2019-12-18 11:58:50,063 INFO L226 Difference]: Without dead ends: 2295 [2019-12-18 11:58:50,064 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-18 11:58:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2019-12-18 11:58:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1975. [2019-12-18 11:58:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-18 11:58:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 8000 transitions. [2019-12-18 11:58:50,158 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 8000 transitions. Word has length 17 [2019-12-18 11:58:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:50,158 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 8000 transitions. [2019-12-18 11:58:50,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 8000 transitions. [2019-12-18 11:58:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 11:58:50,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:50,161 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:50,161 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-18 11:58:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash -205702466, now seen corresponding path program 1 times [2019-12-18 11:58:50,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:50,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574880199] [2019-12-18 11:58:50,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:58:50,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 11:58:50,190 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 11:58:50,190 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 11:58:50,191 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-18 11:58:50,201 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,202 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,202 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,202 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,202 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,203 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,203 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,203 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,203 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,203 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,204 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,204 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,204 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,204 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,205 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,205 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,205 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,205 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,205 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,206 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,206 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,206 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,206 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,206 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,207 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,207 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,207 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,207 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,208 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,208 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,208 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,208 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,208 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,208 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,208 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,209 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,209 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,209 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,209 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,209 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,209 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,209 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,212 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,212 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,213 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,213 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,219 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,219 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,221 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,222 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,222 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,222 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,224 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,224 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,225 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,225 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,225 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,225 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,228 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,228 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,228 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,229 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,229 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,229 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,231 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,231 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,235 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,236 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,236 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,236 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:58:50,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 11:58:50,238 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:58:50,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:58:50,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:58:50,239 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:58:50,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:58:50,239 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:58:50,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:58:50,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:58:50,241 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 98 transitions [2019-12-18 11:58:50,241 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions [2019-12-18 11:58:50,259 INFO L126 PetriNetUnfolder]: 13/151 cut-off events. [2019-12-18 11:58:50,260 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:50,263 INFO L76 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs. 90/215 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-18 11:58:50,274 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions [2019-12-18 11:58:50,294 INFO L126 PetriNetUnfolder]: 13/151 cut-off events. [2019-12-18 11:58:50,294 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:58:50,298 INFO L76 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs. 90/215 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-18 11:58:50,308 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 6120 [2019-12-18 11:58:50,308 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:58:51,427 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8316 [2019-12-18 11:58:51,427 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2019-12-18 11:58:51,428 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 31 transitions [2019-12-18 11:58:54,862 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32404 states. [2019-12-18 11:58:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 32404 states. [2019-12-18 11:58:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 11:58:54,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:54,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 11:58:54,863 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-18 11:58:54,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash 837410524, now seen corresponding path program 1 times [2019-12-18 11:58:54,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:54,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658818291] [2019-12-18 11:58:54,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:54,875 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-18 11:58:54,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658818291] [2019-12-18 11:58:54,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:54,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:54,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307409086] [2019-12-18 11:58:54,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:54,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:54,876 INFO L87 Difference]: Start difference. First operand 32404 states. Second operand 3 states. [2019-12-18 11:58:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:58:55,171 INFO L93 Difference]: Finished difference Result 38316 states and 194259 transitions. [2019-12-18 11:58:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:58:55,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 11:58:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:58:55,294 INFO L225 Difference]: With dead ends: 38316 [2019-12-18 11:58:55,294 INFO L226 Difference]: Without dead ends: 38316 [2019-12-18 11:58:55,294 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-18 11:58:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38316 states. [2019-12-18 11:58:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38316 to 31940. [2019-12-18 11:58:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31940 states. [2019-12-18 11:58:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31940 states to 31940 states and 166174 transitions. [2019-12-18 11:58:57,963 INFO L78 Accepts]: Start accepts. Automaton has 31940 states and 166174 transitions. Word has length 5 [2019-12-18 11:58:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:58:57,963 INFO L462 AbstractCegarLoop]: Abstraction has 31940 states and 166174 transitions. [2019-12-18 11:58:57,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:58:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 31940 states and 166174 transitions. [2019-12-18 11:58:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 11:58:57,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:58:57,964 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:58:57,964 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-18 11:58:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:58:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1966218909, now seen corresponding path program 1 times [2019-12-18 11:58:57,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:58:57,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557745209] [2019-12-18 11:58:57,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:58:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:58:57,976 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-18 11:58:57,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557745209] [2019-12-18 11:58:57,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:58:57,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:58:57,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265529809] [2019-12-18 11:58:57,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:58:57,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:58:57,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:58:57,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:58:57,978 INFO L87 Difference]: Start difference. First operand 31940 states and 166174 transitions. Second operand 3 states. [2019-12-18 11:59:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:00,264 INFO L93 Difference]: Finished difference Result 46178 states and 235622 transitions. [2019-12-18 11:59:00,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:00,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-18 11:59:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:00,408 INFO L225 Difference]: With dead ends: 46178 [2019-12-18 11:59:00,408 INFO L226 Difference]: Without dead ends: 46178 [2019-12-18 11:59:00,408 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-18 11:59:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46178 states. [2019-12-18 11:59:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46178 to 38236. [2019-12-18 11:59:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38236 states. [2019-12-18 11:59:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38236 states to 38236 states and 200230 transitions. [2019-12-18 11:59:01,722 INFO L78 Accepts]: Start accepts. Automaton has 38236 states and 200230 transitions. Word has length 8 [2019-12-18 11:59:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:01,722 INFO L462 AbstractCegarLoop]: Abstraction has 38236 states and 200230 transitions. [2019-12-18 11:59:01,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:59:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 38236 states and 200230 transitions. [2019-12-18 11:59:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:59:01,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:01,723 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:01,723 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-18 11:59:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1411123806, now seen corresponding path program 1 times [2019-12-18 11:59:01,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:01,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042929841] [2019-12-18 11:59:01,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:01,749 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-18 11:59:01,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042929841] [2019-12-18 11:59:01,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:01,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:59:01,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466745731] [2019-12-18 11:59:01,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:59:01,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:59:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:59:01,751 INFO L87 Difference]: Start difference. First operand 38236 states and 200230 transitions. Second operand 4 states. [2019-12-18 11:59:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:02,467 INFO L93 Difference]: Finished difference Result 30294 states and 156896 transitions. [2019-12-18 11:59:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:02,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:59:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:02,560 INFO L225 Difference]: With dead ends: 30294 [2019-12-18 11:59:02,560 INFO L226 Difference]: Without dead ends: 30294 [2019-12-18 11:59:02,561 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-18 11:59:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30294 states. [2019-12-18 11:59:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30294 to 23950. [2019-12-18 11:59:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23950 states. [2019-12-18 11:59:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23950 states to 23950 states and 122597 transitions. [2019-12-18 11:59:05,786 INFO L78 Accepts]: Start accepts. Automaton has 23950 states and 122597 transitions. Word has length 9 [2019-12-18 11:59:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:05,786 INFO L462 AbstractCegarLoop]: Abstraction has 23950 states and 122597 transitions. [2019-12-18 11:59:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:59:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 23950 states and 122597 transitions. [2019-12-18 11:59:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:59:05,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:05,787 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:05,787 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-18 11:59:05,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:05,787 INFO L82 PathProgramCache]: Analyzing trace with hash 823246975, now seen corresponding path program 1 times [2019-12-18 11:59:05,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:05,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87596823] [2019-12-18 11:59:05,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:05,821 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-18 11:59:05,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87596823] [2019-12-18 11:59:05,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:05,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:59:05,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801866964] [2019-12-18 11:59:05,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:59:05,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:59:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:59:05,823 INFO L87 Difference]: Start difference. First operand 23950 states and 122597 transitions. Second operand 4 states. [2019-12-18 11:59:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:06,022 INFO L93 Difference]: Finished difference Result 19172 states and 97171 transitions. [2019-12-18 11:59:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:06,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 11:59:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:06,097 INFO L225 Difference]: With dead ends: 19172 [2019-12-18 11:59:06,097 INFO L226 Difference]: Without dead ends: 19172 [2019-12-18 11:59:06,097 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-18 11:59:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19172 states. [2019-12-18 11:59:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19172 to 14394. [2019-12-18 11:59:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14394 states. [2019-12-18 11:59:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14394 states to 14394 states and 71745 transitions. [2019-12-18 11:59:06,496 INFO L78 Accepts]: Start accepts. Automaton has 14394 states and 71745 transitions. Word has length 9 [2019-12-18 11:59:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:06,496 INFO L462 AbstractCegarLoop]: Abstraction has 14394 states and 71745 transitions. [2019-12-18 11:59:06,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:59:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 14394 states and 71745 transitions. [2019-12-18 11:59:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 11:59:06,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:06,497 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:06,497 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-18 11:59:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash 697229360, now seen corresponding path program 1 times [2019-12-18 11:59:06,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:06,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160728659] [2019-12-18 11:59:06,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:06,510 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-18 11:59:06,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160728659] [2019-12-18 11:59:06,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:06,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:59:06,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736843624] [2019-12-18 11:59:06,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:59:06,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:06,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:59:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:59:06,512 INFO L87 Difference]: Start difference. First operand 14394 states and 71745 transitions. Second operand 3 states. [2019-12-18 11:59:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:06,662 INFO L93 Difference]: Finished difference Result 22955 states and 113320 transitions. [2019-12-18 11:59:06,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:06,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 11:59:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:06,724 INFO L225 Difference]: With dead ends: 22955 [2019-12-18 11:59:06,725 INFO L226 Difference]: Without dead ends: 22955 [2019-12-18 11:59:06,725 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-18 11:59:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22955 states. [2019-12-18 11:59:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22955 to 17239. [2019-12-18 11:59:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17239 states. [2019-12-18 11:59:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17239 states to 17239 states and 86508 transitions. [2019-12-18 11:59:07,460 INFO L78 Accepts]: Start accepts. Automaton has 17239 states and 86508 transitions. Word has length 11 [2019-12-18 11:59:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:07,461 INFO L462 AbstractCegarLoop]: Abstraction has 17239 states and 86508 transitions. [2019-12-18 11:59:07,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:59:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 17239 states and 86508 transitions. [2019-12-18 11:59:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 11:59:07,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:07,462 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:07,462 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-18 11:59:07,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash 139276080, now seen corresponding path program 1 times [2019-12-18 11:59:07,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:07,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910305074] [2019-12-18 11:59:07,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:07,485 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-18 11:59:07,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910305074] [2019-12-18 11:59:07,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:07,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:59:07,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542487911] [2019-12-18 11:59:07,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:59:07,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:59:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:59:07,487 INFO L87 Difference]: Start difference. First operand 17239 states and 86508 transitions. Second operand 4 states. [2019-12-18 11:59:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:07,643 INFO L93 Difference]: Finished difference Result 14381 states and 71673 transitions. [2019-12-18 11:59:07,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:07,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-18 11:59:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:07,710 INFO L225 Difference]: With dead ends: 14381 [2019-12-18 11:59:07,711 INFO L226 Difference]: Without dead ends: 14381 [2019-12-18 11:59:07,711 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-18 11:59:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14381 states. [2019-12-18 11:59:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14381 to 11523. [2019-12-18 11:59:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11523 states. [2019-12-18 11:59:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11523 states to 11523 states and 56838 transitions. [2019-12-18 11:59:08,145 INFO L78 Accepts]: Start accepts. Automaton has 11523 states and 56838 transitions. Word has length 12 [2019-12-18 11:59:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:08,145 INFO L462 AbstractCegarLoop]: Abstraction has 11523 states and 56838 transitions. [2019-12-18 11:59:08,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:59:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11523 states and 56838 transitions. [2019-12-18 11:59:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 11:59:08,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:08,146 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:08,146 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-18 11:59:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:08,147 INFO L82 PathProgramCache]: Analyzing trace with hash 533949827, now seen corresponding path program 1 times [2019-12-18 11:59:08,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:08,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969671178] [2019-12-18 11:59:08,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:08,166 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-18 11:59:08,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969671178] [2019-12-18 11:59:08,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:08,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:59:08,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148877426] [2019-12-18 11:59:08,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:59:08,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:59:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:59:08,168 INFO L87 Difference]: Start difference. First operand 11523 states and 56838 transitions. Second operand 3 states. [2019-12-18 11:59:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:08,304 INFO L93 Difference]: Finished difference Result 17181 states and 83458 transitions. [2019-12-18 11:59:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:08,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 11:59:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:08,349 INFO L225 Difference]: With dead ends: 17181 [2019-12-18 11:59:08,349 INFO L226 Difference]: Without dead ends: 17181 [2019-12-18 11:59:08,349 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-18 11:59:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17181 states. [2019-12-18 11:59:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17181 to 14347. [2019-12-18 11:59:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-12-18 11:59:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 71535 transitions. [2019-12-18 11:59:08,918 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 71535 transitions. Word has length 14 [2019-12-18 11:59:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:08,918 INFO L462 AbstractCegarLoop]: Abstraction has 14347 states and 71535 transitions. [2019-12-18 11:59:08,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:59:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 71535 transitions. [2019-12-18 11:59:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:59:08,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:08,919 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:08,920 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-18 11:59:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash -627421727, now seen corresponding path program 1 times [2019-12-18 11:59:08,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:08,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818722106] [2019-12-18 11:59:08,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:08,951 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-18 11:59:08,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818722106] [2019-12-18 11:59:08,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:08,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:59:08,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745927181] [2019-12-18 11:59:08,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:59:08,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:59:08,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:59:08,953 INFO L87 Difference]: Start difference. First operand 14347 states and 71535 transitions. Second operand 4 states. [2019-12-18 11:59:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:09,040 INFO L93 Difference]: Finished difference Result 11513 states and 56778 transitions. [2019-12-18 11:59:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:09,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 11:59:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:09,069 INFO L225 Difference]: With dead ends: 11513 [2019-12-18 11:59:09,069 INFO L226 Difference]: Without dead ends: 11513 [2019-12-18 11:59:09,069 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-18 11:59:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11513 states. [2019-12-18 11:59:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11513 to 8679. [2019-12-18 11:59:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-12-18 11:59:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 42021 transitions. [2019-12-18 11:59:09,295 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 42021 transitions. Word has length 15 [2019-12-18 11:59:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:09,295 INFO L462 AbstractCegarLoop]: Abstraction has 8679 states and 42021 transitions. [2019-12-18 11:59:09,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:59:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 42021 transitions. [2019-12-18 11:59:09,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 11:59:09,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:09,296 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:09,297 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-18 11:59:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1825068028, now seen corresponding path program 1 times [2019-12-18 11:59:09,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:09,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654870858] [2019-12-18 11:59:09,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:09,321 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-18 11:59:09,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654870858] [2019-12-18 11:59:09,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:09,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:59:09,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068643814] [2019-12-18 11:59:09,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:59:09,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:59:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:59:09,323 INFO L87 Difference]: Start difference. First operand 8679 states and 42021 transitions. Second operand 3 states. [2019-12-18 11:59:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:09,414 INFO L93 Difference]: Finished difference Result 12762 states and 61063 transitions. [2019-12-18 11:59:09,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:09,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 11:59:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:09,446 INFO L225 Difference]: With dead ends: 12762 [2019-12-18 11:59:09,446 INFO L226 Difference]: Without dead ends: 12762 [2019-12-18 11:59:09,446 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-18 11:59:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-18 11:59:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 10717. [2019-12-18 11:59:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10717 states. [2019-12-18 11:59:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10717 states to 10717 states and 52542 transitions. [2019-12-18 11:59:09,683 INFO L78 Accepts]: Start accepts. Automaton has 10717 states and 52542 transitions. Word has length 17 [2019-12-18 11:59:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:09,684 INFO L462 AbstractCegarLoop]: Abstraction has 10717 states and 52542 transitions. [2019-12-18 11:59:09,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:59:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 10717 states and 52542 transitions. [2019-12-18 11:59:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 11:59:09,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:09,686 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:09,686 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-18 11:59:09,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:09,686 INFO L82 PathProgramCache]: Analyzing trace with hash -742531920, now seen corresponding path program 1 times [2019-12-18 11:59:09,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:09,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233073356] [2019-12-18 11:59:09,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:09,710 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-18 11:59:09,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233073356] [2019-12-18 11:59:09,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:09,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:59:09,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090693046] [2019-12-18 11:59:09,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 11:59:09,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 11:59:09,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 11:59:09,711 INFO L87 Difference]: Start difference. First operand 10717 states and 52542 transitions. Second operand 4 states. [2019-12-18 11:59:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:09,792 INFO L93 Difference]: Finished difference Result 8672 states and 41976 transitions. [2019-12-18 11:59:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:09,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 11:59:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:09,815 INFO L225 Difference]: With dead ends: 8672 [2019-12-18 11:59:09,815 INFO L226 Difference]: Without dead ends: 8672 [2019-12-18 11:59:09,815 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-18 11:59:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2019-12-18 11:59:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 6627. [2019-12-18 11:59:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6627 states. [2019-12-18 11:59:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 31410 transitions. [2019-12-18 11:59:09,960 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 31410 transitions. Word has length 18 [2019-12-18 11:59:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:09,960 INFO L462 AbstractCegarLoop]: Abstraction has 6627 states and 31410 transitions. [2019-12-18 11:59:09,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 11:59:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 31410 transitions. [2019-12-18 11:59:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 11:59:09,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:09,963 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:09,963 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-18 11:59:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash -766676883, now seen corresponding path program 1 times [2019-12-18 11:59:09,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:09,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339641879] [2019-12-18 11:59:09,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:59:09,991 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-18 11:59:09,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339641879] [2019-12-18 11:59:09,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:59:09,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:59:09,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532668200] [2019-12-18 11:59:09,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:59:09,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:59:09,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:59:09,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:59:09,992 INFO L87 Difference]: Start difference. First operand 6627 states and 31410 transitions. Second operand 3 states. [2019-12-18 11:59:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:59:10,075 INFO L93 Difference]: Finished difference Result 9207 states and 43429 transitions. [2019-12-18 11:59:10,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:59:10,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 11:59:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:59:10,098 INFO L225 Difference]: With dead ends: 9207 [2019-12-18 11:59:10,099 INFO L226 Difference]: Without dead ends: 9207 [2019-12-18 11:59:10,099 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-18 11:59:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9207 states. [2019-12-18 11:59:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9207 to 7915. [2019-12-18 11:59:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7915 states. [2019-12-18 11:59:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7915 states to 7915 states and 38052 transitions. [2019-12-18 11:59:10,336 INFO L78 Accepts]: Start accepts. Automaton has 7915 states and 38052 transitions. Word has length 20 [2019-12-18 11:59:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:59:10,337 INFO L462 AbstractCegarLoop]: Abstraction has 7915 states and 38052 transitions. [2019-12-18 11:59:10,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:59:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7915 states and 38052 transitions. [2019-12-18 11:59:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 11:59:10,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:59:10,340 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:59:10,340 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-18 11:59:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:59:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2002648867, now seen corresponding path program 1 times [2019-12-18 11:59:10,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:59:10,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518575433] [2019-12-18 11:59:10,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:59:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:59:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 11:59:10,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 11:59:10,359 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 11:59:10,359 WARN L364 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 11:59:10,359 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2019-12-18 11:59:10,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,380 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,380 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,381 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,381 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,381 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,382 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,382 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,382 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,382 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,382 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,382 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:59:10,405 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-18 11:59:10,406 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:59:10,406 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:59:10,406 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:59:10,406 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:59:10,406 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:59:10,406 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:59:10,406 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:59:10,406 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:59:10,408 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 111 transitions [2019-12-18 11:59:10,408 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions [2019-12-18 11:59:10,429 INFO L126 PetriNetUnfolder]: 15/173 cut-off events. [2019-12-18 11:59:10,429 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:59:10,434 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs. 119/262 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2019-12-18 11:59:10,448 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions [2019-12-18 11:59:10,470 INFO L126 PetriNetUnfolder]: 15/173 cut-off events. [2019-12-18 11:59:10,470 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:59:10,476 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs. 119/262 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2019-12-18 11:59:10,486 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8232 [2019-12-18 11:59:10,487 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:59:11,877 INFO L206 etLargeBlockEncoding]: Checked pairs total: 12130 [2019-12-18 11:59:11,877 INFO L214 etLargeBlockEncoding]: Total number of compositions: 88 [2019-12-18 11:59:11,877 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 37 transitions [2019-12-18 12:00:01,883 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160420 states. [2019-12-18 12:00:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 160420 states. [2019-12-18 12:00:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 12:00:01,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:00:01,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 12:00:01,884 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-18 12:00:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:00:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1044393949, now seen corresponding path program 1 times [2019-12-18 12:00:01,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:00:01,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069851896] [2019-12-18 12:00:01,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:00:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:00:01,902 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-18 12:00:01,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069851896] [2019-12-18 12:00:01,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:00:01,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:00:01,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995733668] [2019-12-18 12:00:01,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:00:01,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:00:01,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:00:01,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:00:01,905 INFO L87 Difference]: Start difference. First operand 160420 states. Second operand 3 states. [2019-12-18 12:00:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:00:08,733 INFO L93 Difference]: Finished difference Result 190005 states and 1117019 transitions. [2019-12-18 12:00:08,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:00:08,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 12:00:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:00:09,488 INFO L225 Difference]: With dead ends: 190005 [2019-12-18 12:00:09,488 INFO L226 Difference]: Without dead ends: 190005 [2019-12-18 12:00:09,488 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-18 12:00:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190005 states. [2019-12-18 12:00:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190005 to 158349. [2019-12-18 12:00:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158349 states. [2019-12-18 12:00:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158349 states to 158349 states and 952006 transitions. [2019-12-18 12:00:20,033 INFO L78 Accepts]: Start accepts. Automaton has 158349 states and 952006 transitions. Word has length 5 [2019-12-18 12:00:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:00:20,033 INFO L462 AbstractCegarLoop]: Abstraction has 158349 states and 952006 transitions. [2019-12-18 12:00:20,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:00:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 158349 states and 952006 transitions. [2019-12-18 12:00:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 12:00:20,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:00:20,034 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 12:00:20,034 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-18 12:00:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:00:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash 610026521, now seen corresponding path program 1 times [2019-12-18 12:00:20,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:00:20,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382482879] [2019-12-18 12:00:20,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:00:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:00:20,049 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-18 12:00:20,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382482879] [2019-12-18 12:00:20,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:00:20,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:00:20,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993650979] [2019-12-18 12:00:20,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:00:20,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:00:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:00:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:00:20,050 INFO L87 Difference]: Start difference. First operand 158349 states and 952006 transitions. Second operand 3 states. [2019-12-18 12:00:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:00:29,562 INFO L93 Difference]: Finished difference Result 246811 states and 1468819 transitions. [2019-12-18 12:00:29,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:00:29,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-18 12:00:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:00:32,184 INFO L225 Difference]: With dead ends: 246811 [2019-12-18 12:00:32,184 INFO L226 Difference]: Without dead ends: 246811 [2019-12-18 12:00:32,184 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-18 12:00:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246811 states. [2019-12-18 12:00:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246811 to 183575. [2019-12-18 12:00:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183575 states. [2019-12-18 12:00:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183575 states to 183575 states and 1107523 transitions. [2019-12-18 12:00:56,384 INFO L78 Accepts]: Start accepts. Automaton has 183575 states and 1107523 transitions. Word has length 8 [2019-12-18 12:00:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:00:56,384 INFO L462 AbstractCegarLoop]: Abstraction has 183575 states and 1107523 transitions. [2019-12-18 12:00:56,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:00:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 183575 states and 1107523 transitions. [2019-12-18 12:00:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 12:00:56,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:00:56,384 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:00:56,385 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-18 12:00:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:00:56,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1165029829, now seen corresponding path program 1 times [2019-12-18 12:00:56,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:00:56,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906576244] [2019-12-18 12:00:56,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:00:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:00:56,416 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-18 12:00:56,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906576244] [2019-12-18 12:00:56,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:00:56,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:00:56,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479870916] [2019-12-18 12:00:56,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:00:56,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:00:56,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:00:56,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:00:56,418 INFO L87 Difference]: Start difference. First operand 183575 states and 1107523 transitions. Second operand 4 states. [2019-12-18 12:01:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:01:05,333 INFO L93 Difference]: Finished difference Result 145622 states and 870444 transitions. [2019-12-18 12:01:05,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:01:05,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 12:01:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:01:05,878 INFO L225 Difference]: With dead ends: 145622 [2019-12-18 12:01:05,878 INFO L226 Difference]: Without dead ends: 145622 [2019-12-18 12:01:05,878 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-18 12:01:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145622 states. [2019-12-18 12:01:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145622 to 114004. [2019-12-18 12:01:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114004 states. [2019-12-18 12:01:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114004 states to 114004 states and 673987 transitions. [2019-12-18 12:01:12,539 INFO L78 Accepts]: Start accepts. Automaton has 114004 states and 673987 transitions. Word has length 9 [2019-12-18 12:01:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:01:12,540 INFO L462 AbstractCegarLoop]: Abstraction has 114004 states and 673987 transitions. [2019-12-18 12:01:12,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:01:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 114004 states and 673987 transitions. [2019-12-18 12:01:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 12:01:12,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:01:12,540 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:01:12,540 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-18 12:01:12,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:01:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1730955589, now seen corresponding path program 1 times [2019-12-18 12:01:12,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:01:12,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282334136] [2019-12-18 12:01:12,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:01:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:01:12,564 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-18 12:01:12,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282334136] [2019-12-18 12:01:12,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:01:12,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:01:12,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542278236] [2019-12-18 12:01:12,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:01:12,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:01:12,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:01:12,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:01:12,565 INFO L87 Difference]: Start difference. First operand 114004 states and 673987 transitions. Second operand 4 states. [2019-12-18 12:01:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:01:13,239 INFO L93 Difference]: Finished difference Result 95018 states and 558562 transitions. [2019-12-18 12:01:13,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:01:13,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-18 12:01:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:01:19,907 INFO L225 Difference]: With dead ends: 95018 [2019-12-18 12:01:19,908 INFO L226 Difference]: Without dead ends: 95018 [2019-12-18 12:01:19,908 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-18 12:01:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95018 states. [2019-12-18 12:01:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95018 to 76032. [2019-12-18 12:01:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76032 states. [2019-12-18 12:01:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76032 states to 76032 states and 443137 transitions. [2019-12-18 12:01:23,355 INFO L78 Accepts]: Start accepts. Automaton has 76032 states and 443137 transitions. Word has length 9 [2019-12-18 12:01:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:01:23,355 INFO L462 AbstractCegarLoop]: Abstraction has 76032 states and 443137 transitions. [2019-12-18 12:01:23,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:01:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 76032 states and 443137 transitions. [2019-12-18 12:01:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:01:23,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:01:23,355 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-12-18 12:01:23,355 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-18 12:01:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:01:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1101646248, now seen corresponding path program 1 times [2019-12-18 12:01:23,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:01:23,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241329032] [2019-12-18 12:01:23,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:01:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:01:23,368 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-18 12:01:23,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241329032] [2019-12-18 12:01:23,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:01:23,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:01:23,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554388573] [2019-12-18 12:01:23,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:01:23,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:01:23,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:01:23,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:01:23,370 INFO L87 Difference]: Start difference. First operand 76032 states and 443137 transitions. Second operand 3 states. [2019-12-18 12:01:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:01:25,180 INFO L93 Difference]: Finished difference Result 113976 states and 654880 transitions. [2019-12-18 12:01:25,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:01:25,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 12:01:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:01:25,583 INFO L225 Difference]: With dead ends: 113976 [2019-12-18 12:01:25,583 INFO L226 Difference]: Without dead ends: 113976 [2019-12-18 12:01:25,583 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-18 12:01:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113976 states. [2019-12-18 12:01:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113976 to 94996. [2019-12-18 12:01:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94996 states. [2019-12-18 12:01:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94996 states to 94996 states and 558450 transitions. [2019-12-18 12:01:34,426 INFO L78 Accepts]: Start accepts. Automaton has 94996 states and 558450 transitions. Word has length 11 [2019-12-18 12:01:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:01:34,427 INFO L462 AbstractCegarLoop]: Abstraction has 94996 states and 558450 transitions. [2019-12-18 12:01:34,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:01:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 94996 states and 558450 transitions. [2019-12-18 12:01:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 12:01:34,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:01:34,428 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:01:34,428 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-18 12:01:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:01:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash -208702148, now seen corresponding path program 1 times [2019-12-18 12:01:34,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:01:34,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514564241] [2019-12-18 12:01:34,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:01:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:01:34,451 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-18 12:01:34,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514564241] [2019-12-18 12:01:34,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:01:34,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:01:34,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752781593] [2019-12-18 12:01:34,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:01:34,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:01:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:01:34,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:01:34,453 INFO L87 Difference]: Start difference. First operand 94996 states and 558450 transitions. Second operand 4 states. [2019-12-18 12:01:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:01:36,017 INFO L93 Difference]: Finished difference Result 76016 states and 443040 transitions. [2019-12-18 12:01:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:01:36,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-18 12:01:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:01:36,291 INFO L225 Difference]: With dead ends: 76016 [2019-12-18 12:01:36,291 INFO L226 Difference]: Without dead ends: 76016 [2019-12-18 12:01:36,291 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-18 12:01:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76016 states. [2019-12-18 12:01:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76016 to 57036. [2019-12-18 12:01:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57036 states. [2019-12-18 12:01:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57036 states to 57036 states and 327630 transitions. [2019-12-18 12:01:44,188 INFO L78 Accepts]: Start accepts. Automaton has 57036 states and 327630 transitions. Word has length 12 [2019-12-18 12:01:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:01:44,188 INFO L462 AbstractCegarLoop]: Abstraction has 57036 states and 327630 transitions. [2019-12-18 12:01:44,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:01:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 57036 states and 327630 transitions. [2019-12-18 12:01:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:01:44,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:01:44,189 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:01:44,189 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-18 12:01:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:01:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1111906441, now seen corresponding path program 1 times [2019-12-18 12:01:44,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:01:44,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805244611] [2019-12-18 12:01:44,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:01:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:01:44,211 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-18 12:01:44,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805244611] [2019-12-18 12:01:44,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:01:44,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:01:44,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175017156] [2019-12-18 12:01:44,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:01:44,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:01:44,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:01:44,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:01:44,213 INFO L87 Difference]: Start difference. First operand 57036 states and 327630 transitions. Second operand 3 states. [2019-12-18 12:01:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:01:44,734 INFO L93 Difference]: Finished difference Result 85437 states and 483874 transitions. [2019-12-18 12:01:44,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:01:44,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 12:01:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:01:45,016 INFO L225 Difference]: With dead ends: 85437 [2019-12-18 12:01:45,016 INFO L226 Difference]: Without dead ends: 85437 [2019-12-18 12:01:45,017 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-18 12:01:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85437 states. [2019-12-18 12:01:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85437 to 71230. [2019-12-18 12:01:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71230 states. [2019-12-18 12:01:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71230 states to 71230 states and 412813 transitions. [2019-12-18 12:01:53,162 INFO L78 Accepts]: Start accepts. Automaton has 71230 states and 412813 transitions. Word has length 14 [2019-12-18 12:01:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:01:53,163 INFO L462 AbstractCegarLoop]: Abstraction has 71230 states and 412813 transitions. [2019-12-18 12:01:53,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:01:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 71230 states and 412813 transitions. [2019-12-18 12:01:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:01:53,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:01:53,163 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:01:53,164 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-18 12:01:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:01:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash 109363834, now seen corresponding path program 1 times [2019-12-18 12:01:53,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:01:53,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670143824] [2019-12-18 12:01:53,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:01:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:01:53,183 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-18 12:01:53,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670143824] [2019-12-18 12:01:53,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:01:53,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:01:53,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214566071] [2019-12-18 12:01:53,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:01:53,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:01:53,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:01:53,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:01:53,185 INFO L87 Difference]: Start difference. First operand 71230 states and 412813 transitions. Second operand 4 states. [2019-12-18 12:01:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:01:53,609 INFO L93 Difference]: Finished difference Result 57023 states and 327545 transitions. [2019-12-18 12:01:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:01:53,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 12:01:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:01:53,800 INFO L225 Difference]: With dead ends: 57023 [2019-12-18 12:01:53,800 INFO L226 Difference]: Without dead ends: 57023 [2019-12-18 12:01:53,800 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-18 12:01:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57023 states. [2019-12-18 12:01:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57023 to 42816. [2019-12-18 12:01:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42816 states. [2019-12-18 12:01:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42816 states to 42816 states and 242277 transitions. [2019-12-18 12:01:55,790 INFO L78 Accepts]: Start accepts. Automaton has 42816 states and 242277 transitions. Word has length 15 [2019-12-18 12:01:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:01:55,790 INFO L462 AbstractCegarLoop]: Abstraction has 42816 states and 242277 transitions. [2019-12-18 12:01:55,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:01:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 42816 states and 242277 transitions. [2019-12-18 12:01:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 12:01:55,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:01:55,792 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:01:55,792 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:01:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:01:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1837133616, now seen corresponding path program 1 times [2019-12-18 12:01:55,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:01:55,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307484969] [2019-12-18 12:01:55,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:01:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2019-12-18 12:01:56,489 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-18 12:01:56,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307484969] [2019-12-18 12:01:56,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:01:56,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:01:56,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119486874] [2019-12-18 12:01:56,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:01:56,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:01:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:01:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:01:56,491 INFO L87 Difference]: Start difference. First operand 42816 states and 242277 transitions. Second operand 3 states. [2019-12-18 12:01:56,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 12:01:56,492 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 12:01:56,496 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 12:01:56,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:01:56 BasicIcfg [2019-12-18 12:01:56,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:01:56,499 INFO L168 Benchmark]: Toolchain (without parser) took 198644.32 ms. Allocated memory was 145.8 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 102.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 12:01:56,499 INFO L168 Benchmark]: CDTParser took 1.66 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 12:01:56,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.43 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 102.1 MB in the beginning and 164.0 MB in the end (delta: -61.9 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:01:56,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 203.9 MB. Free memory was 164.0 MB in the beginning and 162.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:01:56,500 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 203.9 MB. Free memory was 162.1 MB in the beginning and 160.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:01:56,501 INFO L168 Benchmark]: RCFGBuilder took 378.14 ms. Allocated memory is still 203.9 MB. Free memory was 160.7 MB in the beginning and 145.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:01:56,501 INFO L168 Benchmark]: TraceAbstraction took 197558.06 ms. Allocated memory was 203.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 144.7 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 12:01:56,503 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 631.43 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 102.1 MB in the beginning and 164.0 MB in the end (delta: -61.9 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 203.9 MB. Free memory was 164.0 MB in the beginning and 162.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 203.9 MB. Free memory was 162.1 MB in the beginning and 160.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 378.14 ms. Allocated memory is still 203.9 MB. Free memory was 160.7 MB in the beginning and 145.3 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197558.06 ms. Allocated memory was 203.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 144.7 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.9 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.7s, 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, 2 SemBasedMoverChecksPositive, 18 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 964 CheckedPairsTotal, 35 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 62 ProgramPointsBefore, 20 ProgramPointsAfterwards, 59 TransitionsBefore, 17 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 4 ChoiceCompositions, 889 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2078 CheckedPairsTotal, 45 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 72 TransitionsBefore, 23 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 1517 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3457 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.1s, 90 ProgramPointsBefore, 30 ProgramPointsAfterwards, 85 TransitionsBefore, 25 TransitionsAfterwards, 4320 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 6 ChoiceCompositions, 2342 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 0 MoverChecksTotal, 5838 CheckedPairsTotal, 65 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.1s, 104 ProgramPointsBefore, 36 ProgramPointsAfterwards, 98 TransitionsBefore, 31 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 3289 VarBasedMoverChecksPositive, 81 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 0 MoverChecksTotal, 8316 CheckedPairsTotal, 76 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 111 TransitionsBefore, 37 TransitionsAfterwards, 8232 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 6 ChoiceCompositions, 4493 VarBasedMoverChecksPositive, 128 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 83 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 0 MoverChecksTotal, 12130 CheckedPairsTotal, 88 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (42816states) and FLOYD_HOARE automaton (currently 2 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Result: TIMEOUT, OverallTime: 166.0s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 41.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, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 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.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 211870 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 1347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 76/76 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