/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:12:27,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:12:27,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:12:27,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:12:27,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:12:27,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:12:27,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:12:27,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:12:27,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:12:27,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:12:27,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:12:27,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:12:27,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:12:27,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:12:27,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:12:27,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:12:27,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:12:27,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:12:27,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:12:27,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:12:27,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:12:27,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:12:27,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:12:27,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:12:27,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:12:27,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:12:27,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:12:27,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:12:27,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:12:27,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:12:27,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:12:27,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:12:27,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:12:27,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:12:27,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:12:27,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:12:27,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:12:27,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:12:27,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:12:27,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:12:27,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:12:27,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:12:27,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:12:27,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:12:27,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:12:27,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:12:27,363 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:12:27,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:12:27,364 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:12:27,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:12:27,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:12:27,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:12:27,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:12:27,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:12:27,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:12:27,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:12:27,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:12:27,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:12:27,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:12:27,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:12:27,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:12:27,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:12:27,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:12:27,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:12:27,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:12:27,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:12:27,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:12:27,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:12:27,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:12:27,368 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:12:27,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:12:27,369 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:12:27,369 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:12:27,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:12:27,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:12:27,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:12:27,690 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:12:27,690 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:12:27,691 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2019-12-27 15:12:27,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1b344ba/a2846bb6480542eb9b79189a53564a0a/FLAG2d9d27ca8 [2019-12-27 15:12:28,309 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:12:28,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2019-12-27 15:12:28,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1b344ba/a2846bb6480542eb9b79189a53564a0a/FLAG2d9d27ca8 [2019-12-27 15:12:28,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1b344ba/a2846bb6480542eb9b79189a53564a0a [2019-12-27 15:12:28,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:12:28,607 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:12:28,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:12:28,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:12:28,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:12:28,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:12:28" (1/1) ... [2019-12-27 15:12:28,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa65437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:28, skipping insertion in model container [2019-12-27 15:12:28,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:12:28" (1/1) ... [2019-12-27 15:12:28,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:12:28,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:12:29,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:12:29,178 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:12:29,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:12:29,328 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:12:29,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29 WrapperNode [2019-12-27 15:12:29,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:12:29,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:12:29,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:12:29,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:12:29,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:12:29,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:12:29,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:12:29,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:12:29,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... [2019-12-27 15:12:29,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:12:29,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:12:29,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:12:29,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:12:29,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:12:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 15:12:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 15:12:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 15:12:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 15:12:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:12:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:12:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:12:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:12:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:12:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:12:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:12:29,526 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:12:29,952 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:12:29,953 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 15:12:29,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:12:29 BoogieIcfgContainer [2019-12-27 15:12:29,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:12:29,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:12:29,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:12:29,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:12:29,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:12:28" (1/3) ... [2019-12-27 15:12:29,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d6fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:12:29, skipping insertion in model container [2019-12-27 15:12:29,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:29" (2/3) ... [2019-12-27 15:12:29,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d6fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:12:29, skipping insertion in model container [2019-12-27 15:12:29,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:12:29" (3/3) ... [2019-12-27 15:12:29,965 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2019-12-27 15:12:29,976 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:12:29,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:12:29,981 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 15:12:29,982 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:12:30,015 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,015 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,015 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,016 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,016 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,016 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,017 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,017 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,017 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,017 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,018 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,018 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,018 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,019 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,019 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,019 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,020 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,020 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,020 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,020 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,021 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,021 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,021 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,023 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,023 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,024 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,024 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,024 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,029 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,030 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,030 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,031 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,031 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,031 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,039 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,039 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,040 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,041 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,041 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,041 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:30,062 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 15:12:30,084 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:30,084 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:30,084 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:30,084 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:30,084 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:30,085 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:30,085 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:30,085 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:30,097 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-27 15:12:30,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 15:12:30,148 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 15:12:30,148 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:12:30,154 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 15:12:30,157 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 15:12:30,175 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 15:12:30,178 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:12:30,179 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 15:12:30,184 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-27 15:12:30,185 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:31,329 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 15:12:31,467 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-27 15:12:31,467 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-27 15:12:31,471 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-27 15:12:31,484 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-27 15:12:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-27 15:12:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:12:31,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:31,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:12:31,494 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-27 15:12:31,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:31,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588218668] [2019-12-27 15:12:31,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:31,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588218668] [2019-12-27 15:12:31,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:31,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:12:31,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417565683] [2019-12-27 15:12:31,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:31,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:31,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:12:31,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:31,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:31,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:12:31,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:31,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:12:31,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:31,783 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-27 15:12:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:31,824 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-27 15:12:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:12:31,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:12:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:31,851 INFO L225 Difference]: With dead ends: 48 [2019-12-27 15:12:31,851 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 15:12:31,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 15:12:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 15:12:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 15:12:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-27 15:12:31,885 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-27 15:12:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:31,885 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-27 15:12:31,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:12:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-27 15:12:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 15:12:31,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:31,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:31,902 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-27 15:12:31,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:31,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115858760] [2019-12-27 15:12:31,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:31,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115858760] [2019-12-27 15:12:31,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:31,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:31,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2053365119] [2019-12-27 15:12:31,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 15 transitions. [2019-12-27 15:12:32,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:32,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:32,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:32,015 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-27 15:12:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:32,037 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 15:12:32,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:12:32,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 15:12:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:32,040 INFO L225 Difference]: With dead ends: 34 [2019-12-27 15:12:32,040 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 15:12:32,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 15:12:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 15:12:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 15:12:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 15:12:32,051 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-27 15:12:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:32,051 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 15:12:32,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 15:12:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:12:32,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:32,053 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-27 15:12:32,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:32,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884703750] [2019-12-27 15:12:32,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:32,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884703750] [2019-12-27 15:12:32,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:32,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:12:32,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1026451178] [2019-12-27 15:12:32,171 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,172 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,175 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 21 transitions. [2019-12-27 15:12:32,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:32,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:12:32,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:12:32,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:12:32,179 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-27 15:12:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:32,224 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 15:12:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:32,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 15:12:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:32,225 INFO L225 Difference]: With dead ends: 34 [2019-12-27 15:12:32,225 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 15:12:32,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 15:12:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-27 15:12:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 15:12:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 15:12:32,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-27 15:12:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:32,231 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 15:12:32,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:12:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 15:12:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:12:32,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:32,232 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-27 15:12:32,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:32,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911470010] [2019-12-27 15:12:32,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:32,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911470010] [2019-12-27 15:12:32,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:32,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:12:32,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891324507] [2019-12-27 15:12:32,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 17 transitions. [2019-12-27 15:12:32,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:32,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:12:32,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:12:32,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:12:32,297 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-27 15:12:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:32,352 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 15:12:32,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:32,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 15:12:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:32,354 INFO L225 Difference]: With dead ends: 32 [2019-12-27 15:12:32,354 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 15:12:32,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 15:12:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 15:12:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 15:12:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 15:12:32,362 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-27 15:12:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:32,362 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 15:12:32,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:12:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 15:12:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 15:12:32,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,369 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:32,369 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-27 15:12:32,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:32,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802351808] [2019-12-27 15:12:32,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:32,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802351808] [2019-12-27 15:12:32,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134435951] [2019-12-27 15:12:32,447 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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:32,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 15:12:32,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:32,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 15:12:32,525 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:32,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:32,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 15:12:32,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307557571] [2019-12-27 15:12:32,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,553 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 22 transitions. [2019-12-27 15:12:32,555 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,556 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:32,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:12:32,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:12:32,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:32,557 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 6 states. [2019-12-27 15:12:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:32,621 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 15:12:32,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:32,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-27 15:12:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:32,623 INFO L225 Difference]: With dead ends: 32 [2019-12-27 15:12:32,623 INFO L226 Difference]: Without dead ends: 29 [2019-12-27 15:12:32,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-27 15:12:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-27 15:12:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 15:12:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 15:12:32,628 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-27 15:12:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:32,628 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 15:12:32,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:12:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 15:12:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 15:12:32,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,629 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:32,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:32,830 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:32,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-27 15:12:32,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:32,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758114402] [2019-12-27 15:12:32,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:32,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758114402] [2019-12-27 15:12:32,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173451705] [2019-12-27 15:12:32,895 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:32,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:12:32,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:32,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 15:12:32,960 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:32,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:32,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 15:12:32,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819862690] [2019-12-27 15:12:32,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 18 transitions. [2019-12-27 15:12:32,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,993 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:32,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:12:32,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:12:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:32,994 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 6 states. [2019-12-27 15:12:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:33,070 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-27 15:12:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:12:33,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-27 15:12:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:33,071 INFO L225 Difference]: With dead ends: 33 [2019-12-27 15:12:33,071 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 15:12:33,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 15:12:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 15:12:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 15:12:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 15:12:33,079 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-27 15:12:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:33,079 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 15:12:33,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:12:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 15:12:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:12:33,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:33,081 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:33,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:33,285 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-27 15:12:33,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:33,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334593726] [2019-12-27 15:12:33,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:33,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334593726] [2019-12-27 15:12:33,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874068101] [2019-12-27 15:12:33,349 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:33,392 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:12:33,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:33,394 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 15:12:33,395 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:33,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:33,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 15:12:33,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [853788201] [2019-12-27 15:12:33,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:33,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:33,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 23 transitions. [2019-12-27 15:12:33,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:33,420 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:33,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:33,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:33,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:33,421 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 7 states. [2019-12-27 15:12:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:33,497 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 15:12:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:12:33,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-27 15:12:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:33,498 INFO L225 Difference]: With dead ends: 34 [2019-12-27 15:12:33,498 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 15:12:33,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 15:12:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-27 15:12:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-27 15:12:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-27 15:12:33,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-27 15:12:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:33,503 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-27 15:12:33,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-27 15:12:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:12:33,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:33,503 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:33,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:33,707 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-27 15:12:33,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:33,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192702264] [2019-12-27 15:12:33,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:33,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-27 15:12:33,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192702264] [2019-12-27 15:12:33,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117966977] [2019-12-27 15:12:33,779 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:33,831 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 15:12:33,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:33,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 15:12:33,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:33,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:33,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 15:12:33,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850062937] [2019-12-27 15:12:33,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:33,856 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:33,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 19 transitions. [2019-12-27 15:12:33,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:33,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:33,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:33,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:33,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:33,861 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 7 states. [2019-12-27 15:12:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:33,957 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-27 15:12:33,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:33,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-27 15:12:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:33,959 INFO L225 Difference]: With dead ends: 35 [2019-12-27 15:12:33,959 INFO L226 Difference]: Without dead ends: 32 [2019-12-27 15:12:33,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-27 15:12:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-27 15:12:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 15:12:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 15:12:33,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-27 15:12:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:33,967 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 15:12:33,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 15:12:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:12:33,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:33,968 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:34,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:34,175 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-27 15:12:34,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:34,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639220357] [2019-12-27 15:12:34,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:34,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639220357] [2019-12-27 15:12:34,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858029825] [2019-12-27 15:12:34,251 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:34,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 15:12:34,305 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:34,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:34,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 15:12:34,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974511901] [2019-12-27 15:12:34,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:34,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:34,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 24 transitions. [2019-12-27 15:12:34,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:34,326 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:34,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:34,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:34,328 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 8 states. [2019-12-27 15:12:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:34,445 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-27 15:12:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:34,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-27 15:12:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:34,446 INFO L225 Difference]: With dead ends: 36 [2019-12-27 15:12:34,446 INFO L226 Difference]: Without dead ends: 33 [2019-12-27 15:12:34,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-27 15:12:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-27 15:12:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 15:12:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-27 15:12:34,450 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-27 15:12:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:34,450 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-27 15:12:34,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-27 15:12:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:12:34,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:34,451 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:34,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:34,652 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-27 15:12:34,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:34,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374544322] [2019-12-27 15:12:34,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:34,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374544322] [2019-12-27 15:12:34,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579791842] [2019-12-27 15:12:34,726 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:34,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:12:34,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:34,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 15:12:34,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:34,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:34,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 15:12:34,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2093863435] [2019-12-27 15:12:34,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:34,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:34,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 20 transitions. [2019-12-27 15:12:34,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:34,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:34,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:34,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:34,807 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 8 states. [2019-12-27 15:12:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:34,918 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-27 15:12:34,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:34,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-27 15:12:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:34,919 INFO L225 Difference]: With dead ends: 37 [2019-12-27 15:12:34,919 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 15:12:34,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 15:12:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 15:12:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 15:12:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 15:12:34,935 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-27 15:12:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:34,936 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 15:12:34,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 15:12:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:12:34,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:34,937 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:35,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:35,142 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-27 15:12:35,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:35,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546677927] [2019-12-27 15:12:35,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:35,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546677927] [2019-12-27 15:12:35,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750374431] [2019-12-27 15:12:35,217 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:35,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 15:12:35,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:35,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 15:12:35,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:35,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:35,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 15:12:35,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308291262] [2019-12-27 15:12:35,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:35,309 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:35,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 25 transitions. [2019-12-27 15:12:35,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:35,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:35,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:35,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:35,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:35,318 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 9 states. [2019-12-27 15:12:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:35,427 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-27 15:12:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:35,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-27 15:12:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:35,428 INFO L225 Difference]: With dead ends: 38 [2019-12-27 15:12:35,429 INFO L226 Difference]: Without dead ends: 35 [2019-12-27 15:12:35,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-27 15:12:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-27 15:12:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-27 15:12:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-27 15:12:35,434 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-27 15:12:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:35,434 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-27 15:12:35,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-27 15:12:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:12:35,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:35,435 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:35,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:35,638 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:35,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:35,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-27 15:12:35,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:35,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572413676] [2019-12-27 15:12:35,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:35,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572413676] [2019-12-27 15:12:35,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852523367] [2019-12-27 15:12:35,701 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:35,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:12:35,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:35,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 15:12:35,758 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:35,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:35,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 15:12:35,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [753089208] [2019-12-27 15:12:35,778 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:35,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:35,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 21 transitions. [2019-12-27 15:12:35,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:35,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:35,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:35,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:35,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:35,784 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 9 states. [2019-12-27 15:12:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:35,904 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-27 15:12:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:12:35,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-27 15:12:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:35,906 INFO L225 Difference]: With dead ends: 39 [2019-12-27 15:12:35,906 INFO L226 Difference]: Without dead ends: 36 [2019-12-27 15:12:35,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:12:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-27 15:12:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-27 15:12:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 15:12:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 15:12:35,910 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-27 15:12:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:35,910 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 15:12:35,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 15:12:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:12:35,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:35,911 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:36,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:36,118 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-27 15:12:36,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:36,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947766005] [2019-12-27 15:12:36,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:36,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947766005] [2019-12-27 15:12:36,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514887979] [2019-12-27 15:12:36,196 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:36,267 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 15:12:36,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:36,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 15:12:36,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:36,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:36,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 15:12:36,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967080385] [2019-12-27 15:12:36,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:36,292 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:36,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 26 transitions. [2019-12-27 15:12:36,296 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:36,300 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:36,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:36,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:36,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:36,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:36,302 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 10 states. [2019-12-27 15:12:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:36,469 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-27 15:12:36,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:12:36,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-27 15:12:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:36,472 INFO L225 Difference]: With dead ends: 40 [2019-12-27 15:12:36,472 INFO L226 Difference]: Without dead ends: 37 [2019-12-27 15:12:36,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:12:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-27 15:12:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-27 15:12:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-27 15:12:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-27 15:12:36,482 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-27 15:12:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:36,483 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-27 15:12:36,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-27 15:12:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:12:36,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:36,484 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:36,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:36,684 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:36,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-27 15:12:36,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:36,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582073957] [2019-12-27 15:12:36,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:36,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582073957] [2019-12-27 15:12:36,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087303015] [2019-12-27 15:12:36,767 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:36,841 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 15:12:36,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:36,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 15:12:36,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:36,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:36,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 15:12:36,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1609294351] [2019-12-27 15:12:36,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:36,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:36,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 15:12:36,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:36,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:36,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:36,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:36,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:36,870 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 10 states. [2019-12-27 15:12:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:36,997 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-27 15:12:36,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:36,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-27 15:12:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:36,998 INFO L225 Difference]: With dead ends: 41 [2019-12-27 15:12:36,998 INFO L226 Difference]: Without dead ends: 38 [2019-12-27 15:12:36,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:12:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-27 15:12:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-27 15:12:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 15:12:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 15:12:37,002 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-27 15:12:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:37,002 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 15:12:37,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 15:12:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:12:37,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:37,003 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:37,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:37,206 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-27 15:12:37,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:37,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589386814] [2019-12-27 15:12:37,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:37,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589386814] [2019-12-27 15:12:37,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70371448] [2019-12-27 15:12:37,285 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:37,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 15:12:37,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:37,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:37,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 15:12:37,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1673331353] [2019-12-27 15:12:37,388 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:37,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:37,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 27 transitions. [2019-12-27 15:12:37,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:37,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:37,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:37,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:37,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:37,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:37,395 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 11 states. [2019-12-27 15:12:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:37,562 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-27 15:12:37,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:37,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-12-27 15:12:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:37,563 INFO L225 Difference]: With dead ends: 42 [2019-12-27 15:12:37,563 INFO L226 Difference]: Without dead ends: 39 [2019-12-27 15:12:37,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:12:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-27 15:12:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-27 15:12:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-27 15:12:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-27 15:12:37,567 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-27 15:12:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:37,567 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-27 15:12:37,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-27 15:12:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:12:37,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:37,568 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:37,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:37,772 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:37,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-27 15:12:37,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:37,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145232150] [2019-12-27 15:12:37,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:37,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145232150] [2019-12-27 15:12:37,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012564878] [2019-12-27 15:12:37,857 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:37,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:12:37,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:37,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 15:12:37,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:37,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:37,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 15:12:37,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1895143226] [2019-12-27 15:12:37,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:37,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:37,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 23 transitions. [2019-12-27 15:12:37,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:37,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:37,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:37,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:37,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:37,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:37,938 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 11 states. [2019-12-27 15:12:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:38,091 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-27 15:12:38,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:38,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-12-27 15:12:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:38,092 INFO L225 Difference]: With dead ends: 43 [2019-12-27 15:12:38,092 INFO L226 Difference]: Without dead ends: 40 [2019-12-27 15:12:38,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:12:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-27 15:12:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-27 15:12:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-27 15:12:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-27 15:12:38,096 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-27 15:12:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:38,096 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-27 15:12:38,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-27 15:12:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:12:38,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:38,097 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:38,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:38,301 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-27 15:12:38,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:38,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62608150] [2019-12-27 15:12:38,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:38,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62608150] [2019-12-27 15:12:38,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434661185] [2019-12-27 15:12:38,454 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:38,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 15:12:38,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:38,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 15:12:38,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:38,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:38,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 15:12:38,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745850715] [2019-12-27 15:12:38,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:38,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:38,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 15:12:38,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:38,531 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:38,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:38,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:38,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:38,532 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 12 states. [2019-12-27 15:12:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:38,703 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-27 15:12:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:38,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 15:12:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:38,704 INFO L225 Difference]: With dead ends: 44 [2019-12-27 15:12:38,704 INFO L226 Difference]: Without dead ends: 41 [2019-12-27 15:12:38,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:12:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-27 15:12:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-27 15:12:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 15:12:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 15:12:38,709 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-27 15:12:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:38,709 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 15:12:38,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 15:12:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:12:38,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:38,710 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:38,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:38,918 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-27 15:12:38,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:38,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048126509] [2019-12-27 15:12:38,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:39,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048126509] [2019-12-27 15:12:39,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921112482] [2019-12-27 15:12:39,015 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:39,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:12:39,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:39,090 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 15:12:39,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:39,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:39,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 15:12:39,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612393812] [2019-12-27 15:12:39,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:39,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:39,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 24 transitions. [2019-12-27 15:12:39,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:39,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:39,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:39,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:39,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:39,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:39,127 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 12 states. [2019-12-27 15:12:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:39,310 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-27 15:12:39,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:12:39,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 15:12:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:39,311 INFO L225 Difference]: With dead ends: 45 [2019-12-27 15:12:39,311 INFO L226 Difference]: Without dead ends: 42 [2019-12-27 15:12:39,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:12:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-27 15:12:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-27 15:12:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-27 15:12:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-27 15:12:39,315 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-27 15:12:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:39,315 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-27 15:12:39,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-27 15:12:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:39,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:39,316 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:39,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:39,524 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-27 15:12:39,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:39,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196703785] [2019-12-27 15:12:39,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:39,572 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:12:39,573 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:12:39,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~i~0_33 3) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (= v_~j~0_37 6) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_37, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_18|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_22, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_22, ~i~0=v_~i~0_33, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-27 15:12:39,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-27 15:12:39,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_4 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_12 0) (= v_t1Thread1of1ForFork1_~arg.base_4 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_4, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_4, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_12, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:12:39,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:12:39,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= v_t2Thread1of1ForFork0_~arg.offset_4 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_12) (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_4)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_4, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_4, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_12, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:12:39,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:12:39,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:12:39,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:12:39,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:12:39,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:12:39,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:12:39,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:12:39,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (= (+ v_~j~0_25 1) v_~i~0_23) (< v_t1Thread1of1ForFork1_~k~0_20 5)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:12:39,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 5)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:12:39,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~condJ~0_15 0)) (.cse2 (= v_ULTIMATE.start_main_~condI~0_15 0))) (and (let ((.cse0 (<= 16 v_~j~0_27))) (or (and (not .cse0) .cse1) (and .cse0 (= v_ULTIMATE.start_main_~condJ~0_15 1)))) (or (not .cse2) (not .cse1)) (let ((.cse3 (<= 16 v_~i~0_25))) (or (and (= v_ULTIMATE.start_main_~condI~0_15 1) .cse3) (and .cse2 (not .cse3)))))) InVars {~j~0=v_~j~0_27, ~i~0=v_~i~0_25} OutVars{~j~0=v_~j~0_27, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_15, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_15, ~i~0=v_~i~0_25, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-12-27 15:12:39,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:12:39 BasicIcfg [2019-12-27 15:12:39,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:12:39,600 INFO L168 Benchmark]: Toolchain (without parser) took 10993.45 ms. Allocated memory was 138.4 MB in the beginning and 304.1 MB in the end (delta: 165.7 MB). Free memory was 101.9 MB in the beginning and 146.1 MB in the end (delta: -44.2 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:39,600 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:12:39,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.58 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.5 MB in the beginning and 162.0 MB in the end (delta: -60.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:39,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.36 ms. Allocated memory is still 202.9 MB. Free memory was 162.0 MB in the beginning and 160.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:39,602 INFO L168 Benchmark]: Boogie Preprocessor took 44.22 ms. Allocated memory is still 202.9 MB. Free memory was 160.0 MB in the beginning and 158.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:39,602 INFO L168 Benchmark]: RCFGBuilder took 498.98 ms. Allocated memory is still 202.9 MB. Free memory was 158.7 MB in the beginning and 139.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:39,603 INFO L168 Benchmark]: TraceAbstraction took 9641.27 ms. Allocated memory was 202.9 MB in the beginning and 304.1 MB in the end (delta: 101.2 MB). Free memory was 138.6 MB in the beginning and 146.1 MB in the end (delta: -7.5 MB). Peak memory consumption was 93.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:12:39,605 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.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 721.58 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.5 MB in the beginning and 162.0 MB in the end (delta: -60.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.36 ms. Allocated memory is still 202.9 MB. Free memory was 162.0 MB in the beginning and 160.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.22 ms. Allocated memory is still 202.9 MB. Free memory was 160.0 MB in the beginning and 158.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 498.98 ms. Allocated memory is still 202.9 MB. Free memory was 158.7 MB in the beginning and 139.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9641.27 ms. Allocated memory was 202.9 MB in the beginning and 304.1 MB in the end (delta: 101.2 MB). Free memory was 138.6 MB in the beginning and 146.1 MB in the end (delta: -7.5 MB). Peak memory consumption was 93.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.4s, OverallIterations: 19, TraceHistogramMax: 5, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 171 SDtfs, 420 SDslu, 285 SDs, 0 SdLazy, 353 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 76 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 14804 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1316 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 0/200 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 proved your program to be incorrect! Received shutdown request...