/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 15:58:22,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 15:58:22,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 15:58:22,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 15:58:22,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 15:58:22,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 15:58:22,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 15:58:22,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 15:58:22,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 15:58:22,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 15:58:22,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 15:58:22,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 15:58:22,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 15:58:22,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 15:58:22,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 15:58:22,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 15:58:22,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 15:58:22,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 15:58:22,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 15:58:22,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 15:58:22,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 15:58:22,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 15:58:22,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 15:58:22,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 15:58:22,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 15:58:22,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 15:58:22,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 15:58:22,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 15:58:22,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 15:58:22,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 15:58:22,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 15:58:22,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 15:58:22,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 15:58:22,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 15:58:22,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 15:58:22,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 15:58:22,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 15:58:22,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 15:58:22,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 15:58:22,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 15:58:22,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 15:58:22,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-McrStrategy.epf [2020-04-18 15:58:22,387 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 15:58:22,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 15:58:22,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 15:58:22,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 15:58:22,389 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 15:58:22,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 15:58:22,390 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 15:58:22,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 15:58:22,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 15:58:22,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 15:58:22,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 15:58:22,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 15:58:22,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 15:58:22,391 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 15:58:22,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 15:58:22,391 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 15:58:22,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 15:58:22,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 15:58:22,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 15:58:22,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 15:58:22,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 15:58:22,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 15:58:22,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 15:58:22,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 15:58:22,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 15:58:22,394 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 15:58:22,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 15:58:22,394 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-04-18 15:58:22,394 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 15:58:22,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 15:58:22,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 15:58:22,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 15:58:22,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 15:58:22,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 15:58:22,706 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 15:58:22,706 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 15:58:22,707 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i [2020-04-18 15:58:22,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b689e813/14276823fea045cd9f3c065bd3247924/FLAGb6497a5ef [2020-04-18 15:58:23,357 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 15:58:23,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i [2020-04-18 15:58:23,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b689e813/14276823fea045cd9f3c065bd3247924/FLAGb6497a5ef [2020-04-18 15:58:23,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b689e813/14276823fea045cd9f3c065bd3247924 [2020-04-18 15:58:23,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 15:58:23,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 15:58:23,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 15:58:23,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 15:58:23,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 15:58:23,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:58:23" (1/1) ... [2020-04-18 15:58:23,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3b978a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:23, skipping insertion in model container [2020-04-18 15:58:23,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:58:23" (1/1) ... [2020-04-18 15:58:23,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 15:58:23,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 15:58:24,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 15:58:24,144 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 15:58:24,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 15:58:24,304 INFO L208 MainTranslator]: Completed translation [2020-04-18 15:58:24,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24 WrapperNode [2020-04-18 15:58:24,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 15:58:24,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 15:58:24,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 15:58:24,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 15:58:24,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 15:58:24,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 15:58:24,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 15:58:24,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 15:58:24,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (1/1) ... [2020-04-18 15:58:24,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 15:58:24,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 15:58:24,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 15:58:24,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 15:58:24,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (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 [2020-04-18 15:58:24,527 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-04-18 15:58:24,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-04-18 15:58:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-04-18 15:58:24,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-04-18 15:58:24,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 15:58:24,529 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-18 15:58:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 15:58:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 15:58:24,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 15:58:24,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 15:58:24,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 15:58:24,533 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 15:58:24,998 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 15:58:24,999 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-04-18 15:58:25,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:58:25 BoogieIcfgContainer [2020-04-18 15:58:25,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 15:58:25,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 15:58:25,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 15:58:25,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 15:58:25,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:58:23" (1/3) ... [2020-04-18 15:58:25,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7540fe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:58:25, skipping insertion in model container [2020-04-18 15:58:25,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:24" (2/3) ... [2020-04-18 15:58:25,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7540fe33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:58:25, skipping insertion in model container [2020-04-18 15:58:25,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:58:25" (3/3) ... [2020-04-18 15:58:25,012 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2020-04-18 15:58:25,023 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 15:58:25,023 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 15:58:25,032 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 15:58:25,033 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 15:58:25,062 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,063 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,063 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,064 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,064 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,064 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,064 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,065 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,065 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,065 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,066 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,066 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,066 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,066 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,067 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,067 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,067 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,069 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,069 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,070 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,070 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,070 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,071 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,071 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,071 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,071 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,072 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,072 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,076 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,076 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,077 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,077 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,077 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,077 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,078 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,078 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,078 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,078 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,086 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,086 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:25,105 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-04-18 15:58:25,128 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:58:25,129 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:58:25,129 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:58:25,129 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:58:25,129 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:58:25,129 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:58:25,130 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:58:25,130 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:58:25,148 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 76 transitions, 162 flow [2020-04-18 15:58:25,150 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 76 transitions, 162 flow [2020-04-18 15:58:25,204 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2020-04-18 15:58:25,204 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 15:58:25,213 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2020-04-18 15:58:25,218 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 76 transitions, 162 flow [2020-04-18 15:58:25,265 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2020-04-18 15:58:25,265 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 15:58:25,267 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2020-04-18 15:58:25,271 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1242 [2020-04-18 15:58:25,276 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:58:26,888 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-04-18 15:58:27,345 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-04-18 15:58:27,865 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-04-18 15:58:28,381 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 15:58:28,538 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:58:28,545 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1089 [2020-04-18 15:58:28,546 INFO L214 etLargeBlockEncoding]: Total number of compositions: 77 [2020-04-18 15:58:28,555 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-04-18 15:58:28,567 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-04-18 15:58:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-04-18 15:58:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:58:28,577 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:28,578 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:58:28,579 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash 313215, now seen corresponding path program 1 times [2020-04-18 15:58:28,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:28,595 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1706641040] [2020-04-18 15:58:28,612 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:28,626 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:58:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:58:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:58:28,629 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash 313215, now seen corresponding path program 2 times [2020-04-18 15:58:28,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:28,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506072104] [2020-04-18 15:58:28,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:28,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506072104] [2020-04-18 15:58:28,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:28,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:58:28,949 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:28,950 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:28,952 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:58:28,955 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:28,975 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:28,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:28,982 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:58:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:28,987 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:58:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:58:28,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:28,988 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1706641040] [2020-04-18 15:58:28,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:28,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:58:28,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1706641040] [2020-04-18 15:58:28,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:58:28,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:28,997 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-04-18 15:58:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:29,025 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-04-18 15:58:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:58:29,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:58:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:29,037 INFO L225 Difference]: With dead ends: 35 [2020-04-18 15:58:29,037 INFO L226 Difference]: Without dead ends: 31 [2020-04-18 15:58:29,039 INFO L678 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 [2020-04-18 15:58:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-04-18 15:58:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-04-18 15:58:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-04-18 15:58:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-04-18 15:58:29,092 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-04-18 15:58:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:29,093 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-04-18 15:58:29,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:58:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-04-18 15:58:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 15:58:29,095 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:29,095 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:29,096 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583995, now seen corresponding path program 1 times [2020-04-18 15:58:29,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:29,097 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2050179747] [2020-04-18 15:58:29,100 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:29,103 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 15 transitions. [2020-04-18 15:58:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 15:58:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 15:58:29,105 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583485, now seen corresponding path program 2 times [2020-04-18 15:58:29,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:29,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225233330] [2020-04-18 15:58:29,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:29,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225233330] [2020-04-18 15:58:29,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:29,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:29,208 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:29,209 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:29,213 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 13 transitions. [2020-04-18 15:58:29,214 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:29,237 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:58:29,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:29,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:29,239 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 5 states. [2020-04-18 15:58:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:29,259 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 15:58:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 15:58:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 15:58:29,260 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583995, now seen corresponding path program 3 times [2020-04-18 15:58:29,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:29,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496213449] [2020-04-18 15:58:29,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:29,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496213449] [2020-04-18 15:58:29,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:29,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:29,414 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:29,415 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:29,418 INFO L259 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-04-18 15:58:29,418 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:29,435 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 15:58:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 15:58:29,436 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2020-04-18 15:58:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:29,449 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 15:58:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 15:58:29,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:29,450 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2050179747] [2020-04-18 15:58:29,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:29,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 15:58:29,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2050179747] [2020-04-18 15:58:29,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 15:58:29,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:29,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:58:29,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 15:58:29,452 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 6 states. [2020-04-18 15:58:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:29,533 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-04-18 15:58:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:58:29,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-04-18 15:58:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:29,535 INFO L225 Difference]: With dead ends: 26 [2020-04-18 15:58:29,535 INFO L226 Difference]: Without dead ends: 24 [2020-04-18 15:58:29,537 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-04-18 15:58:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-04-18 15:58:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-04-18 15:58:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-04-18 15:58:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-04-18 15:58:29,541 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-04-18 15:58:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:29,541 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-04-18 15:58:29,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 15:58:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-04-18 15:58:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 15:58:29,542 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:29,542 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:29,543 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:29,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1811562961, now seen corresponding path program 1 times [2020-04-18 15:58:29,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:29,544 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1399955871] [2020-04-18 15:58:29,544 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:29,545 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 15:58:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 15:58:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 15:58:29,545 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1811562961, now seen corresponding path program 2 times [2020-04-18 15:58:29,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:29,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622803293] [2020-04-18 15:58:29,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:58:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:58:29,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:58:29,608 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:58:29,608 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:58:29,609 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:58:29,610 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 15:58:29,610 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-04-18 15:58:29,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,634 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,634 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,634 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,634 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,634 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,635 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,637 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,637 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,637 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,638 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,638 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,638 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,638 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,638 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,638 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,639 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,640 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,641 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,641 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,641 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,641 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,641 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,642 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,642 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,643 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,643 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,643 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,643 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:29,644 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-04-18 15:58:29,644 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:58:29,644 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:58:29,645 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:58:29,645 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:58:29,645 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:58:29,645 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:58:29,645 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:58:29,645 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:58:29,647 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 105 transitions, 234 flow [2020-04-18 15:58:29,647 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 234 flow [2020-04-18 15:58:29,674 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2020-04-18 15:58:29,674 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 15:58:29,676 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2020-04-18 15:58:29,681 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 234 flow [2020-04-18 15:58:29,705 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2020-04-18 15:58:29,705 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 15:58:29,707 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2020-04-18 15:58:29,711 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2844 [2020-04-18 15:58:29,712 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:58:31,584 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-04-18 15:58:31,953 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2020-04-18 15:58:32,309 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 15:58:32,432 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:58:32,439 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3611 [2020-04-18 15:58:32,439 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2020-04-18 15:58:32,439 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 28 transitions, 80 flow [2020-04-18 15:58:32,469 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 632 states. [2020-04-18 15:58:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states. [2020-04-18 15:58:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:58:32,470 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:32,470 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:58:32,471 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:32,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash 544994, now seen corresponding path program 1 times [2020-04-18 15:58:32,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:32,472 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1073745275] [2020-04-18 15:58:32,472 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:32,473 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:58:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:58:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:58:32,473 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash 544994, now seen corresponding path program 2 times [2020-04-18 15:58:32,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:32,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566591599] [2020-04-18 15:58:32,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:32,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566591599] [2020-04-18 15:58:32,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:32,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:58:32,508 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:32,509 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:32,510 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:58:32,511 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:32,521 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:32,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:32,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:32,522 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:58:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:32,522 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:58:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:58:32,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:32,523 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1073745275] [2020-04-18 15:58:32,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:32,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:58:32,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1073745275] [2020-04-18 15:58:32,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:58:32,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:32,529 INFO L87 Difference]: Start difference. First operand 632 states. Second operand 3 states. [2020-04-18 15:58:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:32,604 INFO L93 Difference]: Finished difference Result 748 states and 2357 transitions. [2020-04-18 15:58:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:58:32,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:58:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:32,619 INFO L225 Difference]: With dead ends: 748 [2020-04-18 15:58:32,619 INFO L226 Difference]: Without dead ends: 691 [2020-04-18 15:58:32,619 INFO L678 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 [2020-04-18 15:58:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2020-04-18 15:58:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 612. [2020-04-18 15:58:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-04-18 15:58:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1968 transitions. [2020-04-18 15:58:32,694 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1968 transitions. Word has length 3 [2020-04-18 15:58:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:32,695 INFO L479 AbstractCegarLoop]: Abstraction has 612 states and 1968 transitions. [2020-04-18 15:58:32,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:58:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1968 transitions. [2020-04-18 15:58:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:58:32,696 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:32,696 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:32,696 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash 625478199, now seen corresponding path program 1 times [2020-04-18 15:58:32,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:32,697 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1899159911] [2020-04-18 15:58:32,697 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:32,698 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 15:58:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 15:58:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:58:32,699 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash 625478199, now seen corresponding path program 2 times [2020-04-18 15:58:32,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:32,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274049951] [2020-04-18 15:58:32,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:32,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274049951] [2020-04-18 15:58:32,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:32,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:32,777 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:32,778 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:32,779 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 15:58:32,780 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:32,793 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:32,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:32,794 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-04-18 15:58:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:32,825 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-04-18 15:58:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-04-18 15:58:32,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:32,825 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1899159911] [2020-04-18 15:58:32,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:32,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:32,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1899159911] [2020-04-18 15:58:32,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:58:32,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:32,827 INFO L87 Difference]: Start difference. First operand 612 states and 1968 transitions. Second operand 5 states. [2020-04-18 15:58:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:32,919 INFO L93 Difference]: Finished difference Result 900 states and 2708 transitions. [2020-04-18 15:58:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:58:32,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 15:58:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:32,928 INFO L225 Difference]: With dead ends: 900 [2020-04-18 15:58:32,928 INFO L226 Difference]: Without dead ends: 880 [2020-04-18 15:58:32,928 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-04-18 15:58:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 563. [2020-04-18 15:58:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2020-04-18 15:58:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1857 transitions. [2020-04-18 15:58:32,972 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1857 transitions. Word has length 10 [2020-04-18 15:58:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:32,973 INFO L479 AbstractCegarLoop]: Abstraction has 563 states and 1857 transitions. [2020-04-18 15:58:32,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:58:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1857 transitions. [2020-04-18 15:58:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:58:32,975 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:32,975 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:32,976 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:32,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:32,976 INFO L82 PathProgramCache]: Analyzing trace with hash -696224660, now seen corresponding path program 1 times [2020-04-18 15:58:32,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:32,977 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1781296402] [2020-04-18 15:58:32,977 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:32,978 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 15:58:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 15:58:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:58:32,979 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash -696224660, now seen corresponding path program 2 times [2020-04-18 15:58:32,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:32,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798888825] [2020-04-18 15:58:32,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:58:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:58:33,016 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:58:33,016 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:58:33,016 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:58:33,017 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:58:33,017 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 15:58:33,019 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-04-18 15:58:33,033 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,033 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,033 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,034 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,034 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,034 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,034 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,035 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,035 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,035 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,035 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,035 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,035 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,036 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,036 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,036 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,036 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,036 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,036 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,037 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,037 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,037 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,037 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,037 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,038 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,038 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,038 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,038 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,038 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,038 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,038 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,039 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,039 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,039 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,039 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,039 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,039 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,039 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,040 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,040 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,040 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,040 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,040 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,041 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,043 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,043 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,043 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,043 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,043 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,043 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,043 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,043 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,044 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,045 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,045 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,045 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,045 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,045 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,045 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,045 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,045 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,046 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,046 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,046 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,046 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,046 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,046 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,046 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,047 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,047 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,047 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,047 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,047 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,047 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,048 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,048 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,048 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,048 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,050 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,050 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,050 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,050 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,050 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,050 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,050 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,051 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,051 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,051 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,052 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,053 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,053 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,053 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,053 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,053 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,053 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,053 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,054 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,054 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,055 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,055 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,055 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,056 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,056 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,056 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,057 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,058 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,058 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,058 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,058 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,058 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,060 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,060 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,060 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,060 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,061 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,061 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:33,062 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-04-18 15:58:33,062 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:58:33,063 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:58:33,063 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:58:33,063 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:58:33,063 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:58:33,063 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:58:33,063 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:58:33,063 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:58:33,065 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 134 transitions, 310 flow [2020-04-18 15:58:33,065 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 310 flow [2020-04-18 15:58:33,092 INFO L129 PetriNetUnfolder]: 12/154 cut-off events. [2020-04-18 15:58:33,092 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 15:58:33,095 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 154 events. 12/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2020-04-18 15:58:33,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 310 flow [2020-04-18 15:58:33,126 INFO L129 PetriNetUnfolder]: 12/154 cut-off events. [2020-04-18 15:58:33,126 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 15:58:33,128 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 154 events. 12/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2020-04-18 15:58:33,134 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5130 [2020-04-18 15:58:33,134 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:58:35,687 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-04-18 15:58:35,850 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2020-04-18 15:58:36,557 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 15:58:36,702 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:58:36,712 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7576 [2020-04-18 15:58:36,712 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2020-04-18 15:58:36,713 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 38 transitions, 118 flow [2020-04-18 15:58:36,959 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3782 states. [2020-04-18 15:58:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states. [2020-04-18 15:58:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:58:36,959 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:36,960 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:58:36,960 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:36,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:36,960 INFO L82 PathProgramCache]: Analyzing trace with hash 833041, now seen corresponding path program 1 times [2020-04-18 15:58:36,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:36,961 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [944535416] [2020-04-18 15:58:36,961 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:36,962 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:58:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:58:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:58:36,962 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash 833041, now seen corresponding path program 2 times [2020-04-18 15:58:36,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:36,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056505047] [2020-04-18 15:58:36,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:37,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056505047] [2020-04-18 15:58:37,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:37,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:58:37,010 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:37,010 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:37,011 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:58:37,011 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:37,017 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:37,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:37,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:37,018 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:58:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:37,019 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:58:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:58:37,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:37,019 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [944535416] [2020-04-18 15:58:37,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:37,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:58:37,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [944535416] [2020-04-18 15:58:37,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:58:37,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:37,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:37,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:37,021 INFO L87 Difference]: Start difference. First operand 3782 states. Second operand 3 states. [2020-04-18 15:58:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:37,132 INFO L93 Difference]: Finished difference Result 4669 states and 19397 transitions. [2020-04-18 15:58:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:58:37,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:58:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:37,182 INFO L225 Difference]: With dead ends: 4669 [2020-04-18 15:58:37,183 INFO L226 Difference]: Without dead ends: 4342 [2020-04-18 15:58:37,183 INFO L678 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 [2020-04-18 15:58:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2020-04-18 15:58:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3858. [2020-04-18 15:58:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2020-04-18 15:58:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 16290 transitions. [2020-04-18 15:58:37,400 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 16290 transitions. Word has length 3 [2020-04-18 15:58:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:37,400 INFO L479 AbstractCegarLoop]: Abstraction has 3858 states and 16290 transitions. [2020-04-18 15:58:37,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:58:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 16290 transitions. [2020-04-18 15:58:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:58:37,401 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:37,401 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:37,402 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash -642397451, now seen corresponding path program 1 times [2020-04-18 15:58:37,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:37,402 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1224927455] [2020-04-18 15:58:37,403 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:37,404 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 15:58:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 15:58:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:58:37,406 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash -887292407, now seen corresponding path program 2 times [2020-04-18 15:58:37,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:37,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723075424] [2020-04-18 15:58:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:37,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723075424] [2020-04-18 15:58:37,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:37,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:37,442 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:37,443 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:37,445 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 15:58:37,445 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:37,451 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:37,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:37,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:37,452 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 15:58:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:37,459 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:58:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:58:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:58:37,460 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash -642397451, now seen corresponding path program 3 times [2020-04-18 15:58:37,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:37,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500940754] [2020-04-18 15:58:37,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:37,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500940754] [2020-04-18 15:58:37,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:37,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:37,619 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:37,620 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:37,621 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 15:58:37,622 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:37,638 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:37,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:37,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:37,639 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 15:58:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:37,678 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:58:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:58:37,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:37,680 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1224927455] [2020-04-18 15:58:37,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:37,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:37,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1224927455] [2020-04-18 15:58:37,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:58:37,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:37,682 INFO L87 Difference]: Start difference. First operand 3858 states and 16290 transitions. Second operand 5 states. [2020-04-18 15:58:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:37,879 INFO L93 Difference]: Finished difference Result 6408 states and 25485 transitions. [2020-04-18 15:58:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:58:37,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 15:58:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:37,967 INFO L225 Difference]: With dead ends: 6408 [2020-04-18 15:58:37,967 INFO L226 Difference]: Without dead ends: 6352 [2020-04-18 15:58:37,968 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2020-04-18 15:58:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 3890. [2020-04-18 15:58:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3890 states. [2020-04-18 15:58:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 16721 transitions. [2020-04-18 15:58:38,208 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 16721 transitions. Word has length 10 [2020-04-18 15:58:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:38,208 INFO L479 AbstractCegarLoop]: Abstraction has 3890 states and 16721 transitions. [2020-04-18 15:58:38,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:58:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 16721 transitions. [2020-04-18 15:58:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:58:38,211 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:38,212 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:38,213 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:38,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:38,213 INFO L82 PathProgramCache]: Analyzing trace with hash -834312959, now seen corresponding path program 1 times [2020-04-18 15:58:38,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:38,216 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [584068145] [2020-04-18 15:58:38,217 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:38,218 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 15:58:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 15:58:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:58:38,220 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash 291634045, now seen corresponding path program 2 times [2020-04-18 15:58:38,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:38,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811156058] [2020-04-18 15:58:38,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:38,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811156058] [2020-04-18 15:58:38,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:38,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:38,253 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:38,255 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:38,259 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 15:58:38,259 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:38,266 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:38,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:38,267 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 15:58:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:38,272 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 15:58:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 15:58:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:58:38,272 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash -834312959, now seen corresponding path program 3 times [2020-04-18 15:58:38,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:38,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483910421] [2020-04-18 15:58:38,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:38,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483910421] [2020-04-18 15:58:38,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:38,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:38,326 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:38,327 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:38,331 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 15:58:38,331 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:38,344 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:38,345 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 15:58:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:38,376 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 15:58:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 15:58:38,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:38,377 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [584068145] [2020-04-18 15:58:38,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:38,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:38,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [584068145] [2020-04-18 15:58:38,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:58:38,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:38,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:38,378 INFO L87 Difference]: Start difference. First operand 3890 states and 16721 transitions. Second operand 5 states. [2020-04-18 15:58:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:38,606 INFO L93 Difference]: Finished difference Result 6754 states and 26605 transitions. [2020-04-18 15:58:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:58:38,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 15:58:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:38,650 INFO L225 Difference]: With dead ends: 6754 [2020-04-18 15:58:38,650 INFO L226 Difference]: Without dead ends: 6698 [2020-04-18 15:58:38,651 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2020-04-18 15:58:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 3876. [2020-04-18 15:58:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3876 states. [2020-04-18 15:58:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 16342 transitions. [2020-04-18 15:58:38,992 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 16342 transitions. Word has length 14 [2020-04-18 15:58:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:38,992 INFO L479 AbstractCegarLoop]: Abstraction has 3876 states and 16342 transitions. [2020-04-18 15:58:38,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:58:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 16342 transitions. [2020-04-18 15:58:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:58:38,994 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:38,995 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:38,995 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1249108271, now seen corresponding path program 1 times [2020-04-18 15:58:38,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:38,996 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2120269813] [2020-04-18 15:58:38,997 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:39,000 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 15:58:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 15:58:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:58:39,002 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1668101585, now seen corresponding path program 2 times [2020-04-18 15:58:39,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:39,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140822850] [2020-04-18 15:58:39,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:39,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140822850] [2020-04-18 15:58:39,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:39,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:39,027 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:39,029 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:39,044 INFO L259 McrAutomatonBuilder]: Finished intersection with 52 states and 94 transitions. [2020-04-18 15:58:39,045 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:39,054 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:39,055 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 15:58:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:39,070 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 15:58:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 15:58:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:58:39,071 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1831618405, now seen corresponding path program 3 times [2020-04-18 15:58:39,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:39,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58267163] [2020-04-18 15:58:39,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:39,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58267163] [2020-04-18 15:58:39,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:39,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:39,109 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:39,111 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:39,117 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-04-18 15:58:39,117 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:39,148 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:58:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:58:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:39,149 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 15:58:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:39,211 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 15:58:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 15:58:39,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:39,212 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2120269813] [2020-04-18 15:58:39,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:39,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:39,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2120269813] [2020-04-18 15:58:39,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 15:58:39,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:58:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 15:58:39,213 INFO L87 Difference]: Start difference. First operand 3876 states and 16342 transitions. Second operand 7 states. [2020-04-18 15:58:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:39,686 INFO L93 Difference]: Finished difference Result 3088 states and 8648 transitions. [2020-04-18 15:58:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 15:58:39,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 15:58:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:39,701 INFO L225 Difference]: With dead ends: 3088 [2020-04-18 15:58:39,701 INFO L226 Difference]: Without dead ends: 3088 [2020-04-18 15:58:39,702 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-04-18 15:58:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2020-04-18 15:58:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 1610. [2020-04-18 15:58:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2020-04-18 15:58:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 4847 transitions. [2020-04-18 15:58:39,778 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 4847 transitions. Word has length 17 [2020-04-18 15:58:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:39,779 INFO L479 AbstractCegarLoop]: Abstraction has 1610 states and 4847 transitions. [2020-04-18 15:58:39,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 15:58:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 4847 transitions. [2020-04-18 15:58:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:39,780 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:39,780 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:39,780 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 229330979, now seen corresponding path program 1 times [2020-04-18 15:58:39,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:39,783 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1357063666] [2020-04-18 15:58:39,784 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:39,785 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 15:58:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 15:58:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:39,788 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2035634917, now seen corresponding path program 2 times [2020-04-18 15:58:39,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:39,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776847854] [2020-04-18 15:58:39,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:39,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776847854] [2020-04-18 15:58:39,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:39,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:39,819 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:39,822 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:39,830 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions. [2020-04-18 15:58:39,830 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:39,837 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:39,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:39,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:39,837 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 15:58:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:39,847 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 15:58:39,847 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 15:58:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:39,848 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:39,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1261580793, now seen corresponding path program 3 times [2020-04-18 15:58:39,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:39,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967994980] [2020-04-18 15:58:39,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:39,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967994980] [2020-04-18 15:58:39,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:39,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:58:39,898 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:39,902 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:39,909 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 15:58:39,909 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:39,924 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:39,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:39,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:39,925 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 5 states. [2020-04-18 15:58:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:39,978 INFO L93 Difference]: Finished difference Result 121 states and 225 transitions. [2020-04-18 15:58:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 225 transitions. [2020-04-18 15:58:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:39,979 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:58:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:39,979 INFO L82 PathProgramCache]: Analyzing trace with hash 229330979, now seen corresponding path program 4 times [2020-04-18 15:58:39,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:39,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613302843] [2020-04-18 15:58:39,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:40,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613302843] [2020-04-18 15:58:40,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124767535] [2020-04-18 15:58:40,081 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 15:58:40,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 15:58:40,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 15:58:40,187 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 15:58:40,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 15:58:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:40,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 15:58:40,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 15:58:40,263 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:40,265 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:40,358 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 15:58:40,359 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:40,461 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:40,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 15:58:40,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 15:58:40,462 INFO L87 Difference]: Start difference. First operand 121 states and 225 transitions. Second operand 12 states. [2020-04-18 15:58:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:40,644 INFO L93 Difference]: Finished difference Result 123 states and 226 transitions. [2020-04-18 15:58:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2020-04-18 15:58:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:40,645 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:58:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2129177993, now seen corresponding path program 5 times [2020-04-18 15:58:40,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:40,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91609896] [2020-04-18 15:58:40,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:40,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91609896] [2020-04-18 15:58:40,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:40,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:40,677 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:40,680 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:40,684 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 15:58:40,684 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:40,698 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:40,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:40,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 15:58:40,699 INFO L87 Difference]: Start difference. First operand 123 states and 226 transitions. Second operand 3 states. [2020-04-18 15:58:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:40,706 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 15:58:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 15:58:40,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:40,707 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1357063666] [2020-04-18 15:58:40,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:40,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:40,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1357063666] [2020-04-18 15:58:40,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 15:58:40,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:40,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 15:58:40,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 15:58:40,709 INFO L87 Difference]: Start difference. First operand 1610 states and 4847 transitions. Second operand 13 states. [2020-04-18 15:58:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:41,238 INFO L93 Difference]: Finished difference Result 2817 states and 8005 transitions. [2020-04-18 15:58:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 15:58:41,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 15:58:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:41,247 INFO L225 Difference]: With dead ends: 2817 [2020-04-18 15:58:41,248 INFO L226 Difference]: Without dead ends: 2796 [2020-04-18 15:58:41,248 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 15:58:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2020-04-18 15:58:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 1515. [2020-04-18 15:58:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2020-04-18 15:58:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 4566 transitions. [2020-04-18 15:58:41,313 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 4566 transitions. Word has length 18 [2020-04-18 15:58:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:41,314 INFO L479 AbstractCegarLoop]: Abstraction has 1515 states and 4566 transitions. [2020-04-18 15:58:41,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 15:58:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 4566 transitions. [2020-04-18 15:58:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:41,316 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:41,316 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:41,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 15:58:41,522 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:41,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:41,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1406801102, now seen corresponding path program 1 times [2020-04-18 15:58:41,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:41,523 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [300339406] [2020-04-18 15:58:41,523 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:41,524 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 15:58:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 15:58:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:41,525 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash 171542214, now seen corresponding path program 2 times [2020-04-18 15:58:41,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:41,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185817533] [2020-04-18 15:58:41,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:41,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185817533] [2020-04-18 15:58:41,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:41,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:41,550 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:41,552 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:41,559 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 95 transitions. [2020-04-18 15:58:41,560 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:41,567 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:41,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:41,567 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 15:58:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:41,577 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 15:58:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 15:58:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:41,578 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash 945596338, now seen corresponding path program 3 times [2020-04-18 15:58:41,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:41,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963483594] [2020-04-18 15:58:41,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:41,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963483594] [2020-04-18 15:58:41,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:41,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:41,608 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:41,610 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:41,616 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 15:58:41,616 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:41,650 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:58:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:58:41,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:41,651 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 6 states. [2020-04-18 15:58:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:41,730 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-04-18 15:58:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2020-04-18 15:58:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:41,731 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:58:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1270613072, now seen corresponding path program 4 times [2020-04-18 15:58:41,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:41,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489859002] [2020-04-18 15:58:41,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:41,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489859002] [2020-04-18 15:58:41,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:41,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:58:41,780 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:41,782 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:41,786 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:58:41,786 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:41,811 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:41,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:41,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 15:58:41,812 INFO L87 Difference]: Start difference. First operand 103 states and 192 transitions. Second operand 5 states. [2020-04-18 15:58:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:41,876 INFO L93 Difference]: Finished difference Result 116 states and 204 transitions. [2020-04-18 15:58:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 204 transitions. [2020-04-18 15:58:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:41,877 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:58:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1406801102, now seen corresponding path program 5 times [2020-04-18 15:58:41,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:41,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993295242] [2020-04-18 15:58:41,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:41,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993295242] [2020-04-18 15:58:41,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:41,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 15:58:41,933 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:41,936 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:41,940 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:58:41,940 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:41,969 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:58:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:58:41,970 INFO L87 Difference]: Start difference. First operand 116 states and 204 transitions. Second operand 7 states. [2020-04-18 15:58:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:42,081 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2020-04-18 15:58:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 205 transitions. [2020-04-18 15:58:42,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:42,082 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [300339406] [2020-04-18 15:58:42,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:42,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 15:58:42,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [300339406] [2020-04-18 15:58:42,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 15:58:42,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:42,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 15:58:42,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 15:58:42,084 INFO L87 Difference]: Start difference. First operand 1515 states and 4566 transitions. Second operand 11 states. [2020-04-18 15:58:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:43,156 INFO L93 Difference]: Finished difference Result 3265 states and 8876 transitions. [2020-04-18 15:58:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-04-18 15:58:43,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-04-18 15:58:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:43,167 INFO L225 Difference]: With dead ends: 3265 [2020-04-18 15:58:43,168 INFO L226 Difference]: Without dead ends: 3232 [2020-04-18 15:58:43,169 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 15:58:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2020-04-18 15:58:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1205. [2020-04-18 15:58:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2020-04-18 15:58:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 3518 transitions. [2020-04-18 15:58:43,224 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 3518 transitions. Word has length 18 [2020-04-18 15:58:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:43,224 INFO L479 AbstractCegarLoop]: Abstraction has 1205 states and 3518 transitions. [2020-04-18 15:58:43,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 15:58:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 3518 transitions. [2020-04-18 15:58:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:43,225 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:43,226 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:43,226 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1086137922, now seen corresponding path program 1 times [2020-04-18 15:58:43,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:43,227 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1674963925] [2020-04-18 15:58:43,227 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:43,228 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 15:58:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 15:58:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:43,229 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1594234652, now seen corresponding path program 2 times [2020-04-18 15:58:43,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:43,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498577429] [2020-04-18 15:58:43,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:58:43,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498577429] [2020-04-18 15:58:43,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:43,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:43,261 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:43,264 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:43,268 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 15:58:43,268 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:43,277 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:43,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:43,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:43,278 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 15:58:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:43,282 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 15:58:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 15:58:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:43,283 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1086137922, now seen corresponding path program 3 times [2020-04-18 15:58:43,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:43,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925024486] [2020-04-18 15:58:43,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:58:43,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925024486] [2020-04-18 15:58:43,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:43,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:43,339 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:43,342 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:43,345 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:58:43,346 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:43,359 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:43,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:43,360 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 15:58:43,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:43,386 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 15:58:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 15:58:43,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:43,387 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1674963925] [2020-04-18 15:58:43,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:43,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:43,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1674963925] [2020-04-18 15:58:43,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:58:43,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:43,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:43,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:43,388 INFO L87 Difference]: Start difference. First operand 1205 states and 3518 transitions. Second operand 5 states. [2020-04-18 15:58:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:43,481 INFO L93 Difference]: Finished difference Result 2245 states and 6476 transitions. [2020-04-18 15:58:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:58:43,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 15:58:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:43,489 INFO L225 Difference]: With dead ends: 2245 [2020-04-18 15:58:43,490 INFO L226 Difference]: Without dead ends: 2233 [2020-04-18 15:58:43,490 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2020-04-18 15:58:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1434. [2020-04-18 15:58:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2020-04-18 15:58:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 4291 transitions. [2020-04-18 15:58:43,540 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 4291 transitions. Word has length 18 [2020-04-18 15:58:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:43,541 INFO L479 AbstractCegarLoop]: Abstraction has 1434 states and 4291 transitions. [2020-04-18 15:58:43,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:58:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 4291 transitions. [2020-04-18 15:58:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:43,542 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:43,542 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:43,542 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:58:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1078743820, now seen corresponding path program 1 times [2020-04-18 15:58:43,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:43,543 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [305760233] [2020-04-18 15:58:43,544 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:43,544 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:58:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 15:58:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:43,545 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:43,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:43,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1078743820, now seen corresponding path program 2 times [2020-04-18 15:58:43,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:43,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418949859] [2020-04-18 15:58:43,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:58:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:58:43,594 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:58:43,595 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:58:43,595 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:58:43,595 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:58:43,596 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 15:58:43,597 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-04-18 15:58:43,616 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,616 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,616 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,616 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,616 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,617 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,617 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,617 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,617 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,617 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,618 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,619 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,619 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,620 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,620 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,620 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,620 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,620 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,620 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,621 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,621 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,622 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,622 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,623 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,623 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,624 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,624 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,629 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,629 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,630 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,630 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,630 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,630 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,631 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,634 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,634 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,634 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,636 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,637 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,637 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,637 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,637 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,637 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,637 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,644 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,644 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,644 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,645 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,646 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,647 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,647 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,647 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,647 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,647 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,648 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,648 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,648 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,648 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,648 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,649 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,649 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,649 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,649 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,649 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,649 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,649 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,650 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,650 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,652 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,652 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,653 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,653 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,653 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,653 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,654 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,654 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,654 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,654 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,656 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,657 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,657 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,657 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,657 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,657 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,658 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,658 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,660 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,661 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,662 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,662 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,662 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,662 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,668 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,668 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,668 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,670 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,671 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,671 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,671 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,671 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,671 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,673 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,673 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,674 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,674 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,674 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,674 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:43,676 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-04-18 15:58:43,677 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:58:43,677 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:58:43,677 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:58:43,677 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:58:43,677 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:58:43,677 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:58:43,677 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:58:43,677 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:58:43,680 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 163 transitions, 390 flow [2020-04-18 15:58:43,680 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 163 transitions, 390 flow [2020-04-18 15:58:43,714 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2020-04-18 15:58:43,714 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 15:58:43,717 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 15/188 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 208. Up to 10 conditions per place. [2020-04-18 15:58:43,727 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 163 transitions, 390 flow [2020-04-18 15:58:43,754 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2020-04-18 15:58:43,755 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 15:58:43,757 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 15/188 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 208. Up to 10 conditions per place. [2020-04-18 15:58:43,767 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8100 [2020-04-18 15:58:43,767 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:58:47,252 WARN L192 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2020-04-18 15:58:48,381 WARN L192 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2020-04-18 15:58:48,935 WARN L192 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-04-18 15:58:49,307 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 97 [2020-04-18 15:58:49,469 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:58:49,475 INFO L206 etLargeBlockEncoding]: Checked pairs total: 11405 [2020-04-18 15:58:49,475 INFO L214 etLargeBlockEncoding]: Total number of compositions: 148 [2020-04-18 15:58:49,476 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 45 transitions, 154 flow [2020-04-18 15:58:50,372 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13592 states. [2020-04-18 15:58:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13592 states. [2020-04-18 15:58:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:58:50,373 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:50,373 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:58:50,373 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1179639, now seen corresponding path program 1 times [2020-04-18 15:58:50,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:50,374 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1959649201] [2020-04-18 15:58:50,374 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:50,374 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:58:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:58:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:58:50,375 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1179639, now seen corresponding path program 2 times [2020-04-18 15:58:50,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:50,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352979604] [2020-04-18 15:58:50,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:50,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352979604] [2020-04-18 15:58:50,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:50,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:58:50,407 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:50,407 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:50,407 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:58:50,408 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:50,412 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:50,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:50,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:50,413 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:58:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:50,413 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:58:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:58:50,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:50,414 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1959649201] [2020-04-18 15:58:50,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:50,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:58:50,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1959649201] [2020-04-18 15:58:50,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:58:50,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:50,415 INFO L87 Difference]: Start difference. First operand 13592 states. Second operand 3 states. [2020-04-18 15:58:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:50,627 INFO L93 Difference]: Finished difference Result 15456 states and 79163 transitions. [2020-04-18 15:58:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:58:50,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:58:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:50,717 INFO L225 Difference]: With dead ends: 15456 [2020-04-18 15:58:50,717 INFO L226 Difference]: Without dead ends: 14450 [2020-04-18 15:58:50,717 INFO L678 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 [2020-04-18 15:58:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14450 states. [2020-04-18 15:58:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14450 to 13395. [2020-04-18 15:58:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13395 states. [2020-04-18 15:58:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13395 states to 13395 states and 69324 transitions. [2020-04-18 15:58:52,071 INFO L78 Accepts]: Start accepts. Automaton has 13395 states and 69324 transitions. Word has length 3 [2020-04-18 15:58:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:52,071 INFO L479 AbstractCegarLoop]: Abstraction has 13395 states and 69324 transitions. [2020-04-18 15:58:52,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:58:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 13395 states and 69324 transitions. [2020-04-18 15:58:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:58:52,071 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:52,072 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:52,072 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:52,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1279109383, now seen corresponding path program 1 times [2020-04-18 15:58:52,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:52,072 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [136926686] [2020-04-18 15:58:52,073 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:52,073 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 15:58:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 15:58:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:58:52,073 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash 697816649, now seen corresponding path program 2 times [2020-04-18 15:58:52,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:52,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691203] [2020-04-18 15:58:52,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:52,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691203] [2020-04-18 15:58:52,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:52,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:52,105 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:52,105 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:52,106 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 15:58:52,107 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:52,114 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:58:52,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:52,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:52,114 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 15:58:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:52,120 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:58:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:58:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:58:52,120 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:52,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1279109383, now seen corresponding path program 3 times [2020-04-18 15:58:52,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:52,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039894004] [2020-04-18 15:58:52,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:58:52,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039894004] [2020-04-18 15:58:52,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:52,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:52,157 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:52,158 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:52,159 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 15:58:52,159 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:52,170 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:52,171 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 15:58:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:52,195 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:58:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:58:52,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:52,195 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [136926686] [2020-04-18 15:58:52,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:52,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:52,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [136926686] [2020-04-18 15:58:52,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:58:52,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:52,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:52,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:52,197 INFO L87 Difference]: Start difference. First operand 13395 states and 69324 transitions. Second operand 5 states. [2020-04-18 15:58:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:52,475 INFO L93 Difference]: Finished difference Result 23586 states and 116096 transitions. [2020-04-18 15:58:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:58:52,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 15:58:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:53,760 INFO L225 Difference]: With dead ends: 23586 [2020-04-18 15:58:53,761 INFO L226 Difference]: Without dead ends: 23544 [2020-04-18 15:58:53,763 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23544 states. [2020-04-18 15:58:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23544 to 14448. [2020-04-18 15:58:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14448 states. [2020-04-18 15:58:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14448 states to 14448 states and 75696 transitions. [2020-04-18 15:58:54,540 INFO L78 Accepts]: Start accepts. Automaton has 14448 states and 75696 transitions. Word has length 10 [2020-04-18 15:58:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:54,540 INFO L479 AbstractCegarLoop]: Abstraction has 14448 states and 75696 transitions. [2020-04-18 15:58:54,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:58:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 14448 states and 75696 transitions. [2020-04-18 15:58:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:58:54,541 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:54,541 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:54,541 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash -284604684, now seen corresponding path program 1 times [2020-04-18 15:58:54,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:54,542 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [108606999] [2020-04-18 15:58:54,543 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:54,543 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 15:58:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 15:58:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:58:54,544 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1762132626, now seen corresponding path program 2 times [2020-04-18 15:58:54,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:54,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389434609] [2020-04-18 15:58:54,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:54,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389434609] [2020-04-18 15:58:54,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:54,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:54,565 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:54,566 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:54,568 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 15:58:54,569 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:54,574 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:58:54,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:54,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:54,574 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 15:58:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:54,578 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 15:58:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 15:58:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:58:54,579 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash -284604684, now seen corresponding path program 3 times [2020-04-18 15:58:54,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:54,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463148297] [2020-04-18 15:58:54,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:54,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463148297] [2020-04-18 15:58:54,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:54,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:54,620 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:54,621 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:54,623 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 15:58:54,623 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:54,635 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:54,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:54,636 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 15:58:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:54,661 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 15:58:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 15:58:54,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:54,662 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [108606999] [2020-04-18 15:58:54,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:54,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:54,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [108606999] [2020-04-18 15:58:54,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:58:54,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:54,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:54,664 INFO L87 Difference]: Start difference. First operand 14448 states and 75696 transitions. Second operand 5 states. [2020-04-18 15:58:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:55,591 INFO L93 Difference]: Finished difference Result 25978 states and 129320 transitions. [2020-04-18 15:58:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:58:55,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 15:58:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:55,718 INFO L225 Difference]: With dead ends: 25978 [2020-04-18 15:58:55,719 INFO L226 Difference]: Without dead ends: 25910 [2020-04-18 15:58:55,719 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25910 states. [2020-04-18 15:58:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25910 to 15939. [2020-04-18 15:58:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15939 states. [2020-04-18 15:58:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15939 states to 15939 states and 84384 transitions. [2020-04-18 15:58:56,735 INFO L78 Accepts]: Start accepts. Automaton has 15939 states and 84384 transitions. Word has length 14 [2020-04-18 15:58:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:56,736 INFO L479 AbstractCegarLoop]: Abstraction has 15939 states and 84384 transitions. [2020-04-18 15:58:56,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:58:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15939 states and 84384 transitions. [2020-04-18 15:58:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:58:56,738 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:56,738 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:56,739 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash -391482428, now seen corresponding path program 1 times [2020-04-18 15:58:56,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:56,740 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1353729551] [2020-04-18 15:58:56,741 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:56,742 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 15:58:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 15:58:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:58:56,744 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:56,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1693335464, now seen corresponding path program 2 times [2020-04-18 15:58:56,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:56,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843779301] [2020-04-18 15:58:56,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:56,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843779301] [2020-04-18 15:58:56,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:56,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:56,789 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:56,791 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:56,798 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 46 transitions. [2020-04-18 15:58:56,798 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:56,806 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:58:56,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:56,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:56,807 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 15:58:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:56,826 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 15:58:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 15:58:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:58:56,827 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash -391561118, now seen corresponding path program 3 times [2020-04-18 15:58:56,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:56,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203427890] [2020-04-18 15:58:56,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:56,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203427890] [2020-04-18 15:58:56,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:56,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:56,866 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:56,868 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:56,872 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 25 transitions. [2020-04-18 15:58:56,872 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:56,907 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:58:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:58:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:56,908 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 15:58:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:56,988 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 15:58:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 15:58:56,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:56,989 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1353729551] [2020-04-18 15:58:56,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:56,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:56,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1353729551] [2020-04-18 15:58:56,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 15:58:56,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:58:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-04-18 15:58:56,990 INFO L87 Difference]: Start difference. First operand 15939 states and 84384 transitions. Second operand 7 states. [2020-04-18 15:58:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:57,704 INFO L93 Difference]: Finished difference Result 6334 states and 17238 transitions. [2020-04-18 15:58:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 15:58:57,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 15:58:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:57,715 INFO L225 Difference]: With dead ends: 6334 [2020-04-18 15:58:57,715 INFO L226 Difference]: Without dead ends: 6334 [2020-04-18 15:58:57,715 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 15:58:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6334 states. [2020-04-18 15:58:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6334 to 3357. [2020-04-18 15:58:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3357 states. [2020-04-18 15:58:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 9797 transitions. [2020-04-18 15:58:57,826 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 9797 transitions. Word has length 17 [2020-04-18 15:58:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:57,826 INFO L479 AbstractCegarLoop]: Abstraction has 3357 states and 9797 transitions. [2020-04-18 15:58:57,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 15:58:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 9797 transitions. [2020-04-18 15:58:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:57,827 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:57,827 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:57,828 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:57,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1421383457, now seen corresponding path program 1 times [2020-04-18 15:58:57,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:57,828 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1038793835] [2020-04-18 15:58:57,829 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:57,830 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 15:58:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 15:58:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:57,831 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:57,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash 975484449, now seen corresponding path program 2 times [2020-04-18 15:58:57,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:57,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429637643] [2020-04-18 15:58:57,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:58:57,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429637643] [2020-04-18 15:58:57,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:57,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:57,863 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:57,866 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:57,871 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 15:58:57,871 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:57,878 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:58:57,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:57,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:57,878 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 15:58:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:57,884 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 15:58:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 15:58:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:57,885 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1421383457, now seen corresponding path program 3 times [2020-04-18 15:58:57,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:57,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175537115] [2020-04-18 15:58:57,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:58:57,936 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175537115] [2020-04-18 15:58:57,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:57,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:57,937 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:57,940 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:57,944 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:58:57,944 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:57,957 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:57,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:57,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:57,958 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 15:58:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:57,990 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 15:58:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 15:58:57,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:57,990 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1038793835] [2020-04-18 15:58:57,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:57,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:57,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1038793835] [2020-04-18 15:58:57,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:58:57,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:57,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:57,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:57,992 INFO L87 Difference]: Start difference. First operand 3357 states and 9797 transitions. Second operand 5 states. [2020-04-18 15:58:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:58,135 INFO L93 Difference]: Finished difference Result 5159 states and 14529 transitions. [2020-04-18 15:58:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:58:58,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 15:58:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:58,146 INFO L225 Difference]: With dead ends: 5159 [2020-04-18 15:58:58,146 INFO L226 Difference]: Without dead ends: 5149 [2020-04-18 15:58:58,147 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5149 states. [2020-04-18 15:58:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5149 to 3425. [2020-04-18 15:58:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2020-04-18 15:58:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 9962 transitions. [2020-04-18 15:58:58,252 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 9962 transitions. Word has length 18 [2020-04-18 15:58:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:58,252 INFO L479 AbstractCegarLoop]: Abstraction has 3425 states and 9962 transitions. [2020-04-18 15:58:58,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:58:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 9962 transitions. [2020-04-18 15:58:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:58,256 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:58,256 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:58,257 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash 723420348, now seen corresponding path program 1 times [2020-04-18 15:58:58,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:58,257 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1582194164] [2020-04-18 15:58:58,258 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:58,259 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 15:58:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 15:58:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:58,261 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash 952969510, now seen corresponding path program 2 times [2020-04-18 15:58:58,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:58,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495592640] [2020-04-18 15:58:58,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:58,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495592640] [2020-04-18 15:58:58,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:58,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:58,281 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:58,283 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:58,287 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 38 transitions. [2020-04-18 15:58:58,287 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:58,294 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:58:58,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:58,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:58,294 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 15:58:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:58,305 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 15:58:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 15:58:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:58,306 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash 745684908, now seen corresponding path program 3 times [2020-04-18 15:58:58,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:58,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116721044] [2020-04-18 15:58:58,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:58,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116721044] [2020-04-18 15:58:58,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:58,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:58:58,370 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:58,372 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:58,376 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:58:58,376 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:58,392 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:58,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:58:58,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:58:58,392 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 5 states. [2020-04-18 15:58:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:58,455 INFO L93 Difference]: Finished difference Result 109 states and 197 transitions. [2020-04-18 15:58:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2020-04-18 15:58:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:58,456 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:58:58,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:58,456 INFO L82 PathProgramCache]: Analyzing trace with hash 723420348, now seen corresponding path program 4 times [2020-04-18 15:58:58,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:58,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433213665] [2020-04-18 15:58:58,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:58,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433213665] [2020-04-18 15:58:58,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:58,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 15:58:58,522 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:58,524 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:58,527 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:58:58,528 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:58,542 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:58,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:58:58,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-04-18 15:58:58,543 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand 7 states. [2020-04-18 15:58:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:58,654 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2020-04-18 15:58:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 198 transitions. [2020-04-18 15:58:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:58,655 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:58:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash 776429336, now seen corresponding path program 5 times [2020-04-18 15:58:58,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:58,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124858862] [2020-04-18 15:58:58,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:58,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124858862] [2020-04-18 15:58:58,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:58,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:58,696 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:58,699 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:58,703 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 20 transitions. [2020-04-18 15:58:58,703 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:58,714 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:58:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:58,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:58:58,715 INFO L87 Difference]: Start difference. First operand 111 states and 198 transitions. Second operand 3 states. [2020-04-18 15:58:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:58,722 INFO L93 Difference]: Finished difference Result 121 states and 207 transitions. [2020-04-18 15:58:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2020-04-18 15:58:58,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:58:58,723 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1582194164] [2020-04-18 15:58:58,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:58:58,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:58:58,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1582194164] [2020-04-18 15:58:58,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 15:58:58,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:58:58,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 15:58:58,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:58:58,725 INFO L87 Difference]: Start difference. First operand 3425 states and 9962 transitions. Second operand 8 states. [2020-04-18 15:58:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:59,294 INFO L93 Difference]: Finished difference Result 6347 states and 17564 transitions. [2020-04-18 15:58:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 15:58:59,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-04-18 15:58:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:58:59,306 INFO L225 Difference]: With dead ends: 6347 [2020-04-18 15:58:59,307 INFO L226 Difference]: Without dead ends: 6323 [2020-04-18 15:58:59,307 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2020-04-18 15:58:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6323 states. [2020-04-18 15:58:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6323 to 3381. [2020-04-18 15:58:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3381 states. [2020-04-18 15:58:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 9842 transitions. [2020-04-18 15:58:59,395 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 9842 transitions. Word has length 18 [2020-04-18 15:58:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:58:59,395 INFO L479 AbstractCegarLoop]: Abstraction has 3381 states and 9842 transitions. [2020-04-18 15:58:59,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 15:58:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 9842 transitions. [2020-04-18 15:58:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:59,397 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:58:59,397 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:58:59,397 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:58:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:59,397 INFO L82 PathProgramCache]: Analyzing trace with hash 830017445, now seen corresponding path program 1 times [2020-04-18 15:58:59,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:58:59,398 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [485911647] [2020-04-18 15:58:59,399 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:59,400 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 15:58:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 15:58:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:59,401 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:58:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash 953792927, now seen corresponding path program 2 times [2020-04-18 15:58:59,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:59,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644201938] [2020-04-18 15:58:59,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:59,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644201938] [2020-04-18 15:58:59,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:59,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:58:59,431 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:59,434 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:59,438 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 47 transitions. [2020-04-18 15:58:59,438 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:59,452 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:58:59,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:58:59,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:58:59,453 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 15:58:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:59,463 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 15:58:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 15:58:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:59,464 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:58:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash 746508325, now seen corresponding path program 3 times [2020-04-18 15:58:59,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:59,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717847127] [2020-04-18 15:58:59,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:59,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717847127] [2020-04-18 15:58:59,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:59,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:58:59,491 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:59,493 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:59,497 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 26 transitions. [2020-04-18 15:58:59,497 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:59,535 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:58:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:58:59,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:58:59,536 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 6 states. [2020-04-18 15:58:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:58:59,633 INFO L93 Difference]: Finished difference Result 115 states and 220 transitions. [2020-04-18 15:58:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 220 transitions. [2020-04-18 15:58:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:58:59,633 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:58:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:58:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash 829623845, now seen corresponding path program 4 times [2020-04-18 15:58:59,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:58:59,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302058745] [2020-04-18 15:58:59,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:58:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:58:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:58:59,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302058745] [2020-04-18 15:58:59,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:58:59,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:58:59,688 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:58:59,691 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:58:59,698 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 15:58:59,699 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:58:59,807 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 13 times. [2020-04-18 15:58:59,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 15:58:59,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-04-18 15:58:59,808 INFO L87 Difference]: Start difference. First operand 115 states and 220 transitions. Second operand 11 states. [2020-04-18 15:59:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:00,024 INFO L93 Difference]: Finished difference Result 128 states and 232 transitions. [2020-04-18 15:59:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2020-04-18 15:59:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:00,025 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:59:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash 830017445, now seen corresponding path program 5 times [2020-04-18 15:59:00,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:00,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218925798] [2020-04-18 15:59:00,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:00,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218925798] [2020-04-18 15:59:00,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:00,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 15:59:00,101 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:00,104 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:00,110 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 15:59:00,111 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:00,146 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 15:59:00,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 15:59:00,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2020-04-18 15:59:00,147 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 11 states. [2020-04-18 15:59:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:00,314 INFO L93 Difference]: Finished difference Result 130 states and 233 transitions. [2020-04-18 15:59:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 233 transitions. [2020-04-18 15:59:00,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:00,315 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [485911647] [2020-04-18 15:59:00,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:00,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 15:59:00,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [485911647] [2020-04-18 15:59:00,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 15:59:00,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 15:59:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2020-04-18 15:59:00,318 INFO L87 Difference]: Start difference. First operand 3381 states and 9842 transitions. Second operand 17 states. [2020-04-18 15:59:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:02,999 INFO L93 Difference]: Finished difference Result 8277 states and 21932 transitions. [2020-04-18 15:59:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-04-18 15:59:03,000 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-04-18 15:59:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:03,013 INFO L225 Difference]: With dead ends: 8277 [2020-04-18 15:59:03,014 INFO L226 Difference]: Without dead ends: 8250 [2020-04-18 15:59:03,016 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2982 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1597, Invalid=6593, Unknown=0, NotChecked=0, Total=8190 [2020-04-18 15:59:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8250 states. [2020-04-18 15:59:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8250 to 3234. [2020-04-18 15:59:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2020-04-18 15:59:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 9399 transitions. [2020-04-18 15:59:03,112 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 9399 transitions. Word has length 18 [2020-04-18 15:59:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:03,113 INFO L479 AbstractCegarLoop]: Abstraction has 3234 states and 9399 transitions. [2020-04-18 15:59:03,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 15:59:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 9399 transitions. [2020-04-18 15:59:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:03,114 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:03,115 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:03,115 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:03,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:03,115 INFO L82 PathProgramCache]: Analyzing trace with hash 533807354, now seen corresponding path program 1 times [2020-04-18 15:59:03,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:03,115 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [963193009] [2020-04-18 15:59:03,116 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:03,118 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 200 transitions. [2020-04-18 15:59:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 15:59:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:03,119 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:03,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash -261322664, now seen corresponding path program 2 times [2020-04-18 15:59:03,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:03,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572246533] [2020-04-18 15:59:03,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:59:03,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572246533] [2020-04-18 15:59:03,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:03,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:03,159 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:03,161 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:03,171 INFO L259 McrAutomatonBuilder]: Finished intersection with 63 states and 111 transitions. [2020-04-18 15:59:03,172 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:03,188 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:03,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:03,189 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 15:59:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:03,200 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2020-04-18 15:59:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2020-04-18 15:59:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:03,201 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:03,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash -840362134, now seen corresponding path program 3 times [2020-04-18 15:59:03,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:03,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484804854] [2020-04-18 15:59:03,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 15:59:03,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484804854] [2020-04-18 15:59:03,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:03,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:03,233 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:03,236 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:03,244 INFO L259 McrAutomatonBuilder]: Finished intersection with 47 states and 71 transitions. [2020-04-18 15:59:03,244 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:03,276 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 15:59:03,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:59:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:03,277 INFO L87 Difference]: Start difference. First operand 117 states and 225 transitions. Second operand 6 states. [2020-04-18 15:59:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:03,344 INFO L93 Difference]: Finished difference Result 123 states and 232 transitions. [2020-04-18 15:59:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 232 transitions. [2020-04-18 15:59:03,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:03,345 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:59:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash -841515334, now seen corresponding path program 4 times [2020-04-18 15:59:03,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:03,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864213912] [2020-04-18 15:59:03,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 15:59:03,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864213912] [2020-04-18 15:59:03,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:03,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:59:03,389 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:03,391 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:03,400 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2020-04-18 15:59:03,400 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:03,424 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:59:03,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-04-18 15:59:03,425 INFO L87 Difference]: Start difference. First operand 123 states and 232 transitions. Second operand 5 states. [2020-04-18 15:59:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:03,555 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions. [2020-04-18 15:59:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 244 transitions. [2020-04-18 15:59:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:03,556 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:59:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash 533807354, now seen corresponding path program 5 times [2020-04-18 15:59:03,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:03,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405827909] [2020-04-18 15:59:03,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 15:59:03,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405827909] [2020-04-18 15:59:03,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878119193] [2020-04-18 15:59:03,641 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 15:59:03,745 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 15:59:03,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 15:59:03,746 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 15:59:03,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 15:59:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 15:59:03,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 15:59:03,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2020-04-18 15:59:03,831 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:03,834 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:03,842 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 15:59:03,842 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:03,961 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 15:59:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 15:59:03,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2020-04-18 15:59:03,961 INFO L87 Difference]: Start difference. First operand 136 states and 244 transitions. Second operand 13 states. [2020-04-18 15:59:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:04,275 INFO L93 Difference]: Finished difference Result 138 states and 245 transitions. [2020-04-18 15:59:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 245 transitions. [2020-04-18 15:59:04,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:04,276 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [963193009] [2020-04-18 15:59:04,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:04,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 15:59:04,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [963193009] [2020-04-18 15:59:04,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 15:59:04,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 15:59:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2020-04-18 15:59:04,278 INFO L87 Difference]: Start difference. First operand 3234 states and 9399 transitions. Second operand 17 states. [2020-04-18 15:59:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:06,237 INFO L93 Difference]: Finished difference Result 8370 states and 22045 transitions. [2020-04-18 15:59:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-04-18 15:59:06,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-04-18 15:59:06,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:06,249 INFO L225 Difference]: With dead ends: 8370 [2020-04-18 15:59:06,249 INFO L226 Difference]: Without dead ends: 8336 [2020-04-18 15:59:06,251 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=937, Invalid=3619, Unknown=0, NotChecked=0, Total=4556 [2020-04-18 15:59:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8336 states. [2020-04-18 15:59:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8336 to 2952. [2020-04-18 15:59:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2020-04-18 15:59:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 8486 transitions. [2020-04-18 15:59:06,335 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 8486 transitions. Word has length 22 [2020-04-18 15:59:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:06,335 INFO L479 AbstractCegarLoop]: Abstraction has 2952 states and 8486 transitions. [2020-04-18 15:59:06,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 15:59:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 8486 transitions. [2020-04-18 15:59:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:06,337 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:06,337 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:06,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 15:59:06,541 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash 152610057, now seen corresponding path program 1 times [2020-04-18 15:59:06,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:06,542 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1807106748] [2020-04-18 15:59:06,542 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:06,543 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 15:59:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-04-18 15:59:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:06,544 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:06,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:06,545 INFO L82 PathProgramCache]: Analyzing trace with hash 152610057, now seen corresponding path program 2 times [2020-04-18 15:59:06,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:06,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379217872] [2020-04-18 15:59:06,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:06,587 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:59:06,587 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:59:06,587 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:59:06,588 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:59:06,588 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 15:59:06,589 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-04-18 15:59:06,604 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,605 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,605 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,605 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,605 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,605 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,605 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,605 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,605 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,606 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,606 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,606 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,606 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,606 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,606 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,606 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,607 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,607 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,607 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,607 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,607 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,607 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,608 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,608 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,608 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,608 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,608 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,608 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,608 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,608 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,609 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,609 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,609 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,609 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,609 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,609 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,609 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,610 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,610 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,610 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,610 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,610 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,611 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,611 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,611 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,611 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,611 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,611 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,611 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,612 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,612 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,612 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,612 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,612 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,612 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,612 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,612 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,613 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,613 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,613 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,613 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,613 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,613 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,614 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,614 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,614 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,614 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,614 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,614 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,614 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,615 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,615 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,615 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,615 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,615 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,615 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,615 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,616 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,616 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,616 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,616 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,616 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,616 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,616 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,617 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,617 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,617 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,617 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,617 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,617 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,617 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,618 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,618 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,618 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,618 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,619 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,619 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,619 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,620 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,620 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,620 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,620 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,621 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,621 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,621 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,621 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,621 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,621 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,622 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,622 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,622 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,622 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,622 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,623 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,623 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,623 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,623 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,623 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,623 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,623 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,623 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,624 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,624 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,624 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,624 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,624 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,624 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,624 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,625 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,625 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,625 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,625 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,625 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,625 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,625 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,626 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,626 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,626 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,627 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,629 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,634 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,635 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,635 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,636 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,636 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,636 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,636 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,636 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,637 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,638 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,638 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,638 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,638 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,638 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,638 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,638 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,638 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,639 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,640 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,641 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,641 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,641 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,641 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,641 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,642 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,642 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,642 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,642 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,644 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,644 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,645 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,645 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,645 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,645 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,647 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,647 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,647 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,647 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,648 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,648 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,649 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,649 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,650 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,650 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,652 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,655 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,655 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,655 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,655 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,655 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,655 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:06,657 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 15:59:06,657 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:59:06,657 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:59:06,657 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:59:06,657 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:59:06,657 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:59:06,657 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:59:06,658 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:59:06,658 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:59:06,662 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 192 transitions, 474 flow [2020-04-18 15:59:06,662 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 197 places, 192 transitions, 474 flow [2020-04-18 15:59:06,696 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2020-04-18 15:59:06,696 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 15:59:06,699 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 222 events. 18/222 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 532 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 12 conditions per place. [2020-04-18 15:59:06,713 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 197 places, 192 transitions, 474 flow [2020-04-18 15:59:06,746 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2020-04-18 15:59:06,746 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 15:59:06,749 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 222 events. 18/222 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 532 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 12 conditions per place. [2020-04-18 15:59:06,757 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11754 [2020-04-18 15:59:06,757 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:59:10,683 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 15:59:10,807 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:59:10,820 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17538 [2020-04-18 15:59:10,820 INFO L214 etLargeBlockEncoding]: Total number of compositions: 176 [2020-04-18 15:59:10,821 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 56 transitions, 202 flow [2020-04-18 15:59:34,131 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97217 states. [2020-04-18 15:59:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 97217 states. [2020-04-18 15:59:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:34,132 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:34,132 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:59:34,132 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1584808, now seen corresponding path program 1 times [2020-04-18 15:59:34,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:34,133 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1717709100] [2020-04-18 15:59:34,133 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:34,133 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:59:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:34,134 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1584808, now seen corresponding path program 2 times [2020-04-18 15:59:34,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:34,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841023858] [2020-04-18 15:59:34,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:34,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841023858] [2020-04-18 15:59:34,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:34,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:59:34,150 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:34,150 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:34,150 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:34,150 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:34,160 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:34,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:34,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:34,161 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:59:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:34,162 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:59:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:59:34,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:34,162 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1717709100] [2020-04-18 15:59:34,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:34,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:59:34,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1717709100] [2020-04-18 15:59:34,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:59:34,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:34,163 INFO L87 Difference]: Start difference. First operand 97217 states. Second operand 3 states. [2020-04-18 15:59:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:35,466 INFO L93 Difference]: Finished difference Result 118175 states and 731030 transitions. [2020-04-18 15:59:35,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:59:35,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:59:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:40,895 INFO L225 Difference]: With dead ends: 118175 [2020-04-18 15:59:40,895 INFO L226 Difference]: Without dead ends: 110531 [2020-04-18 15:59:40,896 INFO L678 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 [2020-04-18 15:59:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110531 states. [2020-04-18 15:59:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110531 to 100755. [2020-04-18 15:59:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100755 states. [2020-04-18 15:59:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100755 states to 100755 states and 628402 transitions. [2020-04-18 15:59:46,452 INFO L78 Accepts]: Start accepts. Automaton has 100755 states and 628402 transitions. Word has length 3 [2020-04-18 15:59:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:46,452 INFO L479 AbstractCegarLoop]: Abstraction has 100755 states and 628402 transitions. [2020-04-18 15:59:46,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:59:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 100755 states and 628402 transitions. [2020-04-18 15:59:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:46,453 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:46,453 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:46,453 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:46,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:46,453 INFO L82 PathProgramCache]: Analyzing trace with hash 706336859, now seen corresponding path program 1 times [2020-04-18 15:59:46,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:46,453 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [575532808] [2020-04-18 15:59:46,454 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:46,454 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 15:59:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 15:59:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:46,454 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -459766095, now seen corresponding path program 2 times [2020-04-18 15:59:46,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:46,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358151198] [2020-04-18 15:59:46,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:46,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358151198] [2020-04-18 15:59:46,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:46,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:46,479 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:46,480 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:46,481 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 15:59:46,482 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:46,486 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:46,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:46,487 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 15:59:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:46,490 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:59:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:59:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:46,491 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 706336859, now seen corresponding path program 3 times [2020-04-18 15:59:46,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:46,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950877241] [2020-04-18 15:59:46,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:46,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950877241] [2020-04-18 15:59:46,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:46,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:46,520 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:46,521 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:46,522 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 15:59:46,522 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:46,531 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:46,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:46,532 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 15:59:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:46,552 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:59:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:59:46,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:46,553 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [575532808] [2020-04-18 15:59:46,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:46,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:46,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [575532808] [2020-04-18 15:59:46,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:59:46,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:46,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:46,554 INFO L87 Difference]: Start difference. First operand 100755 states and 628402 transitions. Second operand 5 states. [2020-04-18 15:59:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:54,685 INFO L93 Difference]: Finished difference Result 187755 states and 1125902 transitions. [2020-04-18 15:59:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:54,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 15:59:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:55,487 INFO L225 Difference]: With dead ends: 187755 [2020-04-18 15:59:55,488 INFO L226 Difference]: Without dead ends: 187578 [2020-04-18 15:59:55,488 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187578 states. [2020-04-18 16:00:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187578 to 111945. [2020-04-18 16:00:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111945 states. [2020-04-18 16:00:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111945 states to 111945 states and 706831 transitions. [2020-04-18 16:00:13,979 INFO L78 Accepts]: Start accepts. Automaton has 111945 states and 706831 transitions. Word has length 10 [2020-04-18 16:00:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:13,979 INFO L479 AbstractCegarLoop]: Abstraction has 111945 states and 706831 transitions. [2020-04-18 16:00:13,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 16:00:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 111945 states and 706831 transitions. [2020-04-18 16:00:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 16:00:13,980 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:13,980 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:13,980 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash -748578768, now seen corresponding path program 1 times [2020-04-18 16:00:13,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:13,981 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1393571884] [2020-04-18 16:00:13,981 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:13,982 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 16:00:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 16:00:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 16:00:13,982 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:13,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 811703996, now seen corresponding path program 2 times [2020-04-18 16:00:13,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:13,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054136802] [2020-04-18 16:00:13,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:14,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054136802] [2020-04-18 16:00:14,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:14,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:14,018 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:14,019 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:14,022 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 16:00:14,022 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:14,027 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:14,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:14,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:14,027 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 16:00:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:14,031 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 16:00:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 16:00:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 16:00:14,032 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:14,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash -748578768, now seen corresponding path program 3 times [2020-04-18 16:00:14,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:14,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933100577] [2020-04-18 16:00:14,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:14,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933100577] [2020-04-18 16:00:14,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:14,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:14,068 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:14,069 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:14,072 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 16:00:14,072 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:14,082 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:14,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:14,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:00:14,082 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 16:00:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:14,130 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 16:00:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 16:00:14,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:14,131 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1393571884] [2020-04-18 16:00:14,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:14,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:00:14,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1393571884] [2020-04-18 16:00:14,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 16:00:14,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:14,132 INFO L87 Difference]: Start difference. First operand 111945 states and 706831 transitions. Second operand 5 states. [2020-04-18 16:00:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:23,552 INFO L93 Difference]: Finished difference Result 212246 states and 1288288 transitions. [2020-04-18 16:00:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 16:00:23,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 16:00:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:24,543 INFO L225 Difference]: With dead ends: 212246 [2020-04-18 16:00:24,543 INFO L226 Difference]: Without dead ends: 211934 [2020-04-18 16:00:24,543 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211934 states. [2020-04-18 16:00:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211934 to 127498. [2020-04-18 16:00:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127498 states. [2020-04-18 16:00:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127498 states to 127498 states and 815584 transitions. [2020-04-18 16:00:37,278 INFO L78 Accepts]: Start accepts. Automaton has 127498 states and 815584 transitions. Word has length 14 [2020-04-18 16:00:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:37,278 INFO L479 AbstractCegarLoop]: Abstraction has 127498 states and 815584 transitions. [2020-04-18 16:00:37,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 16:00:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 127498 states and 815584 transitions. [2020-04-18 16:00:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 16:00:37,279 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:37,279 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:37,279 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:37,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:37,279 INFO L82 PathProgramCache]: Analyzing trace with hash 921085459, now seen corresponding path program 1 times [2020-04-18 16:00:37,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:37,280 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [78514646] [2020-04-18 16:00:37,280 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:37,281 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 16:00:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 16:00:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 16:00:37,282 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:37,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:37,282 INFO L82 PathProgramCache]: Analyzing trace with hash 469871123, now seen corresponding path program 2 times [2020-04-18 16:00:37,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:37,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972968144] [2020-04-18 16:00:37,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:37,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972968144] [2020-04-18 16:00:37,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:37,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:37,305 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:37,307 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:37,313 INFO L259 McrAutomatonBuilder]: Finished intersection with 52 states and 94 transitions. [2020-04-18 16:00:37,313 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:37,319 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:37,319 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 16:00:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:37,332 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 16:00:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 16:00:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 16:00:37,333 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:37,334 INFO L82 PathProgramCache]: Analyzing trace with hash 236651817, now seen corresponding path program 3 times [2020-04-18 16:00:37,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:37,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344645422] [2020-04-18 16:00:37,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:00:37,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344645422] [2020-04-18 16:00:37,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:37,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:37,358 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:37,359 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:37,364 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-04-18 16:00:37,365 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:37,394 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 16:00:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 16:00:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:37,394 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 16:00:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:37,465 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 16:00:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 16:00:37,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:37,466 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [78514646] [2020-04-18 16:00:37,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:37,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:00:37,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [78514646] [2020-04-18 16:00:37,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 16:00:37,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:37,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:00:37,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 16:00:37,468 INFO L87 Difference]: Start difference. First operand 127498 states and 815584 transitions. Second operand 7 states. [2020-04-18 16:00:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:38,191 INFO L93 Difference]: Finished difference Result 28630 states and 88425 transitions. [2020-04-18 16:00:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 16:00:38,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 16:00:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:38,242 INFO L225 Difference]: With dead ends: 28630 [2020-04-18 16:00:38,242 INFO L226 Difference]: Without dead ends: 28630 [2020-04-18 16:00:38,242 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-04-18 16:00:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28630 states. [2020-04-18 16:00:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28630 to 13870. [2020-04-18 16:00:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2020-04-18 16:00:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 45593 transitions. [2020-04-18 16:00:38,644 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 45593 transitions. Word has length 17 [2020-04-18 16:00:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:38,644 INFO L479 AbstractCegarLoop]: Abstraction has 13870 states and 45593 transitions. [2020-04-18 16:00:38,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 16:00:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 45593 transitions. [2020-04-18 16:00:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:38,645 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:38,646 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:38,646 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1755375156, now seen corresponding path program 1 times [2020-04-18 16:00:38,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:38,646 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1617551848] [2020-04-18 16:00:38,647 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:38,648 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 16:00:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 16:00:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:38,649 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:38,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:38,649 INFO L82 PathProgramCache]: Analyzing trace with hash 564846624, now seen corresponding path program 2 times [2020-04-18 16:00:38,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:38,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112146798] [2020-04-18 16:00:38,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:38,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112146798] [2020-04-18 16:00:38,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:38,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:38,681 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:38,682 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:38,687 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions. [2020-04-18 16:00:38,687 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:38,691 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:38,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:38,692 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 16:00:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:38,703 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 16:00:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 16:00:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:38,703 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1855158498, now seen corresponding path program 3 times [2020-04-18 16:00:38,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:38,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333603331] [2020-04-18 16:00:38,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:00:38,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333603331] [2020-04-18 16:00:38,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:38,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:00:38,742 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:38,744 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:38,750 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 16:00:38,750 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:38,765 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:00:38,766 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 5 states. [2020-04-18 16:00:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:38,828 INFO L93 Difference]: Finished difference Result 121 states and 225 transitions. [2020-04-18 16:00:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 225 transitions. [2020-04-18 16:00:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:38,828 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:00:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:38,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1755375156, now seen corresponding path program 4 times [2020-04-18 16:00:38,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:38,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644261799] [2020-04-18 16:00:38,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:00:38,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644261799] [2020-04-18 16:00:38,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840579377] [2020-04-18 16:00:38,878 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:00:38,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:00:38,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:00:38,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:00:38,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:00:44,097 WARN L192 SmtUtils]: Spent 5.09 s on a formula simplification that was a NOOP. DAG size: 7 [2020-04-18 16:00:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:00:44,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:00:44,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:00:44,122 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:44,124 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:44,130 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 16:00:44,130 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:44,197 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:44,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 16:00:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 16:00:44,197 INFO L87 Difference]: Start difference. First operand 121 states and 225 transitions. Second operand 12 states. [2020-04-18 16:00:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:44,372 INFO L93 Difference]: Finished difference Result 123 states and 226 transitions. [2020-04-18 16:00:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2020-04-18 16:00:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:44,373 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:00:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1732117408, now seen corresponding path program 5 times [2020-04-18 16:00:44,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:44,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110972256] [2020-04-18 16:00:44,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:00:44,402 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110972256] [2020-04-18 16:00:44,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:44,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:44,402 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:44,404 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:44,409 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 16:00:44,409 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:44,423 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:00:44,424 INFO L87 Difference]: Start difference. First operand 123 states and 226 transitions. Second operand 3 states. [2020-04-18 16:00:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:44,431 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 16:00:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 16:00:44,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:44,432 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1617551848] [2020-04-18 16:00:44,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:44,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:00:44,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1617551848] [2020-04-18 16:00:44,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 16:00:44,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:44,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 16:00:44,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:00:44,434 INFO L87 Difference]: Start difference. First operand 13870 states and 45593 transitions. Second operand 13 states. [2020-04-18 16:00:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:45,335 INFO L93 Difference]: Finished difference Result 28297 states and 88595 transitions. [2020-04-18 16:00:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 16:00:45,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 16:00:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:45,425 INFO L225 Difference]: With dead ends: 28297 [2020-04-18 16:00:45,425 INFO L226 Difference]: Without dead ends: 28227 [2020-04-18 16:00:45,426 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 16:00:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2020-04-18 16:00:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 13185. [2020-04-18 16:00:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13185 states. [2020-04-18 16:00:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13185 states to 13185 states and 43189 transitions. [2020-04-18 16:00:46,029 INFO L78 Accepts]: Start accepts. Automaton has 13185 states and 43189 transitions. Word has length 18 [2020-04-18 16:00:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:46,029 INFO L479 AbstractCegarLoop]: Abstraction has 13185 states and 43189 transitions. [2020-04-18 16:00:46,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 16:00:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13185 states and 43189 transitions. [2020-04-18 16:00:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:46,030 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:46,030 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:46,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:00:46,234 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:46,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1676322857, now seen corresponding path program 1 times [2020-04-18 16:00:46,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:46,235 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [592612291] [2020-04-18 16:00:46,236 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:46,237 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 16:00:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 16:00:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:46,238 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1681104429, now seen corresponding path program 2 times [2020-04-18 16:00:46,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:46,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100671541] [2020-04-18 16:00:46,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:46,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100671541] [2020-04-18 16:00:46,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:46,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:46,255 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:46,257 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:46,265 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 95 transitions. [2020-04-18 16:00:46,266 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:46,271 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:46,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:46,272 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 16:00:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:46,280 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 16:00:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 16:00:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:46,281 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:46,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:46,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1253726761, now seen corresponding path program 3 times [2020-04-18 16:00:46,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:46,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679870747] [2020-04-18 16:00:46,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:00:46,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679870747] [2020-04-18 16:00:46,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:46,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:46,304 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:46,308 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:46,313 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 16:00:46,313 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:46,346 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 16:00:46,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 16:00:46,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:46,347 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 6 states. [2020-04-18 16:00:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:46,414 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-04-18 16:00:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2020-04-18 16:00:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:46,415 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:00:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1676790857, now seen corresponding path program 4 times [2020-04-18 16:00:46,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:46,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376656872] [2020-04-18 16:00:46,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:46,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376656872] [2020-04-18 16:00:46,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:46,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:00:46,452 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:46,454 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:46,459 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 16:00:46,459 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:46,481 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:46,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:46,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 16:00:46,482 INFO L87 Difference]: Start difference. First operand 103 states and 192 transitions. Second operand 5 states. [2020-04-18 16:00:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:46,532 INFO L93 Difference]: Finished difference Result 116 states and 204 transitions. [2020-04-18 16:00:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 204 transitions. [2020-04-18 16:00:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:46,532 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:00:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1676322857, now seen corresponding path program 5 times [2020-04-18 16:00:46,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:46,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186249906] [2020-04-18 16:00:46,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:46,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186249906] [2020-04-18 16:00:46,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:46,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 16:00:46,580 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:46,581 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:46,583 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 16:00:46,584 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:46,601 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:00:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 16:00:46,601 INFO L87 Difference]: Start difference. First operand 116 states and 204 transitions. Second operand 7 states. [2020-04-18 16:00:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:46,723 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2020-04-18 16:00:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 205 transitions. [2020-04-18 16:00:46,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:46,724 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [592612291] [2020-04-18 16:00:46,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:46,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:00:46,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [592612291] [2020-04-18 16:00:46,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 16:00:46,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:46,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 16:00:46,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 16:00:46,726 INFO L87 Difference]: Start difference. First operand 13185 states and 43189 transitions. Second operand 11 states. [2020-04-18 16:00:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:48,866 INFO L93 Difference]: Finished difference Result 41864 states and 127091 transitions. [2020-04-18 16:00:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 16:00:48,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-04-18 16:00:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:48,978 INFO L225 Difference]: With dead ends: 41864 [2020-04-18 16:00:48,979 INFO L226 Difference]: Without dead ends: 41780 [2020-04-18 16:00:48,980 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=623, Invalid=2133, Unknown=0, NotChecked=0, Total=2756 [2020-04-18 16:00:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41780 states. [2020-04-18 16:00:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41780 to 12294. [2020-04-18 16:00:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12294 states. [2020-04-18 16:00:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 40114 transitions. [2020-04-18 16:00:49,778 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 40114 transitions. Word has length 18 [2020-04-18 16:00:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:49,778 INFO L479 AbstractCegarLoop]: Abstraction has 12294 states and 40114 transitions. [2020-04-18 16:00:49,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 16:00:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 40114 transitions. [2020-04-18 16:00:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:49,779 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:49,779 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:49,779 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1820904367, now seen corresponding path program 1 times [2020-04-18 16:00:49,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:49,780 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [674631539] [2020-04-18 16:00:49,781 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:49,782 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 16:00:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 16:00:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:49,782 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1116922107, now seen corresponding path program 2 times [2020-04-18 16:00:49,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:49,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202208265] [2020-04-18 16:00:49,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:49,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202208265] [2020-04-18 16:00:49,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:49,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:49,806 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:49,807 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:49,810 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 16:00:49,811 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:49,819 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:49,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:49,819 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 16:00:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:49,824 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 16:00:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 16:00:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:00:49,825 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:49,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1820904367, now seen corresponding path program 3 times [2020-04-18 16:00:49,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:49,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364418042] [2020-04-18 16:00:49,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:49,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364418042] [2020-04-18 16:00:49,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:49,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:49,859 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:49,860 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:49,863 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 16:00:49,863 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:49,874 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:49,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:49,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:00:49,875 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 16:00:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:49,900 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 16:00:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 16:00:49,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:49,900 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [674631539] [2020-04-18 16:00:49,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:49,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:00:49,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [674631539] [2020-04-18 16:00:49,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 16:00:49,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:49,901 INFO L87 Difference]: Start difference. First operand 12294 states and 40114 transitions. Second operand 5 states. [2020-04-18 16:00:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:50,111 INFO L93 Difference]: Finished difference Result 24605 states and 79893 transitions. [2020-04-18 16:00:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 16:00:50,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 16:00:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:50,160 INFO L225 Difference]: With dead ends: 24605 [2020-04-18 16:00:50,161 INFO L226 Difference]: Without dead ends: 24581 [2020-04-18 16:00:50,161 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24581 states. [2020-04-18 16:00:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24581 to 13787. [2020-04-18 16:00:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13787 states. [2020-04-18 16:00:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13787 states to 13787 states and 45295 transitions. [2020-04-18 16:00:50,549 INFO L78 Accepts]: Start accepts. Automaton has 13787 states and 45295 transitions. Word has length 18 [2020-04-18 16:00:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:50,549 INFO L479 AbstractCegarLoop]: Abstraction has 13787 states and 45295 transitions. [2020-04-18 16:00:50,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 16:00:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 13787 states and 45295 transitions. [2020-04-18 16:00:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:50,551 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:50,551 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:50,551 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:50,552 INFO L82 PathProgramCache]: Analyzing trace with hash 862095341, now seen corresponding path program 1 times [2020-04-18 16:00:50,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:50,552 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [566362223] [2020-04-18 16:00:50,553 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:50,555 INFO L259 McrAutomatonBuilder]: Finished intersection with 130 states and 280 transitions. [2020-04-18 16:00:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-04-18 16:00:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:50,556 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash 13946975, now seen corresponding path program 2 times [2020-04-18 16:00:50,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:50,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771762122] [2020-04-18 16:00:50,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:50,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771762122] [2020-04-18 16:00:50,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:50,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:50,575 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:50,578 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:50,587 INFO L259 McrAutomatonBuilder]: Finished intersection with 85 states and 162 transitions. [2020-04-18 16:00:50,587 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:50,591 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:50,592 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2020-04-18 16:00:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:50,603 INFO L93 Difference]: Finished difference Result 157 states and 317 transitions. [2020-04-18 16:00:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 317 transitions. [2020-04-18 16:00:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:50,604 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash 39794721, now seen corresponding path program 3 times [2020-04-18 16:00:50,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:50,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909205552] [2020-04-18 16:00:50,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:00:50,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909205552] [2020-04-18 16:00:50,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:50,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:00:50,642 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:50,644 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:50,655 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 132 transitions. [2020-04-18 16:00:50,656 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:50,665 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:50,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:50,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:00:50,666 INFO L87 Difference]: Start difference. First operand 157 states and 317 transitions. Second operand 5 states. [2020-04-18 16:00:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:50,712 INFO L93 Difference]: Finished difference Result 169 states and 329 transitions. [2020-04-18 16:00:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 329 transitions. [2020-04-18 16:00:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:50,712 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:00:50,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash 862095341, now seen corresponding path program 4 times [2020-04-18 16:00:50,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:50,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316235885] [2020-04-18 16:00:50,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:00:50,776 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316235885] [2020-04-18 16:00:50,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786745646] [2020-04-18 16:00:50,777 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:00:50,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:00:50,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:00:50,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:00:50,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:00:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:00:50,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:00:50,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:00:50,972 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:50,975 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:50,987 INFO L259 McrAutomatonBuilder]: Finished intersection with 55 states and 86 transitions. [2020-04-18 16:00:50,988 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:51,070 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:51,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 16:00:51,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 16:00:51,071 INFO L87 Difference]: Start difference. First operand 169 states and 329 transitions. Second operand 12 states. [2020-04-18 16:00:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:51,262 INFO L93 Difference]: Finished difference Result 171 states and 330 transitions. [2020-04-18 16:00:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 330 transitions. [2020-04-18 16:00:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:51,263 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:00:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:51,263 INFO L82 PathProgramCache]: Analyzing trace with hash 146658463, now seen corresponding path program 5 times [2020-04-18 16:00:51,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:51,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263573033] [2020-04-18 16:00:51,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:00:51,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263573033] [2020-04-18 16:00:51,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:51,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:51,282 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:51,285 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:51,292 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-04-18 16:00:51,292 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:51,308 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:51,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:00:51,309 INFO L87 Difference]: Start difference. First operand 171 states and 330 transitions. Second operand 3 states. [2020-04-18 16:00:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:51,316 INFO L93 Difference]: Finished difference Result 181 states and 339 transitions. [2020-04-18 16:00:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 339 transitions. [2020-04-18 16:00:51,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:51,317 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [566362223] [2020-04-18 16:00:51,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:51,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:00:51,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [566362223] [2020-04-18 16:00:51,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 16:00:51,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:51,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 16:00:51,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:00:51,318 INFO L87 Difference]: Start difference. First operand 13787 states and 45295 transitions. Second operand 13 states. [2020-04-18 16:00:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:52,419 INFO L93 Difference]: Finished difference Result 31898 states and 102145 transitions. [2020-04-18 16:00:52,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 16:00:52,420 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-04-18 16:00:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:52,479 INFO L225 Difference]: With dead ends: 31898 [2020-04-18 16:00:52,479 INFO L226 Difference]: Without dead ends: 31865 [2020-04-18 16:00:52,480 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 16:00:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31865 states. [2020-04-18 16:00:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31865 to 13520. [2020-04-18 16:00:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13520 states. [2020-04-18 16:00:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13520 states to 13520 states and 44395 transitions. [2020-04-18 16:00:52,907 INFO L78 Accepts]: Start accepts. Automaton has 13520 states and 44395 transitions. Word has length 22 [2020-04-18 16:00:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:52,908 INFO L479 AbstractCegarLoop]: Abstraction has 13520 states and 44395 transitions. [2020-04-18 16:00:52,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 16:00:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 13520 states and 44395 transitions. [2020-04-18 16:00:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:52,909 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:52,910 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:53,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:00:53,113 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash 611812975, now seen corresponding path program 1 times [2020-04-18 16:00:53,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:53,114 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [589780802] [2020-04-18 16:00:53,115 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:53,118 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 200 transitions. [2020-04-18 16:00:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 16:00:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:53,119 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1290141411, now seen corresponding path program 2 times [2020-04-18 16:00:53,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:53,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927280176] [2020-04-18 16:00:53,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:53,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927280176] [2020-04-18 16:00:53,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:53,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:53,137 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:53,139 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:53,148 INFO L259 McrAutomatonBuilder]: Finished intersection with 61 states and 108 transitions. [2020-04-18 16:00:53,148 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:53,153 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:53,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:53,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:53,154 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 16:00:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:53,162 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2020-04-18 16:00:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2020-04-18 16:00:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:53,163 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash -909934341, now seen corresponding path program 3 times [2020-04-18 16:00:53,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:53,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708953963] [2020-04-18 16:00:53,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:53,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708953963] [2020-04-18 16:00:53,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:53,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:53,182 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:53,186 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:53,193 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 51 transitions. [2020-04-18 16:00:53,193 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:53,198 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 16:00:53,198 INFO L87 Difference]: Start difference. First operand 117 states and 225 transitions. Second operand 3 states. [2020-04-18 16:00:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:53,204 INFO L93 Difference]: Finished difference Result 126 states and 234 transitions. [2020-04-18 16:00:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 234 transitions. [2020-04-18 16:00:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:53,204 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:00:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash 611817595, now seen corresponding path program 4 times [2020-04-18 16:00:53,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:53,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268116980] [2020-04-18 16:00:53,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:53,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268116980] [2020-04-18 16:00:53,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798131181] [2020-04-18 16:00:53,237 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:00:53,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:00:53,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:00:53,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 16:00:53,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:00:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:53,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:00:53,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 16:00:53,375 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:53,377 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:53,386 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2020-04-18 16:00:53,387 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:53,597 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 19 times. [2020-04-18 16:00:53,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 16:00:53,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2020-04-18 16:00:53,597 INFO L87 Difference]: Start difference. First operand 126 states and 234 transitions. Second operand 19 states. [2020-04-18 16:00:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:53,857 INFO L93 Difference]: Finished difference Result 127 states and 234 transitions. [2020-04-18 16:00:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 234 transitions. [2020-04-18 16:00:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:53,858 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:00:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 611812975, now seen corresponding path program 5 times [2020-04-18 16:00:53,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:53,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309988217] [2020-04-18 16:00:53,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:53,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309988217] [2020-04-18 16:00:53,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188236067] [2020-04-18 16:00:53,929 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:00:54,042 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 16:00:54,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:00:54,043 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:00:54,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:00:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:54,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:00:54,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:00:54,110 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:54,112 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:54,119 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 16:00:54,119 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:54,180 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 16:00:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 16:00:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2020-04-18 16:00:54,181 INFO L87 Difference]: Start difference. First operand 127 states and 234 transitions. Second operand 16 states. [2020-04-18 16:00:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:54,390 INFO L93 Difference]: Finished difference Result 134 states and 243 transitions. [2020-04-18 16:00:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 243 transitions. [2020-04-18 16:00:54,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:54,391 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [589780802] [2020-04-18 16:00:54,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:54,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:00:54,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [589780802] [2020-04-18 16:00:54,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-04-18 16:00:54,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-04-18 16:00:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 16:00:54,393 INFO L87 Difference]: Start difference. First operand 13520 states and 44395 transitions. Second operand 24 states. [2020-04-18 16:00:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:56,596 INFO L93 Difference]: Finished difference Result 32253 states and 103231 transitions. [2020-04-18 16:00:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 16:00:56,596 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2020-04-18 16:00:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:56,654 INFO L225 Difference]: With dead ends: 32253 [2020-04-18 16:00:56,654 INFO L226 Difference]: Without dead ends: 32220 [2020-04-18 16:00:56,654 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1114, Invalid=3716, Unknown=0, NotChecked=0, Total=4830 [2020-04-18 16:00:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32220 states. [2020-04-18 16:00:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32220 to 13635. [2020-04-18 16:00:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13635 states. [2020-04-18 16:00:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 44805 transitions. [2020-04-18 16:00:57,074 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 44805 transitions. Word has length 22 [2020-04-18 16:00:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:57,075 INFO L479 AbstractCegarLoop]: Abstraction has 13635 states and 44805 transitions. [2020-04-18 16:00:57,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-04-18 16:00:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 44805 transitions. [2020-04-18 16:00:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:57,076 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:57,076 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:57,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:00:57,478 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash -704732583, now seen corresponding path program 1 times [2020-04-18 16:00:57,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:57,480 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [364422018] [2020-04-18 16:00:57,481 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:57,483 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 180 transitions. [2020-04-18 16:00:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 16:00:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:57,484 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1290209485, now seen corresponding path program 2 times [2020-04-18 16:00:57,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:57,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527578978] [2020-04-18 16:00:57,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:57,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527578978] [2020-04-18 16:00:57,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:57,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:57,501 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:57,503 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:57,523 INFO L259 McrAutomatonBuilder]: Finished intersection with 61 states and 108 transitions. [2020-04-18 16:00:57,523 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:57,528 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:57,529 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 16:00:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:57,537 INFO L93 Difference]: Finished difference Result 105 states and 197 transitions. [2020-04-18 16:00:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 197 transitions. [2020-04-18 16:00:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:57,538 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash -911809405, now seen corresponding path program 3 times [2020-04-18 16:00:57,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:57,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786780796] [2020-04-18 16:00:57,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:57,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786780796] [2020-04-18 16:00:57,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:57,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:57,564 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:57,567 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:57,586 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 51 transitions. [2020-04-18 16:00:57,586 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:57,590 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:57,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 16:00:57,591 INFO L87 Difference]: Start difference. First operand 105 states and 197 transitions. Second operand 3 states. [2020-04-18 16:00:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:57,597 INFO L93 Difference]: Finished difference Result 114 states and 206 transitions. [2020-04-18 16:00:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 206 transitions. [2020-04-18 16:00:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:57,598 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:00:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:57,598 INFO L82 PathProgramCache]: Analyzing trace with hash -476811063, now seen corresponding path program 4 times [2020-04-18 16:00:57,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:57,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547102931] [2020-04-18 16:00:57,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:57,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547102931] [2020-04-18 16:00:57,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:57,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:00:57,637 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:57,640 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:57,645 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 16:00:57,645 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:57,657 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:57,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 16:00:57,658 INFO L87 Difference]: Start difference. First operand 114 states and 206 transitions. Second operand 5 states. [2020-04-18 16:00:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:57,706 INFO L93 Difference]: Finished difference Result 127 states and 218 transitions. [2020-04-18 16:00:57,706 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 218 transitions. [2020-04-18 16:00:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:57,706 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:00:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash -704732583, now seen corresponding path program 5 times [2020-04-18 16:00:57,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:57,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760178583] [2020-04-18 16:00:57,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:57,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760178583] [2020-04-18 16:00:57,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:57,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 16:00:57,757 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:57,759 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:57,764 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 16:00:57,765 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:57,781 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:57,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:00:57,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-04-18 16:00:57,781 INFO L87 Difference]: Start difference. First operand 127 states and 218 transitions. Second operand 7 states. [2020-04-18 16:00:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:57,916 INFO L93 Difference]: Finished difference Result 129 states and 219 transitions. [2020-04-18 16:00:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 219 transitions. [2020-04-18 16:00:57,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:57,917 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [364422018] [2020-04-18 16:00:57,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:57,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:00:57,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [364422018] [2020-04-18 16:00:57,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 16:00:57,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:57,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 16:00:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-04-18 16:00:57,918 INFO L87 Difference]: Start difference. First operand 13635 states and 44805 transitions. Second operand 8 states. [2020-04-18 16:00:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:58,723 INFO L93 Difference]: Finished difference Result 32335 states and 103485 transitions. [2020-04-18 16:00:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 16:00:58,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-04-18 16:00:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:58,779 INFO L225 Difference]: With dead ends: 32335 [2020-04-18 16:00:58,779 INFO L226 Difference]: Without dead ends: 32283 [2020-04-18 16:00:58,779 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2020-04-18 16:00:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32283 states. [2020-04-18 16:00:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32283 to 13344. [2020-04-18 16:00:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13344 states. [2020-04-18 16:00:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13344 states to 13344 states and 43620 transitions. [2020-04-18 16:00:59,342 INFO L78 Accepts]: Start accepts. Automaton has 13344 states and 43620 transitions. Word has length 22 [2020-04-18 16:00:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:59,342 INFO L479 AbstractCegarLoop]: Abstraction has 13344 states and 43620 transitions. [2020-04-18 16:00:59,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 16:00:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 13344 states and 43620 transitions. [2020-04-18 16:00:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:59,344 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:59,344 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:59,344 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -704227934, now seen corresponding path program 1 times [2020-04-18 16:00:59,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:59,345 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [325051427] [2020-04-18 16:00:59,345 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:59,347 INFO L259 McrAutomatonBuilder]: Finished intersection with 114 states and 240 transitions. [2020-04-18 16:00:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2020-04-18 16:00:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:59,348 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1041385864, now seen corresponding path program 2 times [2020-04-18 16:00:59,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:59,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704438013] [2020-04-18 16:00:59,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:59,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704438013] [2020-04-18 16:00:59,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:59,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:59,377 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:59,379 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:59,390 INFO L259 McrAutomatonBuilder]: Finished intersection with 81 states and 155 transitions. [2020-04-18 16:00:59,390 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:59,396 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:59,396 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2020-04-18 16:00:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:59,405 INFO L93 Difference]: Finished difference Result 133 states and 261 transitions. [2020-04-18 16:00:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 261 transitions. [2020-04-18 16:00:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:59,406 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:59,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1509959390, now seen corresponding path program 3 times [2020-04-18 16:00:59,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:59,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376401141] [2020-04-18 16:00:59,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:00:59,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376401141] [2020-04-18 16:00:59,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:59,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:59,432 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:59,434 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:59,443 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 94 transitions. [2020-04-18 16:00:59,443 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:59,466 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 16:00:59,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 16:00:59,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:59,467 INFO L87 Difference]: Start difference. First operand 133 states and 261 transitions. Second operand 6 states. [2020-04-18 16:00:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:59,538 INFO L93 Difference]: Finished difference Result 139 states and 268 transitions. [2020-04-18 16:00:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 268 transitions. [2020-04-18 16:00:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:59,539 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:00:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -476794784, now seen corresponding path program 4 times [2020-04-18 16:00:59,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:59,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890028158] [2020-04-18 16:00:59,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:59,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890028158] [2020-04-18 16:00:59,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:59,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:00:59,585 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:59,587 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:59,592 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 16:00:59,592 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:59,617 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:59,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 16:00:59,618 INFO L87 Difference]: Start difference. First operand 139 states and 268 transitions. Second operand 5 states. [2020-04-18 16:00:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:59,676 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-04-18 16:00:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 280 transitions. [2020-04-18 16:00:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:00:59,676 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:00:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash -704227934, now seen corresponding path program 5 times [2020-04-18 16:00:59,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:59,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003115488] [2020-04-18 16:00:59,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:00:59,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003115488] [2020-04-18 16:00:59,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:59,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 16:00:59,729 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:59,731 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:59,734 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 16:00:59,735 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:59,752 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:00:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 16:00:59,752 INFO L87 Difference]: Start difference. First operand 152 states and 280 transitions. Second operand 7 states. [2020-04-18 16:00:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:59,866 INFO L93 Difference]: Finished difference Result 154 states and 281 transitions. [2020-04-18 16:00:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 281 transitions. [2020-04-18 16:00:59,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:59,867 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [325051427] [2020-04-18 16:00:59,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:59,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:00:59,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [325051427] [2020-04-18 16:00:59,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 16:00:59,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:59,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 16:00:59,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 16:00:59,868 INFO L87 Difference]: Start difference. First operand 13344 states and 43620 transitions. Second operand 11 states. [2020-04-18 16:01:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:01,506 INFO L93 Difference]: Finished difference Result 45644 states and 140806 transitions. [2020-04-18 16:01:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 16:01:01,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-04-18 16:01:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:01,598 INFO L225 Difference]: With dead ends: 45644 [2020-04-18 16:01:01,598 INFO L226 Difference]: Without dead ends: 45592 [2020-04-18 16:01:01,599 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=623, Invalid=2133, Unknown=0, NotChecked=0, Total=2756 [2020-04-18 16:01:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45592 states. [2020-04-18 16:01:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45592 to 13053. [2020-04-18 16:01:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13053 states. [2020-04-18 16:01:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13053 states to 13053 states and 42435 transitions. [2020-04-18 16:01:02,115 INFO L78 Accepts]: Start accepts. Automaton has 13053 states and 42435 transitions. Word has length 22 [2020-04-18 16:01:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:02,115 INFO L479 AbstractCegarLoop]: Abstraction has 13053 states and 42435 transitions. [2020-04-18 16:01:02,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 16:01:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 13053 states and 42435 transitions. [2020-04-18 16:01:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:02,116 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:02,116 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:02,116 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:02,117 INFO L82 PathProgramCache]: Analyzing trace with hash 804840611, now seen corresponding path program 1 times [2020-04-18 16:01:02,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:02,117 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [811471022] [2020-04-18 16:01:02,117 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:02,119 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 60 transitions. [2020-04-18 16:01:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-04-18 16:01:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:02,119 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 843384041, now seen corresponding path program 2 times [2020-04-18 16:01:02,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:02,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486873953] [2020-04-18 16:01:02,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 16:01:02,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486873953] [2020-04-18 16:01:02,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:02,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:02,152 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:02,153 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:02,159 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 58 transitions. [2020-04-18 16:01:02,159 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:02,170 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:02,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:02,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:02,171 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2020-04-18 16:01:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:02,174 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-04-18 16:01:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-04-18 16:01:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:02,175 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash 804840611, now seen corresponding path program 3 times [2020-04-18 16:01:02,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:02,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310786611] [2020-04-18 16:01:02,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 16:01:02,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310786611] [2020-04-18 16:01:02,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:02,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:02,210 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:02,212 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:02,216 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 16:01:02,216 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:02,228 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:02,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:01:02,229 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2020-04-18 16:01:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:02,253 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-04-18 16:01:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-04-18 16:01:02,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:02,254 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [811471022] [2020-04-18 16:01:02,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:02,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:01:02,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [811471022] [2020-04-18 16:01:02,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 16:01:02,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:02,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:02,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:02,255 INFO L87 Difference]: Start difference. First operand 13053 states and 42435 transitions. Second operand 5 states. [2020-04-18 16:01:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:02,639 INFO L93 Difference]: Finished difference Result 22796 states and 72726 transitions. [2020-04-18 16:01:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 16:01:02,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-04-18 16:01:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:02,706 INFO L225 Difference]: With dead ends: 22796 [2020-04-18 16:01:02,707 INFO L226 Difference]: Without dead ends: 22772 [2020-04-18 16:01:02,707 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22772 states. [2020-04-18 16:01:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22772 to 14368. [2020-04-18 16:01:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14368 states. [2020-04-18 16:01:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14368 states to 14368 states and 47032 transitions. [2020-04-18 16:01:03,144 INFO L78 Accepts]: Start accepts. Automaton has 14368 states and 47032 transitions. Word has length 22 [2020-04-18 16:01:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:03,144 INFO L479 AbstractCegarLoop]: Abstraction has 14368 states and 47032 transitions. [2020-04-18 16:01:03,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 16:01:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 14368 states and 47032 transitions. [2020-04-18 16:01:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:03,147 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:03,147 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:03,148 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1897376779, now seen corresponding path program 1 times [2020-04-18 16:01:03,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:03,148 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1171699297] [2020-04-18 16:01:03,149 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:03,156 INFO L259 McrAutomatonBuilder]: Finished intersection with 450 states and 1296 transitions. [2020-04-18 16:01:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states. [2020-04-18 16:01:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:03,159 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:03,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1773360957, now seen corresponding path program 2 times [2020-04-18 16:01:03,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:03,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767247815] [2020-04-18 16:01:03,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:03,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767247815] [2020-04-18 16:01:03,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:03,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:03,198 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:03,201 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:03,226 INFO L259 McrAutomatonBuilder]: Finished intersection with 101 states and 190 transitions. [2020-04-18 16:01:03,226 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:03,242 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:03,243 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 3 states. [2020-04-18 16:01:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:03,260 INFO L93 Difference]: Finished difference Result 595 states and 1614 transitions. [2020-04-18 16:01:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1614 transitions. [2020-04-18 16:01:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:03,261 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2029608837, now seen corresponding path program 3 times [2020-04-18 16:01:03,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:03,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026523131] [2020-04-18 16:01:03,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:03,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026523131] [2020-04-18 16:01:03,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:03,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:03,285 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:03,288 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:03,314 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 194 transitions. [2020-04-18 16:01:03,314 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:03,337 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 16:01:03,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:03,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-04-18 16:01:03,337 INFO L87 Difference]: Start difference. First operand 595 states and 1614 transitions. Second operand 5 states. [2020-04-18 16:01:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:03,388 INFO L93 Difference]: Finished difference Result 683 states and 1812 transitions. [2020-04-18 16:01:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1812 transitions. [2020-04-18 16:01:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:03,389 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:03,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:03,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1940213187, now seen corresponding path program 4 times [2020-04-18 16:01:03,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:03,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913189594] [2020-04-18 16:01:03,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:03,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913189594] [2020-04-18 16:01:03,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:03,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:03,425 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:03,428 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:03,446 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 192 transitions. [2020-04-18 16:01:03,446 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:03,464 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:03,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:03,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-04-18 16:01:03,464 INFO L87 Difference]: Start difference. First operand 683 states and 1812 transitions. Second operand 5 states. [2020-04-18 16:01:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:03,555 INFO L93 Difference]: Finished difference Result 941 states and 2380 transitions. [2020-04-18 16:01:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2380 transitions. [2020-04-18 16:01:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:03,557 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1897381399, now seen corresponding path program 5 times [2020-04-18 16:01:03,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:03,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198983827] [2020-04-18 16:01:03,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:03,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198983827] [2020-04-18 16:01:03,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001831640] [2020-04-18 16:01:03,622 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:03,717 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 16:01:03,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:03,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 16:01:03,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:03,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:03,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-04-18 16:01:03,804 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:03,807 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:03,830 INFO L259 McrAutomatonBuilder]: Finished intersection with 86 states and 148 transitions. [2020-04-18 16:01:03,830 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:04,112 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 19 times. [2020-04-18 16:01:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-04-18 16:01:04,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2020-04-18 16:01:04,113 INFO L87 Difference]: Start difference. First operand 941 states and 2380 transitions. Second operand 24 states. [2020-04-18 16:01:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:05,107 INFO L93 Difference]: Finished difference Result 956 states and 2398 transitions. [2020-04-18 16:01:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2398 transitions. [2020-04-18 16:01:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:05,109 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 16:01:05,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:05,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1897376779, now seen corresponding path program 6 times [2020-04-18 16:01:05,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:05,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110443694] [2020-04-18 16:01:05,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:05,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110443694] [2020-04-18 16:01:05,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281089141] [2020-04-18 16:01:05,172 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:05,270 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-04-18 16:01:05,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:05,271 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 16:01:05,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:05,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:05,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 16:01:05,380 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:05,383 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:05,405 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 122 transitions. [2020-04-18 16:01:05,406 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:05,663 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 16:01:05,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-04-18 16:01:05,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2409, Unknown=0, NotChecked=0, Total=2970 [2020-04-18 16:01:05,664 INFO L87 Difference]: Start difference. First operand 956 states and 2398 transitions. Second operand 21 states. [2020-04-18 16:01:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:07,903 INFO L93 Difference]: Finished difference Result 1090 states and 2649 transitions. [2020-04-18 16:01:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2649 transitions. [2020-04-18 16:01:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:07,905 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 16:01:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1360290455, now seen corresponding path program 7 times [2020-04-18 16:01:07,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:07,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6975733] [2020-04-18 16:01:07,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:07,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6975733] [2020-04-18 16:01:07,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285108858] [2020-04-18 16:01:07,982 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:08,090 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:01:08,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:08,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:08,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-04-18 16:01:08,150 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:08,153 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:08,174 INFO L259 McrAutomatonBuilder]: Finished intersection with 70 states and 116 transitions. [2020-04-18 16:01:08,175 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:08,701 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 35 times. [2020-04-18 16:01:08,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-04-18 16:01:08,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=7782, Unknown=0, NotChecked=0, Total=9506 [2020-04-18 16:01:08,702 INFO L87 Difference]: Start difference. First operand 1090 states and 2649 transitions. Second operand 31 states. [2020-04-18 16:01:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:09,876 INFO L93 Difference]: Finished difference Result 1091 states and 2649 transitions. [2020-04-18 16:01:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2649 transitions. [2020-04-18 16:01:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:09,878 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 16:01:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1360285835, now seen corresponding path program 8 times [2020-04-18 16:01:09,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:09,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979968555] [2020-04-18 16:01:09,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:09,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979968555] [2020-04-18 16:01:09,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701882573] [2020-04-18 16:01:09,949 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:10,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-04-18 16:01:10,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:10,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 16:01:10,064 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:10,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:10,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 16:01:10,158 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:10,161 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:10,174 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 16:01:10,174 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:10,515 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 28 times. [2020-04-18 16:01:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-04-18 16:01:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2312, Invalid=11968, Unknown=0, NotChecked=0, Total=14280 [2020-04-18 16:01:10,517 INFO L87 Difference]: Start difference. First operand 1091 states and 2649 transitions. Second operand 31 states. [2020-04-18 16:01:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:13,025 INFO L93 Difference]: Finished difference Result 1217 states and 2944 transitions. [2020-04-18 16:01:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 2944 transitions. [2020-04-18 16:01:13,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:13,028 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1171699297] [2020-04-18 16:01:13,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:13,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 16:01:13,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1171699297] [2020-04-18 16:01:13,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2020-04-18 16:01:13,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2020-04-18 16:01:13,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3411, Invalid=18641, Unknown=0, NotChecked=0, Total=22052 [2020-04-18 16:01:13,030 INFO L87 Difference]: Start difference. First operand 14368 states and 47032 transitions. Second operand 61 states. [2020-04-18 16:01:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:27,761 INFO L93 Difference]: Finished difference Result 52699 states and 161375 transitions. [2020-04-18 16:01:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2020-04-18 16:01:27,761 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 26 [2020-04-18 16:01:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:27,867 INFO L225 Difference]: With dead ends: 52699 [2020-04-18 16:01:27,867 INFO L226 Difference]: Without dead ends: 52633 [2020-04-18 16:01:27,871 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 487 SyntacticMatches, 4 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48402 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=18308, Invalid=105244, Unknown=0, NotChecked=0, Total=123552 [2020-04-18 16:01:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52633 states. [2020-04-18 16:01:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52633 to 14062. [2020-04-18 16:01:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14062 states. [2020-04-18 16:01:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14062 states to 14062 states and 46098 transitions. [2020-04-18 16:01:28,638 INFO L78 Accepts]: Start accepts. Automaton has 14062 states and 46098 transitions. Word has length 26 [2020-04-18 16:01:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:28,639 INFO L479 AbstractCegarLoop]: Abstraction has 14062 states and 46098 transitions. [2020-04-18 16:01:28,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 61 states. [2020-04-18 16:01:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14062 states and 46098 transitions. [2020-04-18 16:01:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:28,641 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:28,641 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:29,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:29,444 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash 580831221, now seen corresponding path program 1 times [2020-04-18 16:01:29,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:29,445 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1544748986] [2020-04-18 16:01:29,446 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:29,453 INFO L259 McrAutomatonBuilder]: Finished intersection with 410 states and 1164 transitions. [2020-04-18 16:01:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2020-04-18 16:01:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:29,457 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:29,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1773301651, now seen corresponding path program 2 times [2020-04-18 16:01:29,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:29,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244506390] [2020-04-18 16:01:29,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:29,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244506390] [2020-04-18 16:01:29,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:29,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:29,473 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:29,477 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:29,501 INFO L259 McrAutomatonBuilder]: Finished intersection with 101 states and 190 transitions. [2020-04-18 16:01:29,502 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:29,508 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:29,509 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2020-04-18 16:01:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:29,527 INFO L93 Difference]: Finished difference Result 535 states and 1426 transitions. [2020-04-18 16:01:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1426 transitions. [2020-04-18 16:01:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:29,528 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:29,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2029668143, now seen corresponding path program 3 times [2020-04-18 16:01:29,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:29,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157108274] [2020-04-18 16:01:29,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:29,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157108274] [2020-04-18 16:01:29,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:29,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:29,550 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:29,553 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:29,580 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 194 transitions. [2020-04-18 16:01:29,580 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:29,608 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 16:01:29,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:29,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-04-18 16:01:29,609 INFO L87 Difference]: Start difference. First operand 535 states and 1426 transitions. Second operand 5 states. [2020-04-18 16:01:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:29,670 INFO L93 Difference]: Finished difference Result 591 states and 1544 transitions. [2020-04-18 16:01:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1544 transitions. [2020-04-18 16:01:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:29,671 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash -734655335, now seen corresponding path program 4 times [2020-04-18 16:01:29,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:29,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811253311] [2020-04-18 16:01:29,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:29,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811253311] [2020-04-18 16:01:29,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:29,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:29,733 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:29,737 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:29,762 INFO L259 McrAutomatonBuilder]: Finished intersection with 78 states and 136 transitions. [2020-04-18 16:01:29,762 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:29,796 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:29,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:29,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-04-18 16:01:29,797 INFO L87 Difference]: Start difference. First operand 591 states and 1544 transitions. Second operand 5 states. [2020-04-18 16:01:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:29,933 INFO L93 Difference]: Finished difference Result 789 states and 1948 transitions. [2020-04-18 16:01:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1948 transitions. [2020-04-18 16:01:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:29,935 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash 808752741, now seen corresponding path program 5 times [2020-04-18 16:01:29,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:29,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091162151] [2020-04-18 16:01:29,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:30,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091162151] [2020-04-18 16:01:30,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129023778] [2020-04-18 16:01:30,007 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:30,163 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 16:01:30,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:30,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 16:01:30,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:30,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:30,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-04-18 16:01:30,274 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:30,278 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:30,295 INFO L259 McrAutomatonBuilder]: Finished intersection with 62 states and 96 transitions. [2020-04-18 16:01:30,295 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:30,401 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:30,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 16:01:30,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-04-18 16:01:30,402 INFO L87 Difference]: Start difference. First operand 789 states and 1948 transitions. Second operand 13 states. [2020-04-18 16:01:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:31,021 INFO L93 Difference]: Finished difference Result 920 states and 2170 transitions. [2020-04-18 16:01:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2170 transitions. [2020-04-18 16:01:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:31,023 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 16:01:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash 580831221, now seen corresponding path program 6 times [2020-04-18 16:01:31,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:31,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638398607] [2020-04-18 16:01:31,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:31,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638398607] [2020-04-18 16:01:31,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243688970] [2020-04-18 16:01:31,104 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:31,229 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2020-04-18 16:01:31,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:31,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 16:01:31,237 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:31,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:31,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 16:01:31,339 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:31,342 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:31,356 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 16:01:31,356 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:31,472 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 16:01:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 16:01:31,473 INFO L87 Difference]: Start difference. First operand 920 states and 2170 transitions. Second operand 17 states. [2020-04-18 16:01:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:33,008 INFO L93 Difference]: Finished difference Result 996 states and 2288 transitions. [2020-04-18 16:01:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 2288 transitions. [2020-04-18 16:01:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:33,010 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 16:01:33,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:33,011 INFO L82 PathProgramCache]: Analyzing trace with hash 431465991, now seen corresponding path program 7 times [2020-04-18 16:01:33,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:33,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434238112] [2020-04-18 16:01:33,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:33,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434238112] [2020-04-18 16:01:33,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:33,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 16:01:33,100 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:33,103 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:33,111 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 16:01:33,112 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:33,166 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:33,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:01:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=920, Invalid=3772, Unknown=0, NotChecked=0, Total=4692 [2020-04-18 16:01:33,166 INFO L87 Difference]: Start difference. First operand 996 states and 2288 transitions. Second operand 7 states. [2020-04-18 16:01:33,553 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-04-18 16:01:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:33,685 INFO L93 Difference]: Finished difference Result 1083 states and 2453 transitions. [2020-04-18 16:01:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2453 transitions. [2020-04-18 16:01:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:33,687 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 16:01:33,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash 431445621, now seen corresponding path program 8 times [2020-04-18 16:01:33,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:33,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269703261] [2020-04-18 16:01:33,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:33,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269703261] [2020-04-18 16:01:33,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:33,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 16:01:33,750 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:33,753 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:33,760 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 16:01:33,761 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:33,761 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 16:01:33,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1060, Invalid=4792, Unknown=0, NotChecked=0, Total=5852 [2020-04-18 16:01:33,762 INFO L87 Difference]: Start difference. First operand 1083 states and 2453 transitions. Second operand 9 states. [2020-04-18 16:01:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:34,369 INFO L93 Difference]: Finished difference Result 1107 states and 2493 transitions. [2020-04-18 16:01:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 2493 transitions. [2020-04-18 16:01:34,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:34,371 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1544748986] [2020-04-18 16:01:34,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:34,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 16:01:34,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1544748986] [2020-04-18 16:01:34,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-04-18 16:01:34,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:34,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-04-18 16:01:34,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1348, Invalid=6842, Unknown=0, NotChecked=0, Total=8190 [2020-04-18 16:01:34,373 INFO L87 Difference]: Start difference. First operand 14062 states and 46098 transitions. Second operand 26 states. [2020-04-18 16:01:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:41,975 INFO L93 Difference]: Finished difference Result 54505 states and 167344 transitions. [2020-04-18 16:01:41,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2020-04-18 16:01:41,975 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2020-04-18 16:01:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:42,076 INFO L225 Difference]: With dead ends: 54505 [2020-04-18 16:01:42,077 INFO L226 Difference]: Without dead ends: 54388 [2020-04-18 16:01:42,078 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16078 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5590, Invalid=35012, Unknown=0, NotChecked=0, Total=40602 [2020-04-18 16:01:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54388 states. [2020-04-18 16:01:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54388 to 13489. [2020-04-18 16:01:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13489 states. [2020-04-18 16:01:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13489 states to 13489 states and 44110 transitions. [2020-04-18 16:01:42,677 INFO L78 Accepts]: Start accepts. Automaton has 13489 states and 44110 transitions. Word has length 26 [2020-04-18 16:01:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:42,677 INFO L479 AbstractCegarLoop]: Abstraction has 13489 states and 44110 transitions. [2020-04-18 16:01:42,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-04-18 16:01:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13489 states and 44110 transitions. [2020-04-18 16:01:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:42,680 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:42,680 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:43,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:43,081 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:43,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2090404415, now seen corresponding path program 1 times [2020-04-18 16:01:43,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:43,083 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1057328529] [2020-04-18 16:01:43,084 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:43,088 INFO L259 McrAutomatonBuilder]: Finished intersection with 170 states and 372 transitions. [2020-04-18 16:01:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2020-04-18 16:01:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:43,090 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 360227405, now seen corresponding path program 2 times [2020-04-18 16:01:43,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:43,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656555101] [2020-04-18 16:01:43,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 16:01:43,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656555101] [2020-04-18 16:01:43,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:43,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:43,121 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:43,124 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:43,146 INFO L259 McrAutomatonBuilder]: Finished intersection with 117 states and 230 transitions. [2020-04-18 16:01:43,146 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:43,157 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:43,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:43,158 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2020-04-18 16:01:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:43,168 INFO L93 Difference]: Finished difference Result 205 states and 421 transitions. [2020-04-18 16:01:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 421 transitions. [2020-04-18 16:01:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:43,169 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -131770097, now seen corresponding path program 3 times [2020-04-18 16:01:43,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:43,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407316825] [2020-04-18 16:01:43,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-04-18 16:01:43,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407316825] [2020-04-18 16:01:43,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:43,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:43,210 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:43,213 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:43,240 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 188 transitions. [2020-04-18 16:01:43,240 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:43,257 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:43,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:43,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:01:43,258 INFO L87 Difference]: Start difference. First operand 205 states and 421 transitions. Second operand 5 states. [2020-04-18 16:01:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:43,314 INFO L93 Difference]: Finished difference Result 217 states and 433 transitions. [2020-04-18 16:01:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 433 transitions. [2020-04-18 16:01:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:43,315 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:43,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2090404415, now seen corresponding path program 4 times [2020-04-18 16:01:43,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:43,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228696170] [2020-04-18 16:01:43,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-04-18 16:01:43,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228696170] [2020-04-18 16:01:43,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668589104] [2020-04-18 16:01:43,382 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:43,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:01:43,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:43,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:01:43,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:43,831 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-04-18 16:01:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-04-18 16:01:43,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:43,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:01:43,875 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:43,878 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:43,892 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 122 transitions. [2020-04-18 16:01:43,892 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:43,947 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:43,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 16:01:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 16:01:43,947 INFO L87 Difference]: Start difference. First operand 217 states and 433 transitions. Second operand 12 states. [2020-04-18 16:01:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:44,117 INFO L93 Difference]: Finished difference Result 219 states and 434 transitions. [2020-04-18 16:01:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 434 transitions. [2020-04-18 16:01:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:44,118 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash 954294029, now seen corresponding path program 5 times [2020-04-18 16:01:44,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:44,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038169253] [2020-04-18 16:01:44,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-04-18 16:01:44,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038169253] [2020-04-18 16:01:44,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:44,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:44,151 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:44,154 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:44,165 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 52 transitions. [2020-04-18 16:01:44,165 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:44,188 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:44,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:44,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:01:44,189 INFO L87 Difference]: Start difference. First operand 219 states and 434 transitions. Second operand 3 states. [2020-04-18 16:01:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:44,195 INFO L93 Difference]: Finished difference Result 229 states and 443 transitions. [2020-04-18 16:01:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 443 transitions. [2020-04-18 16:01:44,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:44,196 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1057328529] [2020-04-18 16:01:44,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:44,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:01:44,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1057328529] [2020-04-18 16:01:44,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 16:01:44,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:44,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 16:01:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:01:44,198 INFO L87 Difference]: Start difference. First operand 13489 states and 44110 transitions. Second operand 13 states. [2020-04-18 16:01:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:45,252 INFO L93 Difference]: Finished difference Result 29156 states and 92023 transitions. [2020-04-18 16:01:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 16:01:45,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 16:01:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:45,313 INFO L225 Difference]: With dead ends: 29156 [2020-04-18 16:01:45,314 INFO L226 Difference]: Without dead ends: 29120 [2020-04-18 16:01:45,314 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 16:01:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2020-04-18 16:01:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 13418. [2020-04-18 16:01:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13418 states. [2020-04-18 16:01:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13418 states to 13418 states and 43847 transitions. [2020-04-18 16:01:45,707 INFO L78 Accepts]: Start accepts. Automaton has 13418 states and 43847 transitions. Word has length 26 [2020-04-18 16:01:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:45,708 INFO L479 AbstractCegarLoop]: Abstraction has 13418 states and 43847 transitions. [2020-04-18 16:01:45,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 16:01:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 13418 states and 43847 transitions. [2020-04-18 16:01:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:45,710 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:45,710 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:45,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:45,911 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1259126849, now seen corresponding path program 1 times [2020-04-18 16:01:45,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:45,912 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [300069320] [2020-04-18 16:01:45,913 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:45,917 INFO L259 McrAutomatonBuilder]: Finished intersection with 138 states and 292 transitions. [2020-04-18 16:01:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2020-04-18 16:01:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:45,918 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:45,919 INFO L82 PathProgramCache]: Analyzing trace with hash -274585011, now seen corresponding path program 2 times [2020-04-18 16:01:45,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:45,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528160695] [2020-04-18 16:01:45,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 16:01:45,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528160695] [2020-04-18 16:01:45,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:45,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:45,932 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:45,934 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:45,946 INFO L259 McrAutomatonBuilder]: Finished intersection with 85 states and 160 transitions. [2020-04-18 16:01:45,946 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:45,951 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:45,952 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2020-04-18 16:01:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:45,962 INFO L93 Difference]: Finished difference Result 165 states and 329 transitions. [2020-04-18 16:01:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 329 transitions. [2020-04-18 16:01:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:45,963 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:45,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash -408826367, now seen corresponding path program 3 times [2020-04-18 16:01:45,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:45,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55508799] [2020-04-18 16:01:45,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:01:45,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55508799] [2020-04-18 16:01:45,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:45,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:45,997 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:45,999 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:46,010 INFO L259 McrAutomatonBuilder]: Finished intersection with 49 states and 69 transitions. [2020-04-18 16:01:46,010 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:46,024 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:46,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:46,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 16:01:46,024 INFO L87 Difference]: Start difference. First operand 165 states and 329 transitions. Second operand 3 states. [2020-04-18 16:01:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:46,030 INFO L93 Difference]: Finished difference Result 174 states and 338 transitions. [2020-04-18 16:01:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 338 transitions. [2020-04-18 16:01:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:46,031 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1259114219, now seen corresponding path program 4 times [2020-04-18 16:01:46,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:46,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118842150] [2020-04-18 16:01:46,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:01:46,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118842150] [2020-04-18 16:01:46,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125633973] [2020-04-18 16:01:46,076 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:46,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:01:46,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:46,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 16:01:46,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:01:46,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:46,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 16:01:46,214 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:46,216 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:46,232 INFO L259 McrAutomatonBuilder]: Finished intersection with 78 states and 136 transitions. [2020-04-18 16:01:46,232 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:46,410 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 25 times. [2020-04-18 16:01:46,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 16:01:46,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2020-04-18 16:01:46,411 INFO L87 Difference]: Start difference. First operand 174 states and 338 transitions. Second operand 17 states. [2020-04-18 16:01:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:46,574 INFO L93 Difference]: Finished difference Result 187 states and 350 transitions. [2020-04-18 16:01:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 350 transitions. [2020-04-18 16:01:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:46,574 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1259126849, now seen corresponding path program 5 times [2020-04-18 16:01:46,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:46,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614312850] [2020-04-18 16:01:46,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:01:46,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614312850] [2020-04-18 16:01:46,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022125726] [2020-04-18 16:01:46,650 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:46,763 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-04-18 16:01:46,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:46,764 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:01:46,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2020-04-18 16:01:47,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:47,207 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-18 16:01:47,215 WARN L228 ceAbstractionStarter]: Timeout [2020-04-18 16:01:47,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 04:01:47 BasicIcfg [2020-04-18 16:01:47,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 16:01:47,217 INFO L168 Benchmark]: Toolchain (without parser) took 203584.72 ms. Allocated memory was 137.9 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2020-04-18 16:01:47,220 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-04-18 16:01:47,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.51 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 159.8 MB in the end (delta: -60.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-04-18 16:01:47,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.19 ms. Allocated memory is still 201.9 MB. Free memory was 159.8 MB in the beginning and 157.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-04-18 16:01:47,221 INFO L168 Benchmark]: Boogie Preprocessor took 61.76 ms. Allocated memory is still 201.9 MB. Free memory was 157.8 MB in the beginning and 155.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-04-18 16:01:47,221 INFO L168 Benchmark]: RCFGBuilder took 556.88 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 132.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-04-18 16:01:47,221 INFO L168 Benchmark]: TraceAbstraction took 202210.99 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 132.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2020-04-18 16:01:47,223 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 650.51 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 159.8 MB in the end (delta: -60.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.19 ms. Allocated memory is still 201.9 MB. Free memory was 159.8 MB in the beginning and 157.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.76 ms. Allocated memory is still 201.9 MB. Free memory was 157.8 MB in the beginning and 155.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 556.88 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 132.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 202210.99 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 132.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 77 ProgramPointsBefore, 18 ProgramPointsAfterwards, 76 TransitionsBefore, 12 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 13 ConcurrentYvCompositions, 5 ChoiceCompositions, 716 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1089 CheckedPairsTotal, 77 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 107 ProgramPointsBefore, 36 ProgramPointsAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 2844 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 1556 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3611 CheckedPairsTotal, 94 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 137 ProgramPointsBefore, 49 ProgramPointsAfterwards, 134 TransitionsBefore, 38 TransitionsAfterwards, 5130 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 15 ConcurrentYvCompositions, 8 ChoiceCompositions, 2775 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 7576 CheckedPairsTotal, 120 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 167 ProgramPointsBefore, 59 ProgramPointsAfterwards, 163 TransitionsBefore, 45 TransitionsAfterwards, 8100 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 4127 VarBasedMoverChecksPositive, 47 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 11405 CheckedPairsTotal, 148 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 197 ProgramPointsBefore, 73 ProgramPointsAfterwards, 192 TransitionsBefore, 56 TransitionsAfterwards, 11754 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 26 ConcurrentYvCompositions, 12 ChoiceCompositions, 6175 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 17538 CheckedPairsTotal, 176 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 71 locations, 1 error locations. Started 5 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 201.8s, OverallIterations: 39, TraceHistogramMax: 5, AutomataDifference: 72.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.3s, HoareTripleCheckerStatistics: 1601 SDtfs, 14183 SDslu, 9701 SDs, 0 SdLazy, 19255 SolverSat, 3712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3945 GetRequests, 2729 SyntacticMatches, 4 SemanticMatches, 1212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74346 ImplicationChecksByTransitivity, 26.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127498occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 481825 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown