/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:16:14,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:16:14,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:16:14,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:16:14,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:16:14,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:16:14,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:16:14,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:16:14,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:16:14,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:16:14,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:16:14,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:16:14,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:16:14,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:16:14,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:16:14,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:16:14,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:16:14,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:16:14,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:16:14,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:16:14,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:16:14,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:16:14,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:16:14,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:16:14,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:16:14,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:16:14,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:16:14,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:16:14,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:16:14,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:16:14,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:16:14,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:16:14,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:16:14,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:16:14,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:16:14,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:16:14,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:16:14,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:16:14,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:16:14,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:16:14,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:16:14,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:16:14,486 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:16:14,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:16:14,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:16:14,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:16:14,488 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:16:14,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:16:14,489 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:16:14,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:16:14,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:16:14,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:16:14,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:16:14,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:16:14,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:16:14,490 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:16:14,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:16:14,490 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:16:14,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:16:14,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:16:14,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:16:14,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:16:14,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:16:14,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:16:14,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:16:14,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:16:14,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:16:14,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:16:14,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:16:14,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:16:14,493 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:16:14,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:16:14,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:16:14,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:16:14,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:16:14,778 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:16:14,778 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:16:14,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-18 15:16:14,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6ae6362/be0a847df82e4686b6f400312ae245c2/FLAG81d3d970a [2019-12-18 15:16:15,435 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:16:15,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-18 15:16:15,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6ae6362/be0a847df82e4686b6f400312ae245c2/FLAG81d3d970a [2019-12-18 15:16:15,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6ae6362/be0a847df82e4686b6f400312ae245c2 [2019-12-18 15:16:15,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:16:15,696 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:16:15,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:16:15,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:16:15,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:16:15,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:16:15" (1/1) ... [2019-12-18 15:16:15,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bb29ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:15, skipping insertion in model container [2019-12-18 15:16:15,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:16:15" (1/1) ... [2019-12-18 15:16:15,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:16:15,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:16:16,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:16:16,253 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:16:16,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:16:16,381 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:16:16,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16 WrapperNode [2019-12-18 15:16:16,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:16:16,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:16:16,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:16:16,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:16:16,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:16:16,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:16:16,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:16:16,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:16:16,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... [2019-12-18 15:16:16,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:16:16,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:16:16,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:16:16,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:16:16,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:16:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-18 15:16:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-18 15:16:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 15:16:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 15:16:16,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:16:16,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:16:16,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:16:16,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:16:16,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:16:16,522 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:16:16,872 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:16:16,873 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-18 15:16:16,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:16:16 BoogieIcfgContainer [2019-12-18 15:16:16,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:16:16,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:16:16,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:16:16,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:16:16,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:16:15" (1/3) ... [2019-12-18 15:16:16,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bac164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:16:16, skipping insertion in model container [2019-12-18 15:16:16,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:16:16" (2/3) ... [2019-12-18 15:16:16,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bac164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:16:16, skipping insertion in model container [2019-12-18 15:16:16,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:16:16" (3/3) ... [2019-12-18 15:16:16,882 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-1.i [2019-12-18 15:16:16,893 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:16:16,893 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:16:16,900 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 15:16:16,901 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:16:16,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,941 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,941 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,941 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,942 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,942 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,943 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,946 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,948 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,948 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,948 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,957 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,958 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,958 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,958 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,964 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,965 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,965 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,965 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,965 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:16,979 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 15:16:16,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:16:16,996 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:16:16,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:16:16,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:16:16,996 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:16:16,996 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:16:16,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:16:16,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:16:17,011 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions [2019-12-18 15:16:17,013 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-18 15:16:17,088 INFO L126 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-18 15:16:17,088 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:16:17,095 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs. 8/68 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 15:16:17,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-18 15:16:17,119 INFO L126 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-18 15:16:17,120 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:16:17,121 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs. 8/68 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 15:16:17,123 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-18 15:16:17,125 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:16:18,510 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-18 15:16:18,798 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-18 15:16:18,871 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-18 15:16:18,871 INFO L214 etLargeBlockEncoding]: Total number of compositions: 47 [2019-12-18 15:16:18,882 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-18 15:16:18,893 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-18 15:16:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-18 15:16:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:16:18,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:18,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:16:18,904 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:18,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash 219913, now seen corresponding path program 1 times [2019-12-18 15:16:18,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:18,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495153768] [2019-12-18 15:16:18,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:19,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495153768] [2019-12-18 15:16:19,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:19,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:16:19,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318920727] [2019-12-18 15:16:19,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:16:19,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:19,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:16:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:16:19,186 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-18 15:16:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:19,226 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-18 15:16:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:16:19,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:16:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:19,239 INFO L225 Difference]: With dead ends: 35 [2019-12-18 15:16:19,239 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 15:16:19,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:16:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 15:16:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-18 15:16:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 15:16:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-18 15:16:19,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-18 15:16:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:19,279 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-18 15:16:19,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:16:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-18 15:16:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:16:19,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:19,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:19,281 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1212750904, now seen corresponding path program 1 times [2019-12-18 15:16:19,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:19,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822476664] [2019-12-18 15:16:19,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:19,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822476664] [2019-12-18 15:16:19,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:19,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:16:19,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117265339] [2019-12-18 15:16:19,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:16:19,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:19,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:16:19,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:16:19,418 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-18 15:16:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:19,445 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-18 15:16:19,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:16:19,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 15:16:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:19,448 INFO L225 Difference]: With dead ends: 26 [2019-12-18 15:16:19,448 INFO L226 Difference]: Without dead ends: 24 [2019-12-18 15:16:19,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:16:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-18 15:16:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-18 15:16:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 15:16:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-18 15:16:19,454 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-18 15:16:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:19,454 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-18 15:16:19,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:16:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-18 15:16:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 15:16:19,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:19,455 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:19,455 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1059432955, now seen corresponding path program 1 times [2019-12-18 15:16:19,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:19,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212468618] [2019-12-18 15:16:19,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:16:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:16:19,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:16:19,530 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:16:19,530 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:16:19,530 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 15:16:19,545 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,546 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,546 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,546 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,546 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,546 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,546 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,547 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,547 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,547 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,547 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,547 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,547 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,547 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,547 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,548 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,548 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,548 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,550 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,551 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,551 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,552 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,552 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,552 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,552 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,552 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,552 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,552 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,553 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,553 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,553 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,557 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,557 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,557 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,558 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,558 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,558 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,559 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,560 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,560 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,560 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,560 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,560 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:19,562 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 15:16:19,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:16:19,562 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:16:19,563 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:16:19,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:16:19,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:16:19,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:16:19,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:16:19,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:16:19,565 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 74 transitions [2019-12-18 15:16:19,566 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-18 15:16:19,585 INFO L126 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-18 15:16:19,585 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:16:19,587 INFO L76 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 88 events. 4/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs. 20/100 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2019-12-18 15:16:19,591 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-18 15:16:19,607 INFO L126 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-18 15:16:19,608 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:16:19,610 INFO L76 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 88 events. 4/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs. 20/100 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2019-12-18 15:16:19,613 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-18 15:16:19,613 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:16:21,142 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-18 15:16:21,214 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1223 [2019-12-18 15:16:21,214 INFO L214 etLargeBlockEncoding]: Total number of compositions: 61 [2019-12-18 15:16:21,214 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-18 15:16:21,227 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-18 15:16:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-18 15:16:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:16:21,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:21,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:16:21,228 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 374327, now seen corresponding path program 1 times [2019-12-18 15:16:21,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:21,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760810568] [2019-12-18 15:16:21,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:21,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760810568] [2019-12-18 15:16:21,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:21,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:16:21,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845551356] [2019-12-18 15:16:21,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:16:21,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:21,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:16:21,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:16:21,271 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-18 15:16:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:21,305 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-18 15:16:21,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:16:21,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:16:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:21,311 INFO L225 Difference]: With dead ends: 185 [2019-12-18 15:16:21,311 INFO L226 Difference]: Without dead ends: 171 [2019-12-18 15:16:21,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:16:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-18 15:16:21,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-18 15:16:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-18 15:16:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-18 15:16:21,338 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-18 15:16:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:21,338 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-18 15:16:21,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:16:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-18 15:16:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:16:21,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:21,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:21,339 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash -857862729, now seen corresponding path program 1 times [2019-12-18 15:16:21,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:21,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747497108] [2019-12-18 15:16:21,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:21,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747497108] [2019-12-18 15:16:21,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:21,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:16:21,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157530982] [2019-12-18 15:16:21,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:16:21,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:16:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:16:21,398 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-18 15:16:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:21,528 INFO L93 Difference]: Finished difference Result 224 states and 491 transitions. [2019-12-18 15:16:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:16:21,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:16:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:21,532 INFO L225 Difference]: With dead ends: 224 [2019-12-18 15:16:21,532 INFO L226 Difference]: Without dead ends: 221 [2019-12-18 15:16:21,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:16:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-18 15:16:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2019-12-18 15:16:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 15:16:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-18 15:16:21,552 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-18 15:16:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:21,552 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-18 15:16:21,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:16:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-18 15:16:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:16:21,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:21,554 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:21,554 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:21,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash -924776041, now seen corresponding path program 1 times [2019-12-18 15:16:21,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:21,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696600823] [2019-12-18 15:16:21,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:16:21,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696600823] [2019-12-18 15:16:21,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:21,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:16:21,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033430780] [2019-12-18 15:16:21,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:16:21,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:21,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:16:21,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:16:21,611 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-18 15:16:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:21,705 INFO L93 Difference]: Finished difference Result 213 states and 458 transitions. [2019-12-18 15:16:21,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:16:21,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:16:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:21,709 INFO L225 Difference]: With dead ends: 213 [2019-12-18 15:16:21,709 INFO L226 Difference]: Without dead ends: 209 [2019-12-18 15:16:21,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:16:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-18 15:16:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2019-12-18 15:16:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-18 15:16:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-18 15:16:21,723 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-18 15:16:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:21,725 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-18 15:16:21,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:16:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-18 15:16:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:16:21,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:21,726 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:21,727 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:21,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1393798314, now seen corresponding path program 1 times [2019-12-18 15:16:21,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:21,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688924069] [2019-12-18 15:16:21,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:16:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:16:21,763 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:16:21,763 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:16:21,763 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:16:21,764 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 15:16:21,773 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,773 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,774 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,774 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,775 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,775 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,775 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,775 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,775 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,776 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,776 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,776 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,776 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,776 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,776 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,777 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,777 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,777 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,777 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,777 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,777 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,778 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,778 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,779 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,779 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,780 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,780 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,783 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,783 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,784 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,784 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,784 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,785 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,785 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,785 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,785 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,786 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,786 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,788 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,788 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,788 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,789 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,789 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,790 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,791 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,791 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,791 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,791 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,793 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,797 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,798 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:21,801 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:16:21,801 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:16:21,801 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:16:21,801 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:16:21,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:16:21,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:16:21,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:16:21,802 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:16:21,802 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:16:21,804 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 92 transitions [2019-12-18 15:16:21,804 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-18 15:16:21,837 INFO L126 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-18 15:16:21,838 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:16:21,840 INFO L76 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 5/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs. 36/136 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2019-12-18 15:16:21,844 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-18 15:16:21,877 INFO L126 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-18 15:16:21,878 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:16:21,880 INFO L76 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 5/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs. 36/136 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2019-12-18 15:16:21,884 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-18 15:16:21,884 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:16:23,378 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-18 15:16:23,660 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-18 15:16:23,786 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1840 [2019-12-18 15:16:23,786 INFO L214 etLargeBlockEncoding]: Total number of compositions: 80 [2019-12-18 15:16:23,786 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-18 15:16:23,810 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-18 15:16:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-18 15:16:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:16:23,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:23,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:16:23,811 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash 564387, now seen corresponding path program 1 times [2019-12-18 15:16:23,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:23,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993388951] [2019-12-18 15:16:23,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:23,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993388951] [2019-12-18 15:16:23,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:23,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:16:23,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248878160] [2019-12-18 15:16:23,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:16:23,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:23,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:16:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:16:23,837 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-18 15:16:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:23,876 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-18 15:16:23,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:16:23,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:16:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:23,885 INFO L225 Difference]: With dead ends: 600 [2019-12-18 15:16:23,885 INFO L226 Difference]: Without dead ends: 559 [2019-12-18 15:16:23,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:16:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-18 15:16:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-18 15:16:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 15:16:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-18 15:16:23,937 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-18 15:16:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:23,937 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-18 15:16:23,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:16:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-18 15:16:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:16:23,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:23,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:23,938 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227938, now seen corresponding path program 1 times [2019-12-18 15:16:23,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:23,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795355399] [2019-12-18 15:16:23,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:23,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795355399] [2019-12-18 15:16:23,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:23,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:16:23,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753778040] [2019-12-18 15:16:23,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:16:23,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:16:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:16:23,982 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-18 15:16:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:24,087 INFO L93 Difference]: Finished difference Result 918 states and 2567 transitions. [2019-12-18 15:16:24,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:16:24,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:16:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:24,095 INFO L225 Difference]: With dead ends: 918 [2019-12-18 15:16:24,095 INFO L226 Difference]: Without dead ends: 915 [2019-12-18 15:16:24,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:16:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-18 15:16:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 576. [2019-12-18 15:16:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 15:16:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-18 15:16:24,121 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-18 15:16:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:24,121 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-18 15:16:24,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:16:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-18 15:16:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:16:24,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:24,123 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:24,123 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:24,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:24,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1126341274, now seen corresponding path program 1 times [2019-12-18 15:16:24,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:24,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322823863] [2019-12-18 15:16:24,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:16:24,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322823863] [2019-12-18 15:16:24,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:24,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:16:24,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278739186] [2019-12-18 15:16:24,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:16:24,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:24,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:16:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:16:24,183 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-18 15:16:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:24,327 INFO L93 Difference]: Finished difference Result 952 states and 2666 transitions. [2019-12-18 15:16:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:16:24,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:16:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:24,334 INFO L225 Difference]: With dead ends: 952 [2019-12-18 15:16:24,334 INFO L226 Difference]: Without dead ends: 948 [2019-12-18 15:16:24,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:16:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-18 15:16:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 605. [2019-12-18 15:16:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 15:16:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-18 15:16:24,358 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-18 15:16:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:24,359 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-18 15:16:24,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:16:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-18 15:16:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:16:24,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:24,360 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:24,360 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:24,361 INFO L82 PathProgramCache]: Analyzing trace with hash -821622243, now seen corresponding path program 1 times [2019-12-18 15:16:24,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:24,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634362394] [2019-12-18 15:16:24,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:24,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634362394] [2019-12-18 15:16:24,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694452714] [2019-12-18 15:16:24,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:24,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:24,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:24,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:24,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:16:24,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739071749] [2019-12-18 15:16:24,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:16:24,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:16:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:16:24,745 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 18 states. [2019-12-18 15:16:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:25,743 INFO L93 Difference]: Finished difference Result 1315 states and 3284 transitions. [2019-12-18 15:16:25,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:16:25,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:16:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:25,752 INFO L225 Difference]: With dead ends: 1315 [2019-12-18 15:16:25,752 INFO L226 Difference]: Without dead ends: 1310 [2019-12-18 15:16:25,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 15:16:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-18 15:16:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 591. [2019-12-18 15:16:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-12-18 15:16:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1849 transitions. [2019-12-18 15:16:25,780 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1849 transitions. Word has length 15 [2019-12-18 15:16:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:25,780 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 1849 transitions. [2019-12-18 15:16:25,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:16:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1849 transitions. [2019-12-18 15:16:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:16:25,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:25,782 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:25,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:25,986 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash 82199709, now seen corresponding path program 2 times [2019-12-18 15:16:25,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:25,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486532718] [2019-12-18 15:16:25,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:26,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486532718] [2019-12-18 15:16:26,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827870605] [2019-12-18 15:16:26,103 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:26,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:16:26,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:26,182 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:26,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:26,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:26,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:16:26,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815183798] [2019-12-18 15:16:26,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:16:26,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:26,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:16:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:16:26,281 INFO L87 Difference]: Start difference. First operand 591 states and 1849 transitions. Second operand 18 states. [2019-12-18 15:16:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:27,172 INFO L93 Difference]: Finished difference Result 1803 states and 4638 transitions. [2019-12-18 15:16:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:16:27,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:16:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:27,184 INFO L225 Difference]: With dead ends: 1803 [2019-12-18 15:16:27,184 INFO L226 Difference]: Without dead ends: 1798 [2019-12-18 15:16:27,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:16:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-12-18 15:16:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 540. [2019-12-18 15:16:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-12-18 15:16:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1700 transitions. [2019-12-18 15:16:27,216 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1700 transitions. Word has length 15 [2019-12-18 15:16:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:27,216 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 1700 transitions. [2019-12-18 15:16:27,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:16:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1700 transitions. [2019-12-18 15:16:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:16:27,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:27,218 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:27,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:27,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1885947986, now seen corresponding path program 1 times [2019-12-18 15:16:27,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:27,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148070355] [2019-12-18 15:16:27,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:16:27,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148070355] [2019-12-18 15:16:27,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:27,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:16:27,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740275115] [2019-12-18 15:16:27,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:16:27,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:16:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:16:27,506 INFO L87 Difference]: Start difference. First operand 540 states and 1700 transitions. Second operand 5 states. [2019-12-18 15:16:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:27,583 INFO L93 Difference]: Finished difference Result 864 states and 2410 transitions. [2019-12-18 15:16:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:16:27,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:16:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:27,590 INFO L225 Difference]: With dead ends: 864 [2019-12-18 15:16:27,590 INFO L226 Difference]: Without dead ends: 856 [2019-12-18 15:16:27,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:16:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-12-18 15:16:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 549. [2019-12-18 15:16:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-18 15:16:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1686 transitions. [2019-12-18 15:16:27,609 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1686 transitions. Word has length 17 [2019-12-18 15:16:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:27,609 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1686 transitions. [2019-12-18 15:16:27,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:16:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1686 transitions. [2019-12-18 15:16:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:16:27,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:27,610 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:27,611 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:16:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1661426381, now seen corresponding path program 1 times [2019-12-18 15:16:27,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:27,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690288655] [2019-12-18 15:16:27,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:16:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:16:27,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:16:27,663 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:16:27,663 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:16:27,664 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 15:16:27,680 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,680 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,680 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,681 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,681 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,682 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,682 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,685 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,685 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,687 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,687 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,687 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,687 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,687 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,687 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,687 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,687 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,688 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,688 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,689 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,689 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,689 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,689 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,689 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,689 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,689 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,690 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,690 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,690 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,690 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,690 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,690 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,691 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,692 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,692 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,699 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,699 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,701 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,701 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,701 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,704 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,706 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,706 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,706 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,706 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,706 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,706 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:16:27,713 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 15:16:27,714 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:16:27,714 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:16:27,714 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:16:27,714 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:16:27,714 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:16:27,714 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:16:27,714 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:16:27,714 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:16:27,717 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 110 transitions [2019-12-18 15:16:27,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-18 15:16:27,759 INFO L126 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-18 15:16:27,760 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:16:27,761 INFO L76 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 132 events. 6/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs. 56/176 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2019-12-18 15:16:27,766 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-18 15:16:27,785 INFO L126 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-18 15:16:27,785 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:16:27,787 INFO L76 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 132 events. 6/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs. 56/176 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2019-12-18 15:16:27,792 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-18 15:16:27,793 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:16:29,040 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-12-18 15:16:29,485 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-18 15:16:29,880 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2220 [2019-12-18 15:16:29,881 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 15:16:29,881 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-18 15:16:29,991 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-18 15:16:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-18 15:16:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:16:29,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:29,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:16:29,992 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 792177, now seen corresponding path program 1 times [2019-12-18 15:16:29,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:29,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91858960] [2019-12-18 15:16:29,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:30,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91858960] [2019-12-18 15:16:30,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:30,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:16:30,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850010360] [2019-12-18 15:16:30,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:16:30,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:30,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:16:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:16:30,014 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-18 15:16:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:30,057 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-18 15:16:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:16:30,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:16:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:30,073 INFO L225 Difference]: With dead ends: 1889 [2019-12-18 15:16:30,073 INFO L226 Difference]: Without dead ends: 1767 [2019-12-18 15:16:30,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:16:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-18 15:16:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-18 15:16:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 15:16:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-18 15:16:30,137 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-18 15:16:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:30,138 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-18 15:16:30,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:16:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-18 15:16:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:16:30,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:30,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:30,139 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:30,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash -982045597, now seen corresponding path program 1 times [2019-12-18 15:16:30,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:30,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53588143] [2019-12-18 15:16:30,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:30,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53588143] [2019-12-18 15:16:30,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:30,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:16:30,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583474514] [2019-12-18 15:16:30,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:16:30,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:30,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:16:30,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:16:30,176 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-18 15:16:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:30,272 INFO L93 Difference]: Finished difference Result 3302 states and 11435 transitions. [2019-12-18 15:16:30,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:16:30,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:16:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:30,297 INFO L225 Difference]: With dead ends: 3302 [2019-12-18 15:16:30,297 INFO L226 Difference]: Without dead ends: 3299 [2019-12-18 15:16:30,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:16:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-12-18 15:16:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 1914. [2019-12-18 15:16:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 15:16:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-18 15:16:30,380 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-18 15:16:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:30,380 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-18 15:16:30,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:16:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-18 15:16:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:16:30,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:30,381 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:30,382 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1476250518, now seen corresponding path program 1 times [2019-12-18 15:16:30,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:30,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390572239] [2019-12-18 15:16:30,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:16:30,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390572239] [2019-12-18 15:16:30,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:30,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:16:30,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010438499] [2019-12-18 15:16:30,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:16:30,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:30,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:16:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:16:30,431 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-18 15:16:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:30,561 INFO L93 Difference]: Finished difference Result 3604 states and 12619 transitions. [2019-12-18 15:16:30,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:16:30,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:16:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:30,605 INFO L225 Difference]: With dead ends: 3604 [2019-12-18 15:16:30,606 INFO L226 Difference]: Without dead ends: 3600 [2019-12-18 15:16:30,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:16:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2019-12-18 15:16:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 2147. [2019-12-18 15:16:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 15:16:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-18 15:16:30,743 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-18 15:16:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:30,745 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-18 15:16:30,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:16:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-18 15:16:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:16:30,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:30,747 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:30,748 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash 65367165, now seen corresponding path program 1 times [2019-12-18 15:16:30,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:30,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128042793] [2019-12-18 15:16:30,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:30,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128042793] [2019-12-18 15:16:30,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607471173] [2019-12-18 15:16:30,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:30,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:30,950 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:31,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:31,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:16:31,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279121595] [2019-12-18 15:16:31,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:16:31,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:31,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:16:31,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:16:31,063 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 18 states. [2019-12-18 15:16:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:31,887 INFO L93 Difference]: Finished difference Result 6596 states and 21956 transitions. [2019-12-18 15:16:31,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 15:16:31,888 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:16:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:31,909 INFO L225 Difference]: With dead ends: 6596 [2019-12-18 15:16:31,910 INFO L226 Difference]: Without dead ends: 6592 [2019-12-18 15:16:31,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:16:31,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2019-12-18 15:16:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 2291. [2019-12-18 15:16:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-18 15:16:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 9027 transitions. [2019-12-18 15:16:32,098 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 9027 transitions. Word has length 15 [2019-12-18 15:16:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:32,099 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 9027 transitions. [2019-12-18 15:16:32,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:16:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 9027 transitions. [2019-12-18 15:16:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:16:32,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:32,100 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:32,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:32,300 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1209341565, now seen corresponding path program 2 times [2019-12-18 15:16:32,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:32,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229314044] [2019-12-18 15:16:32,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:32,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229314044] [2019-12-18 15:16:32,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396335094] [2019-12-18 15:16:32,373 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:32,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:16:32,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:32,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:32,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:32,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:32,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:16:32,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804899378] [2019-12-18 15:16:32,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:16:32,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:32,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:16:32,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:16:32,563 INFO L87 Difference]: Start difference. First operand 2291 states and 9027 transitions. Second operand 18 states. [2019-12-18 15:16:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:33,505 INFO L93 Difference]: Finished difference Result 7121 states and 23244 transitions. [2019-12-18 15:16:33,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:16:33,505 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:16:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:33,527 INFO L225 Difference]: With dead ends: 7121 [2019-12-18 15:16:33,528 INFO L226 Difference]: Without dead ends: 7117 [2019-12-18 15:16:33,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=340, Invalid=1142, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:16:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2019-12-18 15:16:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 2292. [2019-12-18 15:16:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2019-12-18 15:16:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 9029 transitions. [2019-12-18 15:16:33,634 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 9029 transitions. Word has length 15 [2019-12-18 15:16:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:33,634 INFO L462 AbstractCegarLoop]: Abstraction has 2292 states and 9029 transitions. [2019-12-18 15:16:33,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:16:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 9029 transitions. [2019-12-18 15:16:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:16:33,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:33,635 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:33,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:33,839 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1337558845, now seen corresponding path program 3 times [2019-12-18 15:16:33,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:33,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507571036] [2019-12-18 15:16:33,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:33,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507571036] [2019-12-18 15:16:33,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118480138] [2019-12-18 15:16:33,931 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:34,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:16:34,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:34,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:34,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:34,193 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-18 15:16:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:34,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:34,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:16:34,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361289584] [2019-12-18 15:16:34,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:16:34,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:16:34,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:16:34,273 INFO L87 Difference]: Start difference. First operand 2292 states and 9029 transitions. Second operand 18 states. [2019-12-18 15:16:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:35,092 INFO L93 Difference]: Finished difference Result 8074 states and 26184 transitions. [2019-12-18 15:16:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:16:35,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:16:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:35,113 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 15:16:35,113 INFO L226 Difference]: Without dead ends: 8069 [2019-12-18 15:16:35,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:16:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8069 states. [2019-12-18 15:16:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8069 to 2253. [2019-12-18 15:16:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-18 15:16:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 8861 transitions. [2019-12-18 15:16:35,233 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 8861 transitions. Word has length 15 [2019-12-18 15:16:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:35,233 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 8861 transitions. [2019-12-18 15:16:35,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:16:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 8861 transitions. [2019-12-18 15:16:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:16:35,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:35,234 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:35,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:35,447 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:35,447 INFO L82 PathProgramCache]: Analyzing trace with hash 46933139, now seen corresponding path program 4 times [2019-12-18 15:16:35,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:35,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47540258] [2019-12-18 15:16:35,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:35,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47540258] [2019-12-18 15:16:35,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879630974] [2019-12-18 15:16:35,556 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:35,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:16:35,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:35,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:35,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:35,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:35,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:16:35,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479488790] [2019-12-18 15:16:35,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:16:35,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:35,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:16:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:16:35,730 INFO L87 Difference]: Start difference. First operand 2253 states and 8861 transitions. Second operand 18 states. [2019-12-18 15:16:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:37,389 INFO L93 Difference]: Finished difference Result 12415 states and 40135 transitions. [2019-12-18 15:16:37,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 15:16:37,390 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:16:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:37,420 INFO L225 Difference]: With dead ends: 12415 [2019-12-18 15:16:37,420 INFO L226 Difference]: Without dead ends: 12411 [2019-12-18 15:16:37,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=722, Invalid=2700, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 15:16:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12411 states. [2019-12-18 15:16:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12411 to 2148. [2019-12-18 15:16:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2019-12-18 15:16:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 8359 transitions. [2019-12-18 15:16:37,567 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 8359 transitions. Word has length 15 [2019-12-18 15:16:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:37,567 INFO L462 AbstractCegarLoop]: Abstraction has 2148 states and 8359 transitions. [2019-12-18 15:16:37,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:16:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 8359 transitions. [2019-12-18 15:16:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:16:37,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:37,568 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:37,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:37,770 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1190907539, now seen corresponding path program 5 times [2019-12-18 15:16:37,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:37,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052346446] [2019-12-18 15:16:37,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:37,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052346446] [2019-12-18 15:16:37,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957681566] [2019-12-18 15:16:37,848 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 [2019-12-18 15:16:37,924 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:16:37,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:37,925 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:37,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:38,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:38,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:16:38,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382648462] [2019-12-18 15:16:38,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:16:38,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:38,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:16:38,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:16:38,041 INFO L87 Difference]: Start difference. First operand 2148 states and 8359 transitions. Second operand 18 states. [2019-12-18 15:16:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:39,124 INFO L93 Difference]: Finished difference Result 6358 states and 20204 transitions. [2019-12-18 15:16:39,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:16:39,124 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:16:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:39,134 INFO L225 Difference]: With dead ends: 6358 [2019-12-18 15:16:39,134 INFO L226 Difference]: Without dead ends: 6354 [2019-12-18 15:16:39,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:16:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2019-12-18 15:16:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 2147. [2019-12-18 15:16:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 15:16:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8356 transitions. [2019-12-18 15:16:39,218 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8356 transitions. Word has length 15 [2019-12-18 15:16:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:39,219 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8356 transitions. [2019-12-18 15:16:39,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:16:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8356 transitions. [2019-12-18 15:16:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:16:39,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:39,220 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:39,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:39,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:39,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:39,422 INFO L82 PathProgramCache]: Analyzing trace with hash -526841521, now seen corresponding path program 6 times [2019-12-18 15:16:39,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:39,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328964275] [2019-12-18 15:16:39,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:39,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328964275] [2019-12-18 15:16:39,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400602867] [2019-12-18 15:16:39,497 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 [2019-12-18 15:16:39,568 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 15:16:39,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:39,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:39,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:39,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:39,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:16:39,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427775266] [2019-12-18 15:16:39,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:16:39,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:39,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:16:39,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:16:39,695 INFO L87 Difference]: Start difference. First operand 2147 states and 8356 transitions. Second operand 18 states. [2019-12-18 15:16:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:40,898 INFO L93 Difference]: Finished difference Result 6157 states and 19308 transitions. [2019-12-18 15:16:40,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:16:40,899 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:16:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:40,910 INFO L225 Difference]: With dead ends: 6157 [2019-12-18 15:16:40,910 INFO L226 Difference]: Without dead ends: 6153 [2019-12-18 15:16:40,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 15:16:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2019-12-18 15:16:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 1998. [2019-12-18 15:16:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 15:16:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-18 15:16:40,967 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-18 15:16:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:40,967 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-18 15:16:40,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:16:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-18 15:16:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:16:40,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:40,968 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:41,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:41,169 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:41,169 INFO L82 PathProgramCache]: Analyzing trace with hash -773481600, now seen corresponding path program 1 times [2019-12-18 15:16:41,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:41,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657628380] [2019-12-18 15:16:41,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:16:41,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657628380] [2019-12-18 15:16:41,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:16:41,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:16:41,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683935508] [2019-12-18 15:16:41,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:16:41,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:16:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:16:41,226 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-18 15:16:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:41,327 INFO L93 Difference]: Finished difference Result 3692 states and 13037 transitions. [2019-12-18 15:16:41,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:16:41,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:16:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:41,334 INFO L225 Difference]: With dead ends: 3692 [2019-12-18 15:16:41,334 INFO L226 Difference]: Without dead ends: 3684 [2019-12-18 15:16:41,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:16:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2019-12-18 15:16:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2245. [2019-12-18 15:16:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-18 15:16:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-18 15:16:41,396 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-18 15:16:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:41,396 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-18 15:16:41,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:16:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-18 15:16:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:41,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:41,398 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:41,398 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2045174229, now seen corresponding path program 1 times [2019-12-18 15:16:41,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:41,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557970277] [2019-12-18 15:16:41,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:41,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557970277] [2019-12-18 15:16:41,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902259931] [2019-12-18 15:16:41,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:41,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:41,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:41,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:41,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:16:41,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788893118] [2019-12-18 15:16:41,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:16:41,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:16:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:16:41,840 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 20 states. [2019-12-18 15:16:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:43,143 INFO L93 Difference]: Finished difference Result 9631 states and 33006 transitions. [2019-12-18 15:16:43,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 15:16:43,144 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:16:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:43,167 INFO L225 Difference]: With dead ends: 9631 [2019-12-18 15:16:43,167 INFO L226 Difference]: Without dead ends: 9625 [2019-12-18 15:16:43,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 15:16:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2019-12-18 15:16:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 2467. [2019-12-18 15:16:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-12-18 15:16:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 9739 transitions. [2019-12-18 15:16:43,285 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 9739 transitions. Word has length 19 [2019-12-18 15:16:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:43,286 INFO L462 AbstractCegarLoop]: Abstraction has 2467 states and 9739 transitions. [2019-12-18 15:16:43,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:16:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 9739 transitions. [2019-12-18 15:16:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:43,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:43,288 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:43,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:43,491 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash -902093559, now seen corresponding path program 2 times [2019-12-18 15:16:43,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:43,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160512007] [2019-12-18 15:16:43,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:43,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160512007] [2019-12-18 15:16:43,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898528170] [2019-12-18 15:16:43,582 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:43,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:16:43,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:43,651 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:43,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:43,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:43,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:16:43,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067050771] [2019-12-18 15:16:43,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:16:43,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:16:43,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:16:43,776 INFO L87 Difference]: Start difference. First operand 2467 states and 9739 transitions. Second operand 20 states. [2019-12-18 15:16:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:44,901 INFO L93 Difference]: Finished difference Result 6850 states and 23581 transitions. [2019-12-18 15:16:44,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:16:44,903 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:16:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:44,917 INFO L225 Difference]: With dead ends: 6850 [2019-12-18 15:16:44,917 INFO L226 Difference]: Without dead ends: 6842 [2019-12-18 15:16:44,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 15:16:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6842 states. [2019-12-18 15:16:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6842 to 2518. [2019-12-18 15:16:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-12-18 15:16:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 9974 transitions. [2019-12-18 15:16:44,983 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 9974 transitions. Word has length 19 [2019-12-18 15:16:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:44,984 INFO L462 AbstractCegarLoop]: Abstraction has 2518 states and 9974 transitions. [2019-12-18 15:16:44,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:16:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 9974 transitions. [2019-12-18 15:16:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:44,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:44,986 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:45,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:45,189 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:45,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1675124677, now seen corresponding path program 3 times [2019-12-18 15:16:45,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:45,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742942928] [2019-12-18 15:16:45,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:45,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742942928] [2019-12-18 15:16:45,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677418940] [2019-12-18 15:16:45,353 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:45,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:16:45,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:45,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:45,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:45,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:45,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:16:45,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524527836] [2019-12-18 15:16:45,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:16:45,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:16:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:16:45,541 INFO L87 Difference]: Start difference. First operand 2518 states and 9974 transitions. Second operand 20 states. [2019-12-18 15:16:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:47,040 INFO L93 Difference]: Finished difference Result 7202 states and 24414 transitions. [2019-12-18 15:16:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:16:47,041 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:16:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:47,052 INFO L225 Difference]: With dead ends: 7202 [2019-12-18 15:16:47,053 INFO L226 Difference]: Without dead ends: 7192 [2019-12-18 15:16:47,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=505, Invalid=1751, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 15:16:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2019-12-18 15:16:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 2526. [2019-12-18 15:16:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2019-12-18 15:16:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 9994 transitions. [2019-12-18 15:16:47,151 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 9994 transitions. Word has length 19 [2019-12-18 15:16:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:47,151 INFO L462 AbstractCegarLoop]: Abstraction has 2526 states and 9994 transitions. [2019-12-18 15:16:47,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:16:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 9994 transitions. [2019-12-18 15:16:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:47,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:47,153 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:47,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:47,357 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash -287060421, now seen corresponding path program 1 times [2019-12-18 15:16:47,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:47,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454521894] [2019-12-18 15:16:47,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:47,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454521894] [2019-12-18 15:16:47,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759885541] [2019-12-18 15:16:47,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:47,524 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:47,525 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:47,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:47,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:16:47,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138758612] [2019-12-18 15:16:47,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:16:47,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:16:47,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:16:47,634 INFO L87 Difference]: Start difference. First operand 2526 states and 9994 transitions. Second operand 20 states. [2019-12-18 15:16:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:48,449 INFO L93 Difference]: Finished difference Result 6238 states and 22108 transitions. [2019-12-18 15:16:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:16:48,449 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:16:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:48,460 INFO L225 Difference]: With dead ends: 6238 [2019-12-18 15:16:48,460 INFO L226 Difference]: Without dead ends: 6229 [2019-12-18 15:16:48,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 15:16:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6229 states. [2019-12-18 15:16:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6229 to 2774. [2019-12-18 15:16:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-12-18 15:16:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 11179 transitions. [2019-12-18 15:16:48,557 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 11179 transitions. Word has length 19 [2019-12-18 15:16:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:48,558 INFO L462 AbstractCegarLoop]: Abstraction has 2774 states and 11179 transitions. [2019-12-18 15:16:48,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:16:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 11179 transitions. [2019-12-18 15:16:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:48,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:48,560 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:48,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:48,772 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:48,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash -286456665, now seen corresponding path program 4 times [2019-12-18 15:16:48,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:48,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986188294] [2019-12-18 15:16:48,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:48,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986188294] [2019-12-18 15:16:48,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671828497] [2019-12-18 15:16:48,867 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 [2019-12-18 15:16:48,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:16:48,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:48,942 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:48,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:49,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:49,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:16:49,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909839802] [2019-12-18 15:16:49,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:16:49,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:49,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:16:49,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:16:49,073 INFO L87 Difference]: Start difference. First operand 2774 states and 11179 transitions. Second operand 20 states. [2019-12-18 15:16:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:49,902 INFO L93 Difference]: Finished difference Result 9226 states and 32233 transitions. [2019-12-18 15:16:49,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:16:49,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:16:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:49,922 INFO L225 Difference]: With dead ends: 9226 [2019-12-18 15:16:49,922 INFO L226 Difference]: Without dead ends: 9217 [2019-12-18 15:16:49,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=1319, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:16:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2019-12-18 15:16:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 2779. [2019-12-18 15:16:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-12-18 15:16:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 11190 transitions. [2019-12-18 15:16:50,008 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 11190 transitions. Word has length 19 [2019-12-18 15:16:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:50,008 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 11190 transitions. [2019-12-18 15:16:50,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:16:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 11190 transitions. [2019-12-18 15:16:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:50,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:50,009 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:50,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:50,213 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:50,214 INFO L82 PathProgramCache]: Analyzing trace with hash -286465221, now seen corresponding path program 2 times [2019-12-18 15:16:50,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:50,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232075160] [2019-12-18 15:16:50,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:50,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232075160] [2019-12-18 15:16:50,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270204455] [2019-12-18 15:16:50,316 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:50,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:16:50,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:50,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:50,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 15:16:50,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:50,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 15:16:50,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430123223] [2019-12-18 15:16:50,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:16:50,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:16:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:16:50,608 INFO L87 Difference]: Start difference. First operand 2779 states and 11190 transitions. Second operand 19 states. [2019-12-18 15:16:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:51,632 INFO L93 Difference]: Finished difference Result 5581 states and 19502 transitions. [2019-12-18 15:16:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:16:51,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 15:16:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:51,641 INFO L225 Difference]: With dead ends: 5581 [2019-12-18 15:16:51,642 INFO L226 Difference]: Without dead ends: 5572 [2019-12-18 15:16:51,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:16:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2019-12-18 15:16:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 2800. [2019-12-18 15:16:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2019-12-18 15:16:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 11271 transitions. [2019-12-18 15:16:51,703 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 11271 transitions. Word has length 19 [2019-12-18 15:16:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:51,703 INFO L462 AbstractCegarLoop]: Abstraction has 2800 states and 11271 transitions. [2019-12-18 15:16:51,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:16:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 11271 transitions. [2019-12-18 15:16:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:51,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:51,706 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:51,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:51,910 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash 244420411, now seen corresponding path program 3 times [2019-12-18 15:16:51,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:51,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243331275] [2019-12-18 15:16:51,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:51,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243331275] [2019-12-18 15:16:51,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442153674] [2019-12-18 15:16:51,994 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:52,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:16:52,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:52,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:52,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:52,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:52,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:16:52,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317865340] [2019-12-18 15:16:52,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:16:52,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:52,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:16:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:16:52,208 INFO L87 Difference]: Start difference. First operand 2800 states and 11271 transitions. Second operand 20 states. [2019-12-18 15:16:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:53,189 INFO L93 Difference]: Finished difference Result 6966 states and 24484 transitions. [2019-12-18 15:16:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:16:53,190 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:16:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:53,207 INFO L225 Difference]: With dead ends: 6966 [2019-12-18 15:16:53,208 INFO L226 Difference]: Without dead ends: 6957 [2019-12-18 15:16:53,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:16:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-12-18 15:16:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 2951. [2019-12-18 15:16:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2019-12-18 15:16:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 12035 transitions. [2019-12-18 15:16:53,339 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 12035 transitions. Word has length 19 [2019-12-18 15:16:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:53,339 INFO L462 AbstractCegarLoop]: Abstraction has 2951 states and 12035 transitions. [2019-12-18 15:16:53,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:16:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 12035 transitions. [2019-12-18 15:16:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:53,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:53,341 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:53,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:53,555 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1118161091, now seen corresponding path program 4 times [2019-12-18 15:16:53,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:53,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652018709] [2019-12-18 15:16:53,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:53,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652018709] [2019-12-18 15:16:53,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806611332] [2019-12-18 15:16:53,634 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:53,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:16:53,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:53,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:53,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:53,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:53,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:16:53,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8364780] [2019-12-18 15:16:53,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:16:53,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:16:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:16:53,832 INFO L87 Difference]: Start difference. First operand 2951 states and 12035 transitions. Second operand 20 states. [2019-12-18 15:16:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:54,948 INFO L93 Difference]: Finished difference Result 6602 states and 22963 transitions. [2019-12-18 15:16:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:16:54,948 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:16:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:54,959 INFO L225 Difference]: With dead ends: 6602 [2019-12-18 15:16:54,960 INFO L226 Difference]: Without dead ends: 6593 [2019-12-18 15:16:54,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1469, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 15:16:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6593 states. [2019-12-18 15:16:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6593 to 2829. [2019-12-18 15:16:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2019-12-18 15:16:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 11387 transitions. [2019-12-18 15:16:55,028 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 11387 transitions. Word has length 19 [2019-12-18 15:16:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:55,029 INFO L462 AbstractCegarLoop]: Abstraction has 2829 states and 11387 transitions. [2019-12-18 15:16:55,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:16:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 11387 transitions. [2019-12-18 15:16:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:55,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:55,030 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:55,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:55,231 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1977035621, now seen corresponding path program 5 times [2019-12-18 15:16:55,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:55,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990328089] [2019-12-18 15:16:55,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:55,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990328089] [2019-12-18 15:16:55,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665216739] [2019-12-18 15:16:55,314 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:55,381 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 15:16:55,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:55,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:16:55,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:55,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:55,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 15:16:55,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967276309] [2019-12-18 15:16:55,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:16:55,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:55,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:16:55,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:16:55,514 INFO L87 Difference]: Start difference. First operand 2829 states and 11387 transitions. Second operand 19 states. [2019-12-18 15:16:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:57,036 INFO L93 Difference]: Finished difference Result 7580 states and 25385 transitions. [2019-12-18 15:16:57,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:16:57,036 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 15:16:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:57,049 INFO L225 Difference]: With dead ends: 7580 [2019-12-18 15:16:57,049 INFO L226 Difference]: Without dead ends: 7556 [2019-12-18 15:16:57,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 15:16:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2019-12-18 15:16:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 2498. [2019-12-18 15:16:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-12-18 15:16:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 9874 transitions. [2019-12-18 15:16:57,118 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 9874 transitions. Word has length 19 [2019-12-18 15:16:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:57,118 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 9874 transitions. [2019-12-18 15:16:57,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:16:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 9874 transitions. [2019-12-18 15:16:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:57,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:57,119 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:57,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:57,323 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1004938431, now seen corresponding path program 5 times [2019-12-18 15:16:57,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:57,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344357962] [2019-12-18 15:16:57,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:57,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344357962] [2019-12-18 15:16:57,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765779851] [2019-12-18 15:16:57,482 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:57,557 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 15:16:57,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:57,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:57,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:16:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:57,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:16:57,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:16:57,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774474485] [2019-12-18 15:16:57,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:16:57,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:16:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:16:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:16:57,708 INFO L87 Difference]: Start difference. First operand 2498 states and 9874 transitions. Second operand 20 states. [2019-12-18 15:16:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:16:59,444 INFO L93 Difference]: Finished difference Result 11643 states and 40400 transitions. [2019-12-18 15:16:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 15:16:59,444 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:16:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:16:59,465 INFO L225 Difference]: With dead ends: 11643 [2019-12-18 15:16:59,465 INFO L226 Difference]: Without dead ends: 11634 [2019-12-18 15:16:59,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=768, Invalid=2892, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 15:16:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2019-12-18 15:16:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 2444. [2019-12-18 15:16:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-12-18 15:16:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 9584 transitions. [2019-12-18 15:16:59,559 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 9584 transitions. Word has length 19 [2019-12-18 15:16:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:16:59,559 INFO L462 AbstractCegarLoop]: Abstraction has 2444 states and 9584 transitions. [2019-12-18 15:16:59,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:16:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 9584 transitions. [2019-12-18 15:16:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:16:59,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:16:59,560 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:16:59,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:59,761 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:16:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:16:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash 138142239, now seen corresponding path program 6 times [2019-12-18 15:16:59,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:16:59,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206236183] [2019-12-18 15:16:59,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:16:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:16:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:16:59,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206236183] [2019-12-18 15:16:59,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021754249] [2019-12-18 15:16:59,850 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:16:59,926 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:16:59,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:16:59,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:16:59,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:00,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:00,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:17:00,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772020816] [2019-12-18 15:17:00,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:17:00,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:17:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:17:00,059 INFO L87 Difference]: Start difference. First operand 2444 states and 9584 transitions. Second operand 20 states. [2019-12-18 15:17:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:01,412 INFO L93 Difference]: Finished difference Result 6283 states and 21343 transitions. [2019-12-18 15:17:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:17:01,413 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:17:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:01,423 INFO L225 Difference]: With dead ends: 6283 [2019-12-18 15:17:01,423 INFO L226 Difference]: Without dead ends: 6274 [2019-12-18 15:17:01,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=445, Invalid=1625, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 15:17:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2019-12-18 15:17:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 2441. [2019-12-18 15:17:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-18 15:17:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 9573 transitions. [2019-12-18 15:17:01,483 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 9573 transitions. Word has length 19 [2019-12-18 15:17:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:01,483 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 9573 transitions. [2019-12-18 15:17:01,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:17:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 9573 transitions. [2019-12-18 15:17:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:17:01,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:01,484 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:01,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:01,685 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1579606821, now seen corresponding path program 7 times [2019-12-18 15:17:01,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:01,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059322446] [2019-12-18 15:17:01,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:01,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059322446] [2019-12-18 15:17:01,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035210770] [2019-12-18 15:17:01,760 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:01,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:17:01,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:01,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:01,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:17:01,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915682019] [2019-12-18 15:17:01,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:17:01,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:17:01,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:17:01,947 INFO L87 Difference]: Start difference. First operand 2441 states and 9573 transitions. Second operand 20 states. [2019-12-18 15:17:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:03,448 INFO L93 Difference]: Finished difference Result 6551 states and 21720 transitions. [2019-12-18 15:17:03,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 15:17:03,449 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:17:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:03,460 INFO L225 Difference]: With dead ends: 6551 [2019-12-18 15:17:03,460 INFO L226 Difference]: Without dead ends: 6540 [2019-12-18 15:17:03,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 15:17:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6540 states. [2019-12-18 15:17:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6540 to 2413. [2019-12-18 15:17:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2019-12-18 15:17:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 9460 transitions. [2019-12-18 15:17:03,524 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 9460 transitions. Word has length 19 [2019-12-18 15:17:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:03,525 INFO L462 AbstractCegarLoop]: Abstraction has 2413 states and 9460 transitions. [2019-12-18 15:17:03,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:17:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 9460 transitions. [2019-12-18 15:17:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:17:03,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:03,526 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:03,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:03,730 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash -87468871, now seen corresponding path program 8 times [2019-12-18 15:17:03,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:03,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020638618] [2019-12-18 15:17:03,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:03,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020638618] [2019-12-18 15:17:03,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505263080] [2019-12-18 15:17:03,813 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:03,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:17:03,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:03,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:17:03,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 15:17:03,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:03,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 15:17:03,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877191313] [2019-12-18 15:17:03,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:17:03,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:17:03,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:17:03,987 INFO L87 Difference]: Start difference. First operand 2413 states and 9460 transitions. Second operand 19 states. [2019-12-18 15:17:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:05,542 INFO L93 Difference]: Finished difference Result 6388 states and 21017 transitions. [2019-12-18 15:17:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 15:17:05,543 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 15:17:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:05,554 INFO L225 Difference]: With dead ends: 6388 [2019-12-18 15:17:05,554 INFO L226 Difference]: Without dead ends: 6382 [2019-12-18 15:17:05,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=503, Invalid=1947, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 15:17:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2019-12-18 15:17:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 2259. [2019-12-18 15:17:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-12-18 15:17:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 8835 transitions. [2019-12-18 15:17:05,614 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 8835 transitions. Word has length 19 [2019-12-18 15:17:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:05,615 INFO L462 AbstractCegarLoop]: Abstraction has 2259 states and 8835 transitions. [2019-12-18 15:17:05,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:17:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 8835 transitions. [2019-12-18 15:17:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:05,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:05,616 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:05,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:05,817 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:05,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1682002470, now seen corresponding path program 1 times [2019-12-18 15:17:05,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:05,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032809943] [2019-12-18 15:17:05,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:05,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032809943] [2019-12-18 15:17:05,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728752610] [2019-12-18 15:17:05,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:05,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:06,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:06,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:06,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:06,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790325193] [2019-12-18 15:17:06,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:06,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:06,156 INFO L87 Difference]: Start difference. First operand 2259 states and 8835 transitions. Second operand 24 states. [2019-12-18 15:17:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:10,138 INFO L93 Difference]: Finished difference Result 17049 states and 52657 transitions. [2019-12-18 15:17:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-18 15:17:10,139 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:10,168 INFO L225 Difference]: With dead ends: 17049 [2019-12-18 15:17:10,168 INFO L226 Difference]: Without dead ends: 17045 [2019-12-18 15:17:10,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4372 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2727, Invalid=10383, Unknown=0, NotChecked=0, Total=13110 [2019-12-18 15:17:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17045 states. [2019-12-18 15:17:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17045 to 2311. [2019-12-18 15:17:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2019-12-18 15:17:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 9078 transitions. [2019-12-18 15:17:10,296 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 9078 transitions. Word has length 21 [2019-12-18 15:17:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:10,296 INFO L462 AbstractCegarLoop]: Abstraction has 2311 states and 9078 transitions. [2019-12-18 15:17:10,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 9078 transitions. [2019-12-18 15:17:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:10,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:10,298 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:10,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:10,499 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:10,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:10,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1682597670, now seen corresponding path program 2 times [2019-12-18 15:17:10,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:10,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213394657] [2019-12-18 15:17:10,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:10,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213394657] [2019-12-18 15:17:10,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82874670] [2019-12-18 15:17:10,600 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:10,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:17:10,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:10,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:10,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:10,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:10,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:10,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240370411] [2019-12-18 15:17:10,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:10,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:10,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:10,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:10,823 INFO L87 Difference]: Start difference. First operand 2311 states and 9078 transitions. Second operand 24 states. [2019-12-18 15:17:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:14,420 INFO L93 Difference]: Finished difference Result 16849 states and 52108 transitions. [2019-12-18 15:17:14,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-18 15:17:14,420 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:14,448 INFO L225 Difference]: With dead ends: 16849 [2019-12-18 15:17:14,448 INFO L226 Difference]: Without dead ends: 16843 [2019-12-18 15:17:14,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4352 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2727, Invalid=10383, Unknown=0, NotChecked=0, Total=13110 [2019-12-18 15:17:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-12-18 15:17:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 2309. [2019-12-18 15:17:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2019-12-18 15:17:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 9072 transitions. [2019-12-18 15:17:14,569 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 9072 transitions. Word has length 21 [2019-12-18 15:17:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:14,569 INFO L462 AbstractCegarLoop]: Abstraction has 2309 states and 9072 transitions. [2019-12-18 15:17:14,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 9072 transitions. [2019-12-18 15:17:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:14,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:14,571 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:14,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:14,773 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:14,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash 670898564, now seen corresponding path program 3 times [2019-12-18 15:17:14,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:14,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829674463] [2019-12-18 15:17:14,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:14,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829674463] [2019-12-18 15:17:14,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621492327] [2019-12-18 15:17:14,874 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:14,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:17:14,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:14,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:14,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:15,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:15,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:15,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483547004] [2019-12-18 15:17:15,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:15,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:15,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:15,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:15,091 INFO L87 Difference]: Start difference. First operand 2309 states and 9072 transitions. Second operand 24 states. [2019-12-18 15:17:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:18,782 INFO L93 Difference]: Finished difference Result 15997 states and 49097 transitions. [2019-12-18 15:17:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-18 15:17:18,783 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:18,809 INFO L225 Difference]: With dead ends: 15997 [2019-12-18 15:17:18,810 INFO L226 Difference]: Without dead ends: 15983 [2019-12-18 15:17:18,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5491 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2630, Invalid=12622, Unknown=0, NotChecked=0, Total=15252 [2019-12-18 15:17:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15983 states. [2019-12-18 15:17:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15983 to 2348. [2019-12-18 15:17:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-12-18 15:17:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 9252 transitions. [2019-12-18 15:17:18,925 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 9252 transitions. Word has length 21 [2019-12-18 15:17:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:18,925 INFO L462 AbstractCegarLoop]: Abstraction has 2348 states and 9252 transitions. [2019-12-18 15:17:18,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 9252 transitions. [2019-12-18 15:17:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:18,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:18,927 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:19,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:19,130 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash 671493764, now seen corresponding path program 4 times [2019-12-18 15:17:19,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:19,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923151882] [2019-12-18 15:17:19,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:19,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923151882] [2019-12-18 15:17:19,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833881968] [2019-12-18 15:17:19,264 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:19,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:17:19,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:19,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:19,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:19,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:19,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:19,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241543690] [2019-12-18 15:17:19,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:19,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:19,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:19,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:19,622 INFO L87 Difference]: Start difference. First operand 2348 states and 9252 transitions. Second operand 24 states. [2019-12-18 15:17:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:23,245 INFO L93 Difference]: Finished difference Result 14430 states and 45115 transitions. [2019-12-18 15:17:23,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-18 15:17:23,245 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:23,270 INFO L225 Difference]: With dead ends: 14430 [2019-12-18 15:17:23,270 INFO L226 Difference]: Without dead ends: 14422 [2019-12-18 15:17:23,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3725 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2076, Invalid=9054, Unknown=0, NotChecked=0, Total=11130 [2019-12-18 15:17:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14422 states. [2019-12-18 15:17:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14422 to 2323. [2019-12-18 15:17:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-12-18 15:17:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 9145 transitions. [2019-12-18 15:17:23,377 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 9145 transitions. Word has length 21 [2019-12-18 15:17:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:23,378 INFO L462 AbstractCegarLoop]: Abstraction has 2323 states and 9145 transitions. [2019-12-18 15:17:23,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 9145 transitions. [2019-12-18 15:17:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:23,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:23,380 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:23,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:23,583 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1202379396, now seen corresponding path program 5 times [2019-12-18 15:17:23,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:23,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584412751] [2019-12-18 15:17:23,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:23,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584412751] [2019-12-18 15:17:23,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059973083] [2019-12-18 15:17:23,680 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:23,755 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 15:17:23,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:23,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:23,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:23,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:23,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:23,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335168783] [2019-12-18 15:17:23,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:23,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:23,942 INFO L87 Difference]: Start difference. First operand 2323 states and 9145 transitions. Second operand 24 states. [2019-12-18 15:17:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:29,282 INFO L93 Difference]: Finished difference Result 20287 states and 61616 transitions. [2019-12-18 15:17:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-12-18 15:17:29,282 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:29,320 INFO L225 Difference]: With dead ends: 20287 [2019-12-18 15:17:29,320 INFO L226 Difference]: Without dead ends: 20271 [2019-12-18 15:17:29,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10500 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4366, Invalid=22694, Unknown=0, NotChecked=0, Total=27060 [2019-12-18 15:17:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20271 states. [2019-12-18 15:17:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20271 to 2422. [2019-12-18 15:17:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2019-12-18 15:17:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 9627 transitions. [2019-12-18 15:17:29,527 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 9627 transitions. Word has length 21 [2019-12-18 15:17:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:29,527 INFO L462 AbstractCegarLoop]: Abstraction has 2422 states and 9627 transitions. [2019-12-18 15:17:29,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 9627 transitions. [2019-12-18 15:17:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:29,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:29,529 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:29,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:29,730 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:29,731 INFO L82 PathProgramCache]: Analyzing trace with hash -818506432, now seen corresponding path program 6 times [2019-12-18 15:17:29,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:29,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559800613] [2019-12-18 15:17:29,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:29,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559800613] [2019-12-18 15:17:29,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196924579] [2019-12-18 15:17:29,834 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:29,902 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:17:29,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:29,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:29,904 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:30,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:30,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:30,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146172590] [2019-12-18 15:17:30,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:30,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:30,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:30,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:30,057 INFO L87 Difference]: Start difference. First operand 2422 states and 9627 transitions. Second operand 24 states. [2019-12-18 15:17:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:34,612 INFO L93 Difference]: Finished difference Result 16146 states and 49018 transitions. [2019-12-18 15:17:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-12-18 15:17:34,613 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:34,639 INFO L225 Difference]: With dead ends: 16146 [2019-12-18 15:17:34,639 INFO L226 Difference]: Without dead ends: 16137 [2019-12-18 15:17:34,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8079 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3329, Invalid=17263, Unknown=0, NotChecked=0, Total=20592 [2019-12-18 15:17:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2019-12-18 15:17:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 2429. [2019-12-18 15:17:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-12-18 15:17:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 9652 transitions. [2019-12-18 15:17:34,755 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 9652 transitions. Word has length 21 [2019-12-18 15:17:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:34,755 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 9652 transitions. [2019-12-18 15:17:34,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 9652 transitions. [2019-12-18 15:17:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:34,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:34,757 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:34,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:34,958 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -817911232, now seen corresponding path program 7 times [2019-12-18 15:17:34,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:34,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407887186] [2019-12-18 15:17:34,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:35,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407887186] [2019-12-18 15:17:35,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179404433] [2019-12-18 15:17:35,049 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:35,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:35,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:35,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:35,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:35,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251310388] [2019-12-18 15:17:35,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:35,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:35,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:35,260 INFO L87 Difference]: Start difference. First operand 2429 states and 9652 transitions. Second operand 24 states. [2019-12-18 15:17:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:39,086 INFO L93 Difference]: Finished difference Result 15056 states and 46587 transitions. [2019-12-18 15:17:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-18 15:17:39,086 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:39,110 INFO L225 Difference]: With dead ends: 15056 [2019-12-18 15:17:39,110 INFO L226 Difference]: Without dead ends: 15046 [2019-12-18 15:17:39,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5695 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2679, Invalid=12573, Unknown=0, NotChecked=0, Total=15252 [2019-12-18 15:17:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15046 states. [2019-12-18 15:17:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15046 to 2411. [2019-12-18 15:17:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-18 15:17:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 9575 transitions. [2019-12-18 15:17:39,217 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 9575 transitions. Word has length 21 [2019-12-18 15:17:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:39,217 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 9575 transitions. [2019-12-18 15:17:39,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 9575 transitions. [2019-12-18 15:17:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:39,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:39,219 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:39,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:39,419 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:39,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:39,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1450662060, now seen corresponding path program 8 times [2019-12-18 15:17:39,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:39,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472117700] [2019-12-18 15:17:39,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:39,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472117700] [2019-12-18 15:17:39,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146845101] [2019-12-18 15:17:39,525 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:39,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:17:39,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:39,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:39,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:39,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:39,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:39,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071287266] [2019-12-18 15:17:39,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:39,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:39,787 INFO L87 Difference]: Start difference. First operand 2411 states and 9575 transitions. Second operand 24 states. [2019-12-18 15:17:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:46,281 INFO L93 Difference]: Finished difference Result 18846 states and 56797 transitions. [2019-12-18 15:17:46,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-12-18 15:17:46,282 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:46,311 INFO L225 Difference]: With dead ends: 18846 [2019-12-18 15:17:46,312 INFO L226 Difference]: Without dead ends: 18831 [2019-12-18 15:17:46,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13427 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5009, Invalid=28297, Unknown=0, NotChecked=0, Total=33306 [2019-12-18 15:17:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2019-12-18 15:17:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 2327. [2019-12-18 15:17:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2019-12-18 15:17:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 9155 transitions. [2019-12-18 15:17:46,437 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 9155 transitions. Word has length 21 [2019-12-18 15:17:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:46,437 INFO L462 AbstractCegarLoop]: Abstraction has 2327 states and 9155 transitions. [2019-12-18 15:17:46,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 9155 transitions. [2019-12-18 15:17:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:46,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:46,439 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:46,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:46,640 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:46,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:46,640 INFO L82 PathProgramCache]: Analyzing trace with hash 586715080, now seen corresponding path program 9 times [2019-12-18 15:17:46,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:46,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236285041] [2019-12-18 15:17:46,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:46,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236285041] [2019-12-18 15:17:46,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475476188] [2019-12-18 15:17:46,728 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:46,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:17:46,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:46,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:46,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:46,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:46,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 15:17:46,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608576782] [2019-12-18 15:17:46,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:17:46,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:46,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:17:46,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:17:46,947 INFO L87 Difference]: Start difference. First operand 2327 states and 9155 transitions. Second operand 23 states. [2019-12-18 15:17:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:50,877 INFO L93 Difference]: Finished difference Result 11985 states and 35942 transitions. [2019-12-18 15:17:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-18 15:17:50,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 15:17:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:50,895 INFO L225 Difference]: With dead ends: 11985 [2019-12-18 15:17:50,896 INFO L226 Difference]: Without dead ends: 11976 [2019-12-18 15:17:50,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6318 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2715, Invalid=14055, Unknown=0, NotChecked=0, Total=16770 [2019-12-18 15:17:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11976 states. [2019-12-18 15:17:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11976 to 2332. [2019-12-18 15:17:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-18 15:17:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 9185 transitions. [2019-12-18 15:17:50,987 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 9185 transitions. Word has length 21 [2019-12-18 15:17:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:50,987 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 9185 transitions. [2019-12-18 15:17:50,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:17:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 9185 transitions. [2019-12-18 15:17:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:50,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:50,989 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:51,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:51,189 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:51,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1445589610, now seen corresponding path program 10 times [2019-12-18 15:17:51,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:51,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076213071] [2019-12-18 15:17:51,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:51,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076213071] [2019-12-18 15:17:51,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202107551] [2019-12-18 15:17:51,267 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:51,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:17:51,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:51,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:51,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:51,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:51,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 15:17:51,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625864314] [2019-12-18 15:17:51,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:17:51,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:17:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:17:51,473 INFO L87 Difference]: Start difference. First operand 2332 states and 9185 transitions. Second operand 23 states. [2019-12-18 15:17:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:55,557 INFO L93 Difference]: Finished difference Result 12278 states and 36913 transitions. [2019-12-18 15:17:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-18 15:17:55,557 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 15:17:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:55,578 INFO L225 Difference]: With dead ends: 12278 [2019-12-18 15:17:55,578 INFO L226 Difference]: Without dead ends: 12273 [2019-12-18 15:17:55,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6146 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2633, Invalid=13369, Unknown=0, NotChecked=0, Total=16002 [2019-12-18 15:17:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2019-12-18 15:17:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 2332. [2019-12-18 15:17:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-18 15:17:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 9185 transitions. [2019-12-18 15:17:55,681 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 9185 transitions. Word has length 21 [2019-12-18 15:17:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:55,681 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 9185 transitions. [2019-12-18 15:17:55,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:17:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 9185 transitions. [2019-12-18 15:17:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:55,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:55,682 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:55,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:55,883 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1343161106, now seen corresponding path program 1 times [2019-12-18 15:17:55,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:55,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504723356] [2019-12-18 15:17:55,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:17:55,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504723356] [2019-12-18 15:17:55,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:17:55,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:17:55,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784481141] [2019-12-18 15:17:55,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:17:55,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:55,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:17:55,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:17:55,926 INFO L87 Difference]: Start difference. First operand 2332 states and 9185 transitions. Second operand 5 states. [2019-12-18 15:17:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:56,030 INFO L93 Difference]: Finished difference Result 3954 states and 14252 transitions. [2019-12-18 15:17:56,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:17:56,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 15:17:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:56,037 INFO L225 Difference]: With dead ends: 3954 [2019-12-18 15:17:56,038 INFO L226 Difference]: Without dead ends: 3938 [2019-12-18 15:17:56,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:17:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2019-12-18 15:17:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 2601. [2019-12-18 15:17:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2601 states. [2019-12-18 15:17:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 10077 transitions. [2019-12-18 15:17:56,082 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 10077 transitions. Word has length 21 [2019-12-18 15:17:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:56,082 INFO L462 AbstractCegarLoop]: Abstraction has 2601 states and 10077 transitions. [2019-12-18 15:17:56,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:17:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 10077 transitions. [2019-12-18 15:17:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:56,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:56,083 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:56,083 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash -979520350, now seen corresponding path program 11 times [2019-12-18 15:17:56,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:56,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548265160] [2019-12-18 15:17:56,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:56,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548265160] [2019-12-18 15:17:56,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486879570] [2019-12-18 15:17:56,189 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:56,253 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 15:17:56,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:56,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:56,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:56,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:56,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:56,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605077285] [2019-12-18 15:17:56,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:56,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:56,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:56,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:56,401 INFO L87 Difference]: Start difference. First operand 2601 states and 10077 transitions. Second operand 24 states. [2019-12-18 15:17:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:17:58,837 INFO L93 Difference]: Finished difference Result 15951 states and 51064 transitions. [2019-12-18 15:17:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-18 15:17:58,838 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:17:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:17:58,862 INFO L225 Difference]: With dead ends: 15951 [2019-12-18 15:17:58,863 INFO L226 Difference]: Without dead ends: 15936 [2019-12-18 15:17:58,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1410, Invalid=6246, Unknown=0, NotChecked=0, Total=7656 [2019-12-18 15:17:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15936 states. [2019-12-18 15:17:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15936 to 2560. [2019-12-18 15:17:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2019-12-18 15:17:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 9859 transitions. [2019-12-18 15:17:58,973 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 9859 transitions. Word has length 21 [2019-12-18 15:17:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:17:58,973 INFO L462 AbstractCegarLoop]: Abstraction has 2560 states and 9859 transitions. [2019-12-18 15:17:58,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:17:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 9859 transitions. [2019-12-18 15:17:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:17:58,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:17:58,974 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:17:59,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:59,175 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:17:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:17:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash -987138910, now seen corresponding path program 12 times [2019-12-18 15:17:59,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:17:59,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645332737] [2019-12-18 15:17:59,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:17:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:17:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:59,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645332737] [2019-12-18 15:17:59,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283002171] [2019-12-18 15:17:59,270 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:17:59,339 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:17:59,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:17:59,340 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:17:59,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:17:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:17:59,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:17:59,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:17:59,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796417269] [2019-12-18 15:17:59,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:17:59,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:17:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:17:59,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:17:59,471 INFO L87 Difference]: Start difference. First operand 2560 states and 9859 transitions. Second operand 24 states. [2019-12-18 15:18:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:01,745 INFO L93 Difference]: Finished difference Result 13295 states and 42191 transitions. [2019-12-18 15:18:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-18 15:18:01,745 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:01,767 INFO L225 Difference]: With dead ends: 13295 [2019-12-18 15:18:01,767 INFO L226 Difference]: Without dead ends: 13286 [2019-12-18 15:18:01,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1182, Invalid=4980, Unknown=0, NotChecked=0, Total=6162 [2019-12-18 15:18:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13286 states. [2019-12-18 15:18:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13286 to 2558. [2019-12-18 15:18:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2019-12-18 15:18:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 9852 transitions. [2019-12-18 15:18:01,870 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 9852 transitions. Word has length 21 [2019-12-18 15:18:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:01,871 INFO L462 AbstractCegarLoop]: Abstraction has 2558 states and 9852 transitions. [2019-12-18 15:18:01,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:01,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 9852 transitions. [2019-12-18 15:18:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:01,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:01,872 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:02,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:02,073 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash -406937950, now seen corresponding path program 13 times [2019-12-18 15:18:02,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:02,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417670178] [2019-12-18 15:18:02,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:02,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417670178] [2019-12-18 15:18:02,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197284805] [2019-12-18 15:18:02,159 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:02,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:02,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:02,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:02,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:02,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256027716] [2019-12-18 15:18:02,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:02,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:02,360 INFO L87 Difference]: Start difference. First operand 2558 states and 9852 transitions. Second operand 24 states. [2019-12-18 15:18:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:05,596 INFO L93 Difference]: Finished difference Result 19063 states and 59545 transitions. [2019-12-18 15:18:05,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-18 15:18:05,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:05,631 INFO L225 Difference]: With dead ends: 19063 [2019-12-18 15:18:05,631 INFO L226 Difference]: Without dead ends: 19056 [2019-12-18 15:18:05,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2116, Invalid=9656, Unknown=0, NotChecked=0, Total=11772 [2019-12-18 15:18:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19056 states. [2019-12-18 15:18:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19056 to 2518. [2019-12-18 15:18:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-12-18 15:18:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 9680 transitions. [2019-12-18 15:18:05,764 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 9680 transitions. Word has length 21 [2019-12-18 15:18:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:05,765 INFO L462 AbstractCegarLoop]: Abstraction has 2518 states and 9680 transitions. [2019-12-18 15:18:05,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 9680 transitions. [2019-12-18 15:18:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:05,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:05,766 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:05,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:05,967 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash -415151710, now seen corresponding path program 14 times [2019-12-18 15:18:05,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:05,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548006830] [2019-12-18 15:18:05,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:06,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548006830] [2019-12-18 15:18:06,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189756880] [2019-12-18 15:18:06,051 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:06,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:18:06,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:06,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:06,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:06,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:06,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:06,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898526362] [2019-12-18 15:18:06,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:06,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:06,254 INFO L87 Difference]: Start difference. First operand 2518 states and 9680 transitions. Second operand 24 states. [2019-12-18 15:18:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:09,399 INFO L93 Difference]: Finished difference Result 16308 states and 49886 transitions. [2019-12-18 15:18:09,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-18 15:18:09,399 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:09,424 INFO L225 Difference]: With dead ends: 16308 [2019-12-18 15:18:09,424 INFO L226 Difference]: Without dead ends: 16298 [2019-12-18 15:18:09,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4358 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2157, Invalid=10053, Unknown=0, NotChecked=0, Total=12210 [2019-12-18 15:18:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16298 states. [2019-12-18 15:18:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16298 to 2475. [2019-12-18 15:18:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-12-18 15:18:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 9501 transitions. [2019-12-18 15:18:09,536 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 9501 transitions. Word has length 21 [2019-12-18 15:18:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:09,536 INFO L462 AbstractCegarLoop]: Abstraction has 2475 states and 9501 transitions. [2019-12-18 15:18:09,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 9501 transitions. [2019-12-18 15:18:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:09,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:09,538 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:09,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:09,739 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:09,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1659307204, now seen corresponding path program 15 times [2019-12-18 15:18:09,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:09,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231617277] [2019-12-18 15:18:09,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:09,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231617277] [2019-12-18 15:18:09,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718068948] [2019-12-18 15:18:09,829 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:09,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:18:09,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:09,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:09,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:10,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:10,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:10,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024348549] [2019-12-18 15:18:10,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:10,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:10,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:10,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:10,040 INFO L87 Difference]: Start difference. First operand 2475 states and 9501 transitions. Second operand 24 states. [2019-12-18 15:18:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:13,822 INFO L93 Difference]: Finished difference Result 18693 states and 58623 transitions. [2019-12-18 15:18:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-18 15:18:13,822 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:13,856 INFO L225 Difference]: With dead ends: 18693 [2019-12-18 15:18:13,856 INFO L226 Difference]: Without dead ends: 18683 [2019-12-18 15:18:13,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2478, Invalid=12284, Unknown=0, NotChecked=0, Total=14762 [2019-12-18 15:18:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18683 states. [2019-12-18 15:18:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18683 to 2531. [2019-12-18 15:18:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2531 states. [2019-12-18 15:18:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 9759 transitions. [2019-12-18 15:18:13,984 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 9759 transitions. Word has length 21 [2019-12-18 15:18:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:13,984 INFO L462 AbstractCegarLoop]: Abstraction has 2531 states and 9759 transitions. [2019-12-18 15:18:13,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 9759 transitions. [2019-12-18 15:18:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:13,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:13,985 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:14,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:14,186 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1492579422, now seen corresponding path program 16 times [2019-12-18 15:18:14,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:14,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353214781] [2019-12-18 15:18:14,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:14,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353214781] [2019-12-18 15:18:14,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642468430] [2019-12-18 15:18:14,301 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:14,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:18:14,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:14,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:14,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:14,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:14,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:14,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775357320] [2019-12-18 15:18:14,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:14,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:14,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:14,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:14,521 INFO L87 Difference]: Start difference. First operand 2531 states and 9759 transitions. Second operand 24 states. [2019-12-18 15:18:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:19,314 INFO L93 Difference]: Finished difference Result 21288 states and 66116 transitions. [2019-12-18 15:18:19,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-12-18 15:18:19,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:19,350 INFO L225 Difference]: With dead ends: 21288 [2019-12-18 15:18:19,351 INFO L226 Difference]: Without dead ends: 21284 [2019-12-18 15:18:19,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8454 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3579, Invalid=18473, Unknown=0, NotChecked=0, Total=22052 [2019-12-18 15:18:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21284 states. [2019-12-18 15:18:19,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21284 to 2548. [2019-12-18 15:18:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2019-12-18 15:18:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 9832 transitions. [2019-12-18 15:18:19,494 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 9832 transitions. Word has length 21 [2019-12-18 15:18:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:19,494 INFO L462 AbstractCegarLoop]: Abstraction has 2548 states and 9832 transitions. [2019-12-18 15:18:19,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 9832 transitions. [2019-12-18 15:18:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:19,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:19,495 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:19,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:19,696 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1335167582, now seen corresponding path program 17 times [2019-12-18 15:18:19,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:19,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77231092] [2019-12-18 15:18:19,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:19,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77231092] [2019-12-18 15:18:19,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265189914] [2019-12-18 15:18:19,780 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:19,846 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 15:18:19,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:19,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:19,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:19,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:19,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:19,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893908333] [2019-12-18 15:18:19,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:19,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:19,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:19,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:19,986 INFO L87 Difference]: Start difference. First operand 2548 states and 9832 transitions. Second operand 24 states. [2019-12-18 15:18:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:22,877 INFO L93 Difference]: Finished difference Result 14142 states and 44431 transitions. [2019-12-18 15:18:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-18 15:18:22,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:22,900 INFO L225 Difference]: With dead ends: 14142 [2019-12-18 15:18:22,900 INFO L226 Difference]: Without dead ends: 14130 [2019-12-18 15:18:22,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3087 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1681, Invalid=7439, Unknown=0, NotChecked=0, Total=9120 [2019-12-18 15:18:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14130 states. [2019-12-18 15:18:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14130 to 2503. [2019-12-18 15:18:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2019-12-18 15:18:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 9642 transitions. [2019-12-18 15:18:23,013 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 9642 transitions. Word has length 21 [2019-12-18 15:18:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:23,013 INFO L462 AbstractCegarLoop]: Abstraction has 2503 states and 9642 transitions. [2019-12-18 15:18:23,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 9642 transitions. [2019-12-18 15:18:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:23,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:23,015 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:23,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:23,218 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:23,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash -489489332, now seen corresponding path program 18 times [2019-12-18 15:18:23,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:23,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358279109] [2019-12-18 15:18:23,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:23,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358279109] [2019-12-18 15:18:23,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173379102] [2019-12-18 15:18:23,302 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:23,364 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:18:23,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:23,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:23,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:23,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:23,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:23,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333942596] [2019-12-18 15:18:23,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:23,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:23,515 INFO L87 Difference]: Start difference. First operand 2503 states and 9642 transitions. Second operand 24 states. [2019-12-18 15:18:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:28,231 INFO L93 Difference]: Finished difference Result 17125 states and 52678 transitions. [2019-12-18 15:18:28,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-12-18 15:18:28,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:28,258 INFO L225 Difference]: With dead ends: 17125 [2019-12-18 15:18:28,259 INFO L226 Difference]: Without dead ends: 17115 [2019-12-18 15:18:28,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6084 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2900, Invalid=14130, Unknown=0, NotChecked=0, Total=17030 [2019-12-18 15:18:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17115 states. [2019-12-18 15:18:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17115 to 2513. [2019-12-18 15:18:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-12-18 15:18:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 9683 transitions. [2019-12-18 15:18:28,379 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 9683 transitions. Word has length 21 [2019-12-18 15:18:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:28,379 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 9683 transitions. [2019-12-18 15:18:28,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 9683 transitions. [2019-12-18 15:18:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:28,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:28,380 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:28,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:28,581 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash 653591338, now seen corresponding path program 19 times [2019-12-18 15:18:28,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:28,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856786440] [2019-12-18 15:18:28,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:28,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856786440] [2019-12-18 15:18:28,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470355841] [2019-12-18 15:18:28,671 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:28,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:28,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:28,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:28,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:28,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774448340] [2019-12-18 15:18:28,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:28,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:28,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:28,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:28,883 INFO L87 Difference]: Start difference. First operand 2513 states and 9683 transitions. Second operand 24 states. [2019-12-18 15:18:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:34,216 INFO L93 Difference]: Finished difference Result 20020 states and 60843 transitions. [2019-12-18 15:18:34,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-12-18 15:18:34,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:34,248 INFO L225 Difference]: With dead ends: 20020 [2019-12-18 15:18:34,249 INFO L226 Difference]: Without dead ends: 20012 [2019-12-18 15:18:34,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10655 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4446, Invalid=22944, Unknown=0, NotChecked=0, Total=27390 [2019-12-18 15:18:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20012 states. [2019-12-18 15:18:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20012 to 2553. [2019-12-18 15:18:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-18 15:18:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 9855 transitions. [2019-12-18 15:18:34,446 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 9855 transitions. Word has length 21 [2019-12-18 15:18:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:34,446 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 9855 transitions. [2019-12-18 15:18:34,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 9855 transitions. [2019-12-18 15:18:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:34,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:34,448 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:34,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:34,649 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 811003178, now seen corresponding path program 20 times [2019-12-18 15:18:34,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:34,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879309180] [2019-12-18 15:18:34,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:34,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879309180] [2019-12-18 15:18:34,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351988973] [2019-12-18 15:18:34,729 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:34,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:18:34,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:34,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:34,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:34,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:34,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:34,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324693511] [2019-12-18 15:18:34,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:34,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:34,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:34,940 INFO L87 Difference]: Start difference. First operand 2553 states and 9855 transitions. Second operand 24 states. [2019-12-18 15:18:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:38,211 INFO L93 Difference]: Finished difference Result 12600 states and 38777 transitions. [2019-12-18 15:18:38,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-18 15:18:38,211 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:38,230 INFO L225 Difference]: With dead ends: 12600 [2019-12-18 15:18:38,230 INFO L226 Difference]: Without dead ends: 12588 [2019-12-18 15:18:38,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2039, Invalid=9091, Unknown=0, NotChecked=0, Total=11130 [2019-12-18 15:18:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12588 states. [2019-12-18 15:18:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12588 to 2459. [2019-12-18 15:18:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2019-12-18 15:18:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 9444 transitions. [2019-12-18 15:18:38,333 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 9444 transitions. Word has length 21 [2019-12-18 15:18:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:38,333 INFO L462 AbstractCegarLoop]: Abstraction has 2459 states and 9444 transitions. [2019-12-18 15:18:38,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 9444 transitions. [2019-12-18 15:18:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:38,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:38,335 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:38,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:38,539 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash 255213166, now seen corresponding path program 21 times [2019-12-18 15:18:38,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:38,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346224721] [2019-12-18 15:18:38,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:38,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346224721] [2019-12-18 15:18:38,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431236385] [2019-12-18 15:18:38,620 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:38,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:18:38,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:38,690 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:38,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:38,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:38,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:38,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735511498] [2019-12-18 15:18:38,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:38,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:38,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:38,846 INFO L87 Difference]: Start difference. First operand 2459 states and 9444 transitions. Second operand 24 states. [2019-12-18 15:18:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:45,353 INFO L93 Difference]: Finished difference Result 18582 states and 55698 transitions. [2019-12-18 15:18:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-12-18 15:18:45,353 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:45,446 INFO L225 Difference]: With dead ends: 18582 [2019-12-18 15:18:45,447 INFO L226 Difference]: Without dead ends: 18575 [2019-12-18 15:18:45,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14530 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5259, Invalid=30273, Unknown=0, NotChecked=0, Total=35532 [2019-12-18 15:18:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18575 states. [2019-12-18 15:18:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18575 to 2434. [2019-12-18 15:18:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-12-18 15:18:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9333 transitions. [2019-12-18 15:18:45,556 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9333 transitions. Word has length 21 [2019-12-18 15:18:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:45,557 INFO L462 AbstractCegarLoop]: Abstraction has 2434 states and 9333 transitions. [2019-12-18 15:18:45,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9333 transitions. [2019-12-18 15:18:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:45,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:45,558 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:45,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:45,760 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:45,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:45,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1555705676, now seen corresponding path program 22 times [2019-12-18 15:18:45,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:45,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718327311] [2019-12-18 15:18:45,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:45,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718327311] [2019-12-18 15:18:45,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146663969] [2019-12-18 15:18:45,853 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:45,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:18:45,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:45,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:45,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:46,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:46,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:46,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400515499] [2019-12-18 15:18:46,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:46,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:46,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:46,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:46,058 INFO L87 Difference]: Start difference. First operand 2434 states and 9333 transitions. Second operand 24 states. [2019-12-18 15:18:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:50,187 INFO L93 Difference]: Finished difference Result 13277 states and 40283 transitions. [2019-12-18 15:18:50,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-18 15:18:50,187 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:50,208 INFO L225 Difference]: With dead ends: 13277 [2019-12-18 15:18:50,208 INFO L226 Difference]: Without dead ends: 13267 [2019-12-18 15:18:50,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5850 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2692, Invalid=12808, Unknown=0, NotChecked=0, Total=15500 [2019-12-18 15:18:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13267 states. [2019-12-18 15:18:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13267 to 2361. [2019-12-18 15:18:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2361 states. [2019-12-18 15:18:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 9038 transitions. [2019-12-18 15:18:50,303 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 9038 transitions. Word has length 21 [2019-12-18 15:18:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:50,303 INFO L462 AbstractCegarLoop]: Abstraction has 2361 states and 9038 transitions. [2019-12-18 15:18:50,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 9038 transitions. [2019-12-18 15:18:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:50,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:50,305 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:50,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:50,505 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash 236779140, now seen corresponding path program 23 times [2019-12-18 15:18:50,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:50,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788540472] [2019-12-18 15:18:50,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:50,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788540472] [2019-12-18 15:18:50,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67210765] [2019-12-18 15:18:50,593 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:50,696 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 15:18:50,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:50,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:50,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:50,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:50,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:18:50,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018059249] [2019-12-18 15:18:50,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:18:50,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:18:50,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:18:50,847 INFO L87 Difference]: Start difference. First operand 2361 states and 9038 transitions. Second operand 24 states. [2019-12-18 15:18:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:18:57,381 INFO L93 Difference]: Finished difference Result 23694 states and 71543 transitions. [2019-12-18 15:18:57,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-12-18 15:18:57,382 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:18:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:18:57,420 INFO L225 Difference]: With dead ends: 23694 [2019-12-18 15:18:57,420 INFO L226 Difference]: Without dead ends: 23685 [2019-12-18 15:18:57,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16133 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6860, Invalid=32146, Unknown=0, NotChecked=0, Total=39006 [2019-12-18 15:18:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23685 states. [2019-12-18 15:18:57,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23685 to 2337. [2019-12-18 15:18:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-12-18 15:18:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 8931 transitions. [2019-12-18 15:18:57,578 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 8931 transitions. Word has length 21 [2019-12-18 15:18:57,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:18:57,578 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 8931 transitions. [2019-12-18 15:18:57,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:18:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 8931 transitions. [2019-12-18 15:18:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:18:57,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:18:57,579 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:18:57,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:57,780 INFO L410 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:18:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:18:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash -337889250, now seen corresponding path program 24 times [2019-12-18 15:18:57,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:18:57,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427088951] [2019-12-18 15:18:57,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:18:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:18:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:57,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427088951] [2019-12-18 15:18:57,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30569385] [2019-12-18 15:18:57,856 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:18:57,921 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:18:57,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:18:57,922 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:18:57,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:18:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:18:58,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:18:58,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 15:18:58,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617345547] [2019-12-18 15:18:58,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:18:58,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:18:58,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:18:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:18:58,061 INFO L87 Difference]: Start difference. First operand 2337 states and 8931 transitions. Second operand 23 states. [2019-12-18 15:19:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:02,088 INFO L93 Difference]: Finished difference Result 11571 states and 34108 transitions. [2019-12-18 15:19:02,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-18 15:19:02,088 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 15:19:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:02,104 INFO L225 Difference]: With dead ends: 11571 [2019-12-18 15:19:02,104 INFO L226 Difference]: Without dead ends: 11566 [2019-12-18 15:19:02,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6899 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2919, Invalid=14903, Unknown=0, NotChecked=0, Total=17822 [2019-12-18 15:19:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11566 states. [2019-12-18 15:19:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11566 to 2335. [2019-12-18 15:19:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-12-18 15:19:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 8925 transitions. [2019-12-18 15:19:02,187 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 8925 transitions. Word has length 21 [2019-12-18 15:19:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:02,187 INFO L462 AbstractCegarLoop]: Abstraction has 2335 states and 8925 transitions. [2019-12-18 15:19:02,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:19:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 8925 transitions. [2019-12-18 15:19:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:02,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:02,188 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:02,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:02,389 INFO L410 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash 621224380, now seen corresponding path program 25 times [2019-12-18 15:19:02,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:02,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038587638] [2019-12-18 15:19:02,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:02,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038587638] [2019-12-18 15:19:02,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956131535] [2019-12-18 15:19:02,491 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:02,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:02,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:02,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:02,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:02,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536167370] [2019-12-18 15:19:02,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:02,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:02,708 INFO L87 Difference]: Start difference. First operand 2335 states and 8925 transitions. Second operand 24 states. [2019-12-18 15:19:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:08,262 INFO L93 Difference]: Finished difference Result 24068 states and 75584 transitions. [2019-12-18 15:19:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-12-18 15:19:08,262 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:19:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:08,303 INFO L225 Difference]: With dead ends: 24068 [2019-12-18 15:19:08,303 INFO L226 Difference]: Without dead ends: 24061 [2019-12-18 15:19:08,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10912 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5105, Invalid=23287, Unknown=0, NotChecked=0, Total=28392 [2019-12-18 15:19:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24061 states. [2019-12-18 15:19:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24061 to 2331. [2019-12-18 15:19:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2019-12-18 15:19:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 8915 transitions. [2019-12-18 15:19:08,462 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 8915 transitions. Word has length 21 [2019-12-18 15:19:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:08,462 INFO L462 AbstractCegarLoop]: Abstraction has 2331 states and 8915 transitions. [2019-12-18 15:19:08,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:19:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 8915 transitions. [2019-12-18 15:19:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:08,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:08,464 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:08,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:08,665 INFO L410 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash 621819580, now seen corresponding path program 26 times [2019-12-18 15:19:08,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:08,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628520927] [2019-12-18 15:19:08,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:08,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628520927] [2019-12-18 15:19:08,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166243859] [2019-12-18 15:19:08,773 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:08,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:19:08,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:08,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:08,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:09,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:09,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:09,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134957895] [2019-12-18 15:19:09,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:09,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:09,004 INFO L87 Difference]: Start difference. First operand 2331 states and 8915 transitions. Second operand 24 states. [2019-12-18 15:19:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:14,337 INFO L93 Difference]: Finished difference Result 22747 states and 71581 transitions. [2019-12-18 15:19:14,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-12-18 15:19:14,337 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:19:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:14,376 INFO L225 Difference]: With dead ends: 22747 [2019-12-18 15:19:14,376 INFO L226 Difference]: Without dead ends: 22738 [2019-12-18 15:19:14,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9659 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4688, Invalid=21072, Unknown=0, NotChecked=0, Total=25760 [2019-12-18 15:19:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22738 states. [2019-12-18 15:19:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22738 to 2248. [2019-12-18 15:19:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-12-18 15:19:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 8554 transitions. [2019-12-18 15:19:14,531 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 8554 transitions. Word has length 21 [2019-12-18 15:19:14,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:14,531 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 8554 transitions. [2019-12-18 15:19:14,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:19:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 8554 transitions. [2019-12-18 15:19:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:14,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:14,533 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:14,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:14,735 INFO L410 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:14,736 INFO L82 PathProgramCache]: Analyzing trace with hash -389879526, now seen corresponding path program 27 times [2019-12-18 15:19:14,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:14,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334534401] [2019-12-18 15:19:14,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:14,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334534401] [2019-12-18 15:19:14,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989858400] [2019-12-18 15:19:14,823 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:14,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:19:14,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:14,886 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:14,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:15,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:15,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:15,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324926804] [2019-12-18 15:19:15,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:15,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:15,038 INFO L87 Difference]: Start difference. First operand 2248 states and 8554 transitions. Second operand 24 states. [2019-12-18 15:19:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:18,722 INFO L93 Difference]: Finished difference Result 14023 states and 42219 transitions. [2019-12-18 15:19:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-18 15:19:18,722 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:19:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:18,743 INFO L225 Difference]: With dead ends: 14023 [2019-12-18 15:19:18,743 INFO L226 Difference]: Without dead ends: 14017 [2019-12-18 15:19:18,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5584 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2666, Invalid=13084, Unknown=0, NotChecked=0, Total=15750 [2019-12-18 15:19:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14017 states. [2019-12-18 15:19:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14017 to 2267. [2019-12-18 15:19:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-18 15:19:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8634 transitions. [2019-12-18 15:19:18,841 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8634 transitions. Word has length 21 [2019-12-18 15:19:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:18,841 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8634 transitions. [2019-12-18 15:19:18,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:19:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8634 transitions. [2019-12-18 15:19:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:18,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:18,842 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:19,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:19,043 INFO L410 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash -389284326, now seen corresponding path program 28 times [2019-12-18 15:19:19,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:19,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15080072] [2019-12-18 15:19:19,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:19,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15080072] [2019-12-18 15:19:19,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870892634] [2019-12-18 15:19:19,180 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:19,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:19:19,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:19,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:19,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:19,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:19,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:19,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589058409] [2019-12-18 15:19:19,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:19,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:19,499 INFO L87 Difference]: Start difference. First operand 2267 states and 8634 transitions. Second operand 24 states. [2019-12-18 15:19:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:22,678 INFO L93 Difference]: Finished difference Result 12677 states and 38921 transitions. [2019-12-18 15:19:22,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-18 15:19:22,678 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:19:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:22,703 INFO L225 Difference]: With dead ends: 12677 [2019-12-18 15:19:22,703 INFO L226 Difference]: Without dead ends: 12670 [2019-12-18 15:19:22,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2101, Invalid=9455, Unknown=0, NotChecked=0, Total=11556 [2019-12-18 15:19:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12670 states. [2019-12-18 15:19:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12670 to 2249. [2019-12-18 15:19:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2249 states. [2019-12-18 15:19:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 8557 transitions. [2019-12-18 15:19:22,845 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 8557 transitions. Word has length 21 [2019-12-18 15:19:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:22,845 INFO L462 AbstractCegarLoop]: Abstraction has 2249 states and 8557 transitions. [2019-12-18 15:19:22,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:19:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 8557 transitions. [2019-12-18 15:19:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:22,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:22,846 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:23,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:23,047 INFO L410 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash 141601306, now seen corresponding path program 29 times [2019-12-18 15:19:23,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:23,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734323716] [2019-12-18 15:19:23,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:23,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734323716] [2019-12-18 15:19:23,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472045428] [2019-12-18 15:19:23,153 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:23,219 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 15:19:23,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:23,220 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:23,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:23,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:23,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:23,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415855095] [2019-12-18 15:19:23,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:23,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:23,367 INFO L87 Difference]: Start difference. First operand 2249 states and 8557 transitions. Second operand 24 states. [2019-12-18 15:19:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:28,911 INFO L93 Difference]: Finished difference Result 17894 states and 53668 transitions. [2019-12-18 15:19:28,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-12-18 15:19:28,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:19:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:28,938 INFO L225 Difference]: With dead ends: 17894 [2019-12-18 15:19:28,938 INFO L226 Difference]: Without dead ends: 17883 [2019-12-18 15:19:28,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10760 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4487, Invalid=23569, Unknown=0, NotChecked=0, Total=28056 [2019-12-18 15:19:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17883 states. [2019-12-18 15:19:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17883 to 2288. [2019-12-18 15:19:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2288 states. [2019-12-18 15:19:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 8718 transitions. [2019-12-18 15:19:29,054 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 8718 transitions. Word has length 21 [2019-12-18 15:19:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:29,054 INFO L462 AbstractCegarLoop]: Abstraction has 2288 states and 8718 transitions. [2019-12-18 15:19:29,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:19:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 8718 transitions. [2019-12-18 15:19:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:29,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:29,056 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:29,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:29,259 INFO L410 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1879284522, now seen corresponding path program 30 times [2019-12-18 15:19:29,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:29,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110720169] [2019-12-18 15:19:29,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:29,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110720169] [2019-12-18 15:19:29,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547139366] [2019-12-18 15:19:29,355 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:29,417 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:19:29,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:29,418 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:29,418 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:29,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:29,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:29,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353339903] [2019-12-18 15:19:29,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:29,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:29,637 INFO L87 Difference]: Start difference. First operand 2288 states and 8718 transitions. Second operand 24 states. [2019-12-18 15:19:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:34,842 INFO L93 Difference]: Finished difference Result 14223 states and 42268 transitions. [2019-12-18 15:19:34,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-12-18 15:19:34,842 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:19:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:34,863 INFO L225 Difference]: With dead ends: 14223 [2019-12-18 15:19:34,863 INFO L226 Difference]: Without dead ends: 14214 [2019-12-18 15:19:34,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8336 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3428, Invalid=18034, Unknown=0, NotChecked=0, Total=21462 [2019-12-18 15:19:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14214 states. [2019-12-18 15:19:34,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14214 to 2295. [2019-12-18 15:19:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2019-12-18 15:19:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 8743 transitions. [2019-12-18 15:19:34,966 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 8743 transitions. Word has length 21 [2019-12-18 15:19:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:34,966 INFO L462 AbstractCegarLoop]: Abstraction has 2295 states and 8743 transitions. [2019-12-18 15:19:34,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:19:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 8743 transitions. [2019-12-18 15:19:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:34,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:34,968 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:35,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:35,169 INFO L410 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1878689322, now seen corresponding path program 31 times [2019-12-18 15:19:35,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:35,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396657860] [2019-12-18 15:19:35,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:35,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396657860] [2019-12-18 15:19:35,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541121322] [2019-12-18 15:19:35,258 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:35,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:35,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:35,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:35,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:35,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37867083] [2019-12-18 15:19:35,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:35,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:35,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:35,472 INFO L87 Difference]: Start difference. First operand 2295 states and 8743 transitions. Second operand 24 states. [2019-12-18 15:19:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:39,540 INFO L93 Difference]: Finished difference Result 13463 states and 40671 transitions. [2019-12-18 15:19:39,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-18 15:19:39,540 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:19:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:39,559 INFO L225 Difference]: With dead ends: 13463 [2019-12-18 15:19:39,559 INFO L226 Difference]: Without dead ends: 13453 [2019-12-18 15:19:39,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2757, Invalid=13245, Unknown=0, NotChecked=0, Total=16002 [2019-12-18 15:19:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13453 states. [2019-12-18 15:19:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13453 to 2277. [2019-12-18 15:19:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2019-12-18 15:19:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 8666 transitions. [2019-12-18 15:19:39,649 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 8666 transitions. Word has length 21 [2019-12-18 15:19:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:39,649 INFO L462 AbstractCegarLoop]: Abstraction has 2277 states and 8666 transitions. [2019-12-18 15:19:39,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:19:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 8666 transitions. [2019-12-18 15:19:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:39,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:39,651 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:39,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:39,851 INFO L410 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1783527146, now seen corresponding path program 32 times [2019-12-18 15:19:39,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:39,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541967877] [2019-12-18 15:19:39,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:39,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541967877] [2019-12-18 15:19:39,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851664798] [2019-12-18 15:19:39,945 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:40,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:19:40,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:40,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:40,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:40,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:40,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:40,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48397751] [2019-12-18 15:19:40,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:40,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:40,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:40,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:40,169 INFO L87 Difference]: Start difference. First operand 2277 states and 8666 transitions. Second operand 24 states. [2019-12-18 15:19:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:46,681 INFO L93 Difference]: Finished difference Result 16514 states and 48887 transitions. [2019-12-18 15:19:46,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-12-18 15:19:46,682 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:19:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:46,706 INFO L225 Difference]: With dead ends: 16514 [2019-12-18 15:19:46,706 INFO L226 Difference]: Without dead ends: 16507 [2019-12-18 15:19:46,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13770 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5147, Invalid=29263, Unknown=0, NotChecked=0, Total=34410 [2019-12-18 15:19:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16507 states. [2019-12-18 15:19:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16507 to 2251. [2019-12-18 15:19:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2019-12-18 15:19:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 8560 transitions. [2019-12-18 15:19:46,817 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 8560 transitions. Word has length 21 [2019-12-18 15:19:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:46,817 INFO L462 AbstractCegarLoop]: Abstraction has 2251 states and 8560 transitions. [2019-12-18 15:19:46,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:19:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 8560 transitions. [2019-12-18 15:19:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:46,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:46,818 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:47,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:47,019 INFO L410 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -474063010, now seen corresponding path program 33 times [2019-12-18 15:19:47,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:47,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974524493] [2019-12-18 15:19:47,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:47,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974524493] [2019-12-18 15:19:47,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490422323] [2019-12-18 15:19:47,097 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:47,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:19:47,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:47,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:47,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:47,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:47,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 15:19:47,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843379513] [2019-12-18 15:19:47,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:19:47,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:19:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:47,307 INFO L87 Difference]: Start difference. First operand 2251 states and 8560 transitions. Second operand 23 states. [2019-12-18 15:19:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:51,404 INFO L93 Difference]: Finished difference Result 10482 states and 30730 transitions. [2019-12-18 15:19:51,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-18 15:19:51,404 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 15:19:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:51,419 INFO L225 Difference]: With dead ends: 10482 [2019-12-18 15:19:51,419 INFO L226 Difference]: Without dead ends: 10477 [2019-12-18 15:19:51,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6783 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2908, Invalid=15182, Unknown=0, NotChecked=0, Total=18090 [2019-12-18 15:19:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10477 states. [2019-12-18 15:19:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10477 to 2253. [2019-12-18 15:19:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-18 15:19:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 8566 transitions. [2019-12-18 15:19:51,497 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 8566 transitions. Word has length 21 [2019-12-18 15:19:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:51,497 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 8566 transitions. [2019-12-18 15:19:51,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:19:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 8566 transitions. [2019-12-18 15:19:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:51,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:51,498 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:51,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:51,699 INFO L410 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:51,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash 384811520, now seen corresponding path program 34 times [2019-12-18 15:19:51,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:51,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851637443] [2019-12-18 15:19:51,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:51,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851637443] [2019-12-18 15:19:51,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832624910] [2019-12-18 15:19:51,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:51,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:19:51,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:51,844 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:51,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:51,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:51,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 15:19:51,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193495192] [2019-12-18 15:19:51,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:19:51,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:51,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:19:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:19:51,993 INFO L87 Difference]: Start difference. First operand 2253 states and 8566 transitions. Second operand 23 states. [2019-12-18 15:19:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:19:55,967 INFO L93 Difference]: Finished difference Result 10560 states and 31108 transitions. [2019-12-18 15:19:55,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-18 15:19:55,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 15:19:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:19:55,983 INFO L225 Difference]: With dead ends: 10560 [2019-12-18 15:19:55,983 INFO L226 Difference]: Without dead ends: 10554 [2019-12-18 15:19:55,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6240 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2677, Invalid=13835, Unknown=0, NotChecked=0, Total=16512 [2019-12-18 15:19:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2019-12-18 15:19:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 2232. [2019-12-18 15:19:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-12-18 15:19:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 8512 transitions. [2019-12-18 15:19:56,060 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 8512 transitions. Word has length 21 [2019-12-18 15:19:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:19:56,060 INFO L462 AbstractCegarLoop]: Abstraction has 2232 states and 8512 transitions. [2019-12-18 15:19:56,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:19:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 8512 transitions. [2019-12-18 15:19:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:19:56,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:19:56,061 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:19:56,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:56,262 INFO L410 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:19:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:19:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1841771060, now seen corresponding path program 35 times [2019-12-18 15:19:56,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:19:56,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131715358] [2019-12-18 15:19:56,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:19:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:19:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:56,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131715358] [2019-12-18 15:19:56,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376158835] [2019-12-18 15:19:56,385 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:19:56,447 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 15:19:56,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:19:56,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:19:56,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:19:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:19:56,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:19:56,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:19:56,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965530523] [2019-12-18 15:19:56,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:19:56,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:19:56,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:19:56,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:19:56,593 INFO L87 Difference]: Start difference. First operand 2232 states and 8512 transitions. Second operand 24 states. [2019-12-18 15:20:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:00,671 INFO L93 Difference]: Finished difference Result 12790 states and 38778 transitions. [2019-12-18 15:20:00,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-18 15:20:00,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:20:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:00,690 INFO L225 Difference]: With dead ends: 12790 [2019-12-18 15:20:00,690 INFO L226 Difference]: Without dead ends: 12780 [2019-12-18 15:20:00,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6264 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2803, Invalid=13967, Unknown=0, NotChecked=0, Total=16770 [2019-12-18 15:20:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12780 states. [2019-12-18 15:20:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12780 to 2115. [2019-12-18 15:20:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-12-18 15:20:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 8089 transitions. [2019-12-18 15:20:00,779 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 8089 transitions. Word has length 21 [2019-12-18 15:20:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:00,780 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 8089 transitions. [2019-12-18 15:20:00,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:20:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 8089 transitions. [2019-12-18 15:20:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:20:00,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:00,781 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:00,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:00,982 INFO L410 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:20:00,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:00,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1316541292, now seen corresponding path program 1 times [2019-12-18 15:20:00,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:00,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353990421] [2019-12-18 15:20:00,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:20:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:20:00,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:20:00,999 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:20:00,999 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:20:00,999 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-18 15:20:01,014 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,015 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,015 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,015 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,015 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,015 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,015 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,015 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,015 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,016 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,016 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,016 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,016 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,016 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,016 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,016 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,017 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,017 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,017 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,017 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,017 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,017 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,017 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,017 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,018 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,018 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,018 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,018 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,018 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,018 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,018 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,018 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,019 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,019 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,019 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,019 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,019 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,019 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,019 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,019 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,020 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,020 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,020 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,020 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,020 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,020 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,020 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,022 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,022 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,022 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,024 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,024 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,026 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,026 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,026 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,026 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,026 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,026 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,026 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,026 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,028 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,029 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,029 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,029 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,029 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,029 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,030 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,030 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,030 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,030 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,030 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,031 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,031 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,031 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,031 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,031 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,032 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,033 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,033 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,033 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,033 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,034 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,034 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,034 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,034 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,035 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,035 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,035 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,035 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,036 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,036 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,036 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,036 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,037 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,037 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,037 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,037 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,037 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,038 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,038 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,038 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,038 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,038 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,038 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,039 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,039 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,039 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,039 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,039 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,039 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,040 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,040 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,040 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,040 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,040 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,041 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:20:01,041 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 15:20:01,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:20:01,042 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:20:01,042 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:20:01,042 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:20:01,042 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:20:01,042 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:20:01,042 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:20:01,042 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:20:01,044 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 128 transitions [2019-12-18 15:20:01,044 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 128 transitions [2019-12-18 15:20:01,061 INFO L126 PetriNetUnfolder]: 7/154 cut-off events. [2019-12-18 15:20:01,062 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:20:01,064 INFO L76 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 154 events. 7/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs. 80/220 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2019-12-18 15:20:01,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 128 transitions [2019-12-18 15:20:01,087 INFO L126 PetriNetUnfolder]: 7/154 cut-off events. [2019-12-18 15:20:01,088 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:20:01,090 INFO L76 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 154 events. 7/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs. 80/220 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2019-12-18 15:20:01,097 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-18 15:20:01,097 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:20:03,217 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-18 15:20:03,315 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3419 [2019-12-18 15:20:03,315 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 15:20:03,315 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-18 15:20:03,630 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-18 15:20:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-18 15:20:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:20:03,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:03,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:20:03,630 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:03,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:03,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1051879, now seen corresponding path program 1 times [2019-12-18 15:20:03,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:03,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516822266] [2019-12-18 15:20:03,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:03,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516822266] [2019-12-18 15:20:03,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:03,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:20:03,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956967100] [2019-12-18 15:20:03,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:20:03,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:03,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:20:03,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:20:03,654 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-18 15:20:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:03,727 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-18 15:20:03,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:20:03,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:20:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:03,745 INFO L225 Difference]: With dead ends: 5844 [2019-12-18 15:20:03,745 INFO L226 Difference]: Without dead ends: 5479 [2019-12-18 15:20:03,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:20:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-18 15:20:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-18 15:20:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-18 15:20:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-18 15:20:03,838 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-18 15:20:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:03,838 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-18 15:20:03,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:20:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-18 15:20:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:20:03,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:03,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:03,839 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:03,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:03,839 INFO L82 PathProgramCache]: Analyzing trace with hash -598137854, now seen corresponding path program 1 times [2019-12-18 15:20:03,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:03,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493047163] [2019-12-18 15:20:03,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:03,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493047163] [2019-12-18 15:20:03,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:03,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:20:03,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389852471] [2019-12-18 15:20:03,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:20:03,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:03,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:20:03,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:20:03,863 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-18 15:20:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:04,002 INFO L93 Difference]: Finished difference Result 11058 states and 45915 transitions. [2019-12-18 15:20:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:20:04,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:20:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:04,025 INFO L225 Difference]: With dead ends: 11058 [2019-12-18 15:20:04,026 INFO L226 Difference]: Without dead ends: 11055 [2019-12-18 15:20:04,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:20:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2019-12-18 15:20:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 6120. [2019-12-18 15:20:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-18 15:20:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-18 15:20:04,168 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-18 15:20:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:04,168 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-18 15:20:04,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:20:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-18 15:20:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:20:04,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:04,169 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:04,169 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 63286460, now seen corresponding path program 1 times [2019-12-18 15:20:04,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:04,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92805438] [2019-12-18 15:20:04,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:20:04,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92805438] [2019-12-18 15:20:04,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:04,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:20:04,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687956205] [2019-12-18 15:20:04,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:20:04,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:04,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:20:04,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:20:04,204 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-18 15:20:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:04,765 INFO L93 Difference]: Finished difference Result 12424 states and 52328 transitions. [2019-12-18 15:20:04,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:20:04,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:20:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:04,791 INFO L225 Difference]: With dead ends: 12424 [2019-12-18 15:20:04,792 INFO L226 Difference]: Without dead ends: 12420 [2019-12-18 15:20:04,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:20:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2019-12-18 15:20:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 7145. [2019-12-18 15:20:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 15:20:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-18 15:20:04,960 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-18 15:20:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:04,960 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-18 15:20:04,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:20:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-18 15:20:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:20:04,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:04,961 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:04,961 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash -697924765, now seen corresponding path program 1 times [2019-12-18 15:20:04,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:04,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203049384] [2019-12-18 15:20:04,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:05,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203049384] [2019-12-18 15:20:05,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067157786] [2019-12-18 15:20:05,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:05,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:20:05,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:20:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:05,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:20:05,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:20:05,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83952201] [2019-12-18 15:20:05,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:20:05,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:05,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:20:05,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:20:05,207 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 18 states. [2019-12-18 15:20:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:06,237 INFO L93 Difference]: Finished difference Result 22393 states and 85334 transitions. [2019-12-18 15:20:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:20:06,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:20:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:06,282 INFO L225 Difference]: With dead ends: 22393 [2019-12-18 15:20:06,282 INFO L226 Difference]: Without dead ends: 22388 [2019-12-18 15:20:06,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 15:20:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22388 states. [2019-12-18 15:20:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22388 to 7191. [2019-12-18 15:20:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7191 states. [2019-12-18 15:20:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7191 states to 7191 states and 33225 transitions. [2019-12-18 15:20:06,516 INFO L78 Accepts]: Start accepts. Automaton has 7191 states and 33225 transitions. Word has length 15 [2019-12-18 15:20:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:06,516 INFO L462 AbstractCegarLoop]: Abstraction has 7191 states and 33225 transitions. [2019-12-18 15:20:06,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:20:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7191 states and 33225 transitions. [2019-12-18 15:20:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:20:06,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:06,517 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:06,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:06,718 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash 688753653, now seen corresponding path program 2 times [2019-12-18 15:20:06,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:06,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117391371] [2019-12-18 15:20:06,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:06,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117391371] [2019-12-18 15:20:06,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687095637] [2019-12-18 15:20:06,778 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:06,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:20:06,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:20:06,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:20:06,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:20:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:07,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:20:07,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-18 15:20:07,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901132923] [2019-12-18 15:20:07,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:20:07,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:20:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:20:07,108 INFO L87 Difference]: Start difference. First operand 7191 states and 33225 transitions. Second operand 18 states. [2019-12-18 15:20:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:08,126 INFO L93 Difference]: Finished difference Result 28893 states and 112630 transitions. [2019-12-18 15:20:08,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:20:08,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-18 15:20:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:08,189 INFO L225 Difference]: With dead ends: 28893 [2019-12-18 15:20:08,189 INFO L226 Difference]: Without dead ends: 28888 [2019-12-18 15:20:08,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:20:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28888 states. [2019-12-18 15:20:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28888 to 6960. [2019-12-18 15:20:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6960 states. [2019-12-18 15:20:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6960 states to 6960 states and 32150 transitions. [2019-12-18 15:20:08,476 INFO L78 Accepts]: Start accepts. Automaton has 6960 states and 32150 transitions. Word has length 15 [2019-12-18 15:20:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:08,476 INFO L462 AbstractCegarLoop]: Abstraction has 6960 states and 32150 transitions. [2019-12-18 15:20:08,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:20:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6960 states and 32150 transitions. [2019-12-18 15:20:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:20:08,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:08,477 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:08,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:08,678 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1133625120, now seen corresponding path program 1 times [2019-12-18 15:20:08,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:08,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223758763] [2019-12-18 15:20:08,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:20:08,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223758763] [2019-12-18 15:20:08,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:20:08,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:20:08,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204310124] [2019-12-18 15:20:08,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:20:08,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:08,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:20:08,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:20:08,708 INFO L87 Difference]: Start difference. First operand 6960 states and 32150 transitions. Second operand 5 states. [2019-12-18 15:20:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:08,867 INFO L93 Difference]: Finished difference Result 13762 states and 58788 transitions. [2019-12-18 15:20:08,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:20:08,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:20:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:08,898 INFO L225 Difference]: With dead ends: 13762 [2019-12-18 15:20:08,899 INFO L226 Difference]: Without dead ends: 13754 [2019-12-18 15:20:08,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:20:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13754 states. [2019-12-18 15:20:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13754 to 8211. [2019-12-18 15:20:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8211 states. [2019-12-18 15:20:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 38231 transitions. [2019-12-18 15:20:09,084 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 38231 transitions. Word has length 17 [2019-12-18 15:20:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:09,085 INFO L462 AbstractCegarLoop]: Abstraction has 8211 states and 38231 transitions. [2019-12-18 15:20:09,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:20:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 38231 transitions. [2019-12-18 15:20:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:20:09,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:09,086 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:09,086 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:09,086 INFO L82 PathProgramCache]: Analyzing trace with hash 266693639, now seen corresponding path program 1 times [2019-12-18 15:20:09,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:09,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503805290] [2019-12-18 15:20:09,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:09,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503805290] [2019-12-18 15:20:09,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995972776] [2019-12-18 15:20:09,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:09,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:20:09,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:20:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:09,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:20:09,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:20:09,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875795378] [2019-12-18 15:20:09,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:20:09,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:20:09,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:20:09,353 INFO L87 Difference]: Start difference. First operand 8211 states and 38231 transitions. Second operand 20 states. [2019-12-18 15:20:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:11,059 INFO L93 Difference]: Finished difference Result 22564 states and 89916 transitions. [2019-12-18 15:20:11,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 15:20:11,060 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:20:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:11,108 INFO L225 Difference]: With dead ends: 22564 [2019-12-18 15:20:11,108 INFO L226 Difference]: Without dead ends: 22557 [2019-12-18 15:20:11,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=521, Invalid=2029, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 15:20:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22557 states. [2019-12-18 15:20:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22557 to 8273. [2019-12-18 15:20:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8273 states. [2019-12-18 15:20:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8273 states to 8273 states and 38415 transitions. [2019-12-18 15:20:11,372 INFO L78 Accepts]: Start accepts. Automaton has 8273 states and 38415 transitions. Word has length 19 [2019-12-18 15:20:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:11,372 INFO L462 AbstractCegarLoop]: Abstraction has 8273 states and 38415 transitions. [2019-12-18 15:20:11,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:20:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 8273 states and 38415 transitions. [2019-12-18 15:20:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:20:11,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:11,373 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:11,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:11,575 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1890641739, now seen corresponding path program 1 times [2019-12-18 15:20:11,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:11,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477031232] [2019-12-18 15:20:11,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:11,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477031232] [2019-12-18 15:20:11,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950761823] [2019-12-18 15:20:11,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:11,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:20:11,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:20:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:11,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:20:11,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-18 15:20:11,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109601682] [2019-12-18 15:20:11,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:20:11,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:11,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:20:11,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:20:11,849 INFO L87 Difference]: Start difference. First operand 8273 states and 38415 transitions. Second operand 20 states. [2019-12-18 15:20:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:13,670 INFO L93 Difference]: Finished difference Result 24099 states and 95744 transitions. [2019-12-18 15:20:13,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 15:20:13,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-18 15:20:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:13,722 INFO L225 Difference]: With dead ends: 24099 [2019-12-18 15:20:13,722 INFO L226 Difference]: Without dead ends: 24089 [2019-12-18 15:20:13,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=484, Invalid=1678, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 15:20:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24089 states. [2019-12-18 15:20:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24089 to 8359. [2019-12-18 15:20:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8359 states. [2019-12-18 15:20:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 38734 transitions. [2019-12-18 15:20:13,977 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 38734 transitions. Word has length 19 [2019-12-18 15:20:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:13,978 INFO L462 AbstractCegarLoop]: Abstraction has 8359 states and 38734 transitions. [2019-12-18 15:20:13,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:20:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 38734 transitions. [2019-12-18 15:20:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:20:13,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:13,979 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:14,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:14,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:14,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1507971637, now seen corresponding path program 2 times [2019-12-18 15:20:14,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:14,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523723227] [2019-12-18 15:20:14,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:14,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523723227] [2019-12-18 15:20:14,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343375778] [2019-12-18 15:20:14,252 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:14,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:20:14,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:20:14,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:20:14,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:20:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 15:20:14,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:20:14,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 15:20:14,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365350107] [2019-12-18 15:20:14,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:20:14,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:20:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:20:14,427 INFO L87 Difference]: Start difference. First operand 8359 states and 38734 transitions. Second operand 19 states. [2019-12-18 15:20:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:15,400 INFO L93 Difference]: Finished difference Result 19471 states and 79365 transitions. [2019-12-18 15:20:15,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:20:15,400 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 15:20:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:15,442 INFO L225 Difference]: With dead ends: 19471 [2019-12-18 15:20:15,442 INFO L226 Difference]: Without dead ends: 19464 [2019-12-18 15:20:15,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:20:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19464 states. [2019-12-18 15:20:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19464 to 8266. [2019-12-18 15:20:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8266 states. [2019-12-18 15:20:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 38293 transitions. [2019-12-18 15:20:15,674 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 38293 transitions. Word has length 19 [2019-12-18 15:20:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:15,674 INFO L462 AbstractCegarLoop]: Abstraction has 8266 states and 38293 transitions. [2019-12-18 15:20:15,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:20:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 38293 transitions. [2019-12-18 15:20:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:20:15,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:15,675 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:15,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:15,876 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1507960601, now seen corresponding path program 2 times [2019-12-18 15:20:15,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:15,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508518587] [2019-12-18 15:20:15,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:15,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508518587] [2019-12-18 15:20:15,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975697098] [2019-12-18 15:20:15,944 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:16,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:20:16,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:20:16,021 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:20:16,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:20:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 15:20:16,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:20:16,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-18 15:20:16,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282273410] [2019-12-18 15:20:16,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:20:16,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:20:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:20:16,108 INFO L87 Difference]: Start difference. First operand 8266 states and 38293 transitions. Second operand 19 states. [2019-12-18 15:20:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:17,015 INFO L93 Difference]: Finished difference Result 22340 states and 93099 transitions. [2019-12-18 15:20:17,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:20:17,015 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-18 15:20:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:17,065 INFO L225 Difference]: With dead ends: 22340 [2019-12-18 15:20:17,065 INFO L226 Difference]: Without dead ends: 22331 [2019-12-18 15:20:17,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:20:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22331 states. [2019-12-18 15:20:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22331 to 8151. [2019-12-18 15:20:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8151 states. [2019-12-18 15:20:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8151 states to 8151 states and 37770 transitions. [2019-12-18 15:20:17,324 INFO L78 Accepts]: Start accepts. Automaton has 8151 states and 37770 transitions. Word has length 19 [2019-12-18 15:20:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:17,324 INFO L462 AbstractCegarLoop]: Abstraction has 8151 states and 37770 transitions. [2019-12-18 15:20:17,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:20:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 8151 states and 37770 transitions. [2019-12-18 15:20:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:20:17,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:17,326 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:17,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:17,526 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -509077988, now seen corresponding path program 1 times [2019-12-18 15:20:17,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:17,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30880349] [2019-12-18 15:20:17,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 15:20:17,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30880349] [2019-12-18 15:20:17,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092575050] [2019-12-18 15:20:17,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:17,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:20:17,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:20:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:17,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:20:17,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-18 15:20:17,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112910502] [2019-12-18 15:20:17,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:20:17,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:17,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:20:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:20:17,831 INFO L87 Difference]: Start difference. First operand 8151 states and 37770 transitions. Second operand 23 states. [2019-12-18 15:20:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:23,523 INFO L93 Difference]: Finished difference Result 48884 states and 174143 transitions. [2019-12-18 15:20:23,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-12-18 15:20:23,523 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-18 15:20:23,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:20:23,623 INFO L225 Difference]: With dead ends: 48884 [2019-12-18 15:20:23,624 INFO L226 Difference]: Without dead ends: 48852 [2019-12-18 15:20:23,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8136 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3170, Invalid=17710, Unknown=0, NotChecked=0, Total=20880 [2019-12-18 15:20:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48852 states. [2019-12-18 15:20:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48852 to 8509. [2019-12-18 15:20:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2019-12-18 15:20:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 39545 transitions. [2019-12-18 15:20:24,081 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 39545 transitions. Word has length 21 [2019-12-18 15:20:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:20:24,081 INFO L462 AbstractCegarLoop]: Abstraction has 8509 states and 39545 transitions. [2019-12-18 15:20:24,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:20:24,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 39545 transitions. [2019-12-18 15:20:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:20:24,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:20:24,082 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:20:24,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:24,283 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:20:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:20:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1405431908, now seen corresponding path program 2 times [2019-12-18 15:20:24,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:20:24,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218776274] [2019-12-18 15:20:24,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:20:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:20:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:24,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218776274] [2019-12-18 15:20:24,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138688044] [2019-12-18 15:20:24,367 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:24,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:20:24,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:20:24,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:20:24,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:20:24,641 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 15:20:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:20:24,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:20:24,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-18 15:20:24,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756673986] [2019-12-18 15:20:24,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:20:24,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:20:24,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:20:24,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:20:24,734 INFO L87 Difference]: Start difference. First operand 8509 states and 39545 transitions. Second operand 24 states. [2019-12-18 15:20:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:20:30,144 INFO L93 Difference]: Finished difference Result 55341 states and 202712 transitions. [2019-12-18 15:20:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-18 15:20:30,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-18 15:20:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2019-12-18 15:20:30,274 INFO L225 Difference]: With dead ends: 55341 [2019-12-18 15:20:30,275 INFO L226 Difference]: Without dead ends: 55304 [2019-12-18 15:20:30,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6202 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2803, Invalid=13967, Unknown=0, NotChecked=0, Total=16770 [2019-12-18 15:20:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55304 states. [2019-12-18 15:20:30,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:20:30,563 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 15:20:30,568 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 15:20:30,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:20:30 BasicIcfg [2019-12-18 15:20:30,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:20:30,569 INFO L168 Benchmark]: Toolchain (without parser) took 254874.06 ms. Allocated memory was 138.4 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 101.9 MB in the beginning and 952.4 MB in the end (delta: -850.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 15:20:30,569 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:20:30,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.23 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 159.9 MB in the end (delta: -58.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:20:30,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.83 ms. Allocated memory is still 202.9 MB. Free memory was 159.9 MB in the beginning and 158.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:20:30,570 INFO L168 Benchmark]: Boogie Preprocessor took 24.90 ms. Allocated memory is still 202.9 MB. Free memory was 158.0 MB in the beginning and 157.0 MB in the end (delta: 972.8 kB). Peak memory consumption was 972.8 kB. Max. memory is 7.1 GB. [2019-12-18 15:20:30,571 INFO L168 Benchmark]: RCFGBuilder took 417.63 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 137.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:20:30,571 INFO L168 Benchmark]: TraceAbstraction took 253693.18 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 136.0 MB in the beginning and 952.4 MB in the end (delta: -816.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 15:20:30,572 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 684.23 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 159.9 MB in the end (delta: -58.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.83 ms. Allocated memory is still 202.9 MB. Free memory was 159.9 MB in the beginning and 158.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.90 ms. Allocated memory is still 202.9 MB. Free memory was 158.0 MB in the beginning and 157.0 MB in the end (delta: 972.8 kB). Peak memory consumption was 972.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 417.63 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 137.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253693.18 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 136.0 MB in the beginning and 952.4 MB in the end (delta: -816.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 60 ProgramPointsBefore, 15 ProgramPointsAfterwards, 56 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 7 FixpointIterations, 18 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 351 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 4 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 47 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 81 ProgramPointsBefore, 26 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 555 VarBasedMoverChecksPositive, 10 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 14 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1223 CheckedPairsTotal, 61 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 102 ProgramPointsBefore, 34 ProgramPointsAfterwards, 92 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 801 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 1840 CheckedPairsTotal, 80 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 123 ProgramPointsBefore, 42 ProgramPointsAfterwards, 110 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1106 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2220 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 144 ProgramPointsBefore, 50 ProgramPointsAfterwards, 128 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 58 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 1461 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3419 CheckedPairsTotal, 108 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. Result: TIMEOUT, OverallTime: 29.5s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 547 SDtfs, 4520 SDslu, 3867 SDs, 0 SdLazy, 10311 SolverSat, 592 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 529 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16821 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8509occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 148793 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 31968 SizeOfPredicates, 44 NumberOfNonLiveVariables, 866 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 26/114 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown