/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:38:32,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:38:32,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:38:32,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:38:32,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:38:32,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:38:32,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:38:32,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:38:32,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:38:32,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:38:32,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:38:32,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:38:32,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:38:32,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:38:32,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:38:32,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:38:32,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:38:32,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:38:32,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:38:32,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:38:32,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:38:32,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:38:32,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:38:32,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:38:32,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:38:32,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:38:32,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:38:32,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:38:32,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:38:32,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:38:32,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:38:32,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:38:32,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:38:32,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:38:32,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:38:32,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:38:32,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:38:32,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:38:32,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:38:32,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:38:32,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:38:32,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:38:32,399 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:38:32,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:38:32,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:38:32,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:38:32,401 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:38:32,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:38:32,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:38:32,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:38:32,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:38:32,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:38:32,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:38:32,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:38:32,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:38:32,404 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:38:32,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:38:32,405 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:38:32,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:38:32,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:38:32,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:38:32,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:38:32,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:38:32,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:38:32,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:38:32,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:38:32,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:38:32,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:38:32,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:38:32,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:38:32,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:38:32,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:38:32,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:38:32,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:38:32,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:38:32,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:38:32,709 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:38:32,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-26 23:38:32,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743293049/ebc07753f01040ed906dbc53223617f6/FLAG89c186ffc [2019-12-26 23:38:33,362 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:38:33,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-26 23:38:33,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743293049/ebc07753f01040ed906dbc53223617f6/FLAG89c186ffc [2019-12-26 23:38:33,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743293049/ebc07753f01040ed906dbc53223617f6 [2019-12-26 23:38:33,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:38:33,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:38:33,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:38:33,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:38:33,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:38:33,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:38:33" (1/1) ... [2019-12-26 23:38:33,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef745f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:33, skipping insertion in model container [2019-12-26 23:38:33,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:38:33" (1/1) ... [2019-12-26 23:38:33,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:38:33,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:38:34,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:38:34,306 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:38:34,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:38:34,464 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:38:34,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34 WrapperNode [2019-12-26 23:38:34,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:38:34,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:38:34,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:38:34,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:38:34,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:38:34,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:38:34,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:38:34,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:38:34,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (1/1) ... [2019-12-26 23:38:34,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:38:34,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:38:34,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:38:34,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:38:34,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (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-26 23:38:34,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:38:34,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:38:34,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:38:34,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:38:34,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:38:34,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:38:34,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:38:34,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:38:34,654 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:38:34,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:38:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:38:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:38:34,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:38:34,657 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:38:35,405 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:38:35,406 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:38:35,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:38:35 BoogieIcfgContainer [2019-12-26 23:38:35,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:38:35,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:38:35,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:38:35,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:38:35,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:38:33" (1/3) ... [2019-12-26 23:38:35,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690a07c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:38:35, skipping insertion in model container [2019-12-26 23:38:35,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:38:34" (2/3) ... [2019-12-26 23:38:35,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690a07c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:38:35, skipping insertion in model container [2019-12-26 23:38:35,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:38:35" (3/3) ... [2019-12-26 23:38:35,416 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.oepc.i [2019-12-26 23:38:35,427 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:38:35,427 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:38:35,435 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:38:35,436 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:38:35,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,480 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,480 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,480 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,481 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,481 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,514 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,514 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,525 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,533 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,534 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:38:35,550 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:38:35,572 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:38:35,572 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:38:35,572 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:38:35,572 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:38:35,572 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:38:35,572 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:38:35,573 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:38:35,573 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:38:35,589 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 23:38:35,591 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 23:38:35,693 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 23:38:35,693 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:38:35,710 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:38:35,731 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 23:38:35,783 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 23:38:35,783 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:38:35,791 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:38:35,811 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-26 23:38:35,813 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:38:40,778 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:38:40,900 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:38:40,929 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-26 23:38:40,930 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:38:40,933 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-26 23:38:59,718 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-26 23:38:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-26 23:38:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:38:59,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:38:59,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:38:59,726 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:38:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:38:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-26 23:38:59,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:38:59,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719493613] [2019-12-26 23:38:59,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:38:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:39:00,019 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-26 23:39:00,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719493613] [2019-12-26 23:39:00,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:39:00,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:39:00,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967584526] [2019-12-26 23:39:00,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:39:00,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:39:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:39:00,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:39:00,047 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-26 23:39:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:39:01,692 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-26 23:39:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:39:01,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:39:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:39:05,433 INFO L225 Difference]: With dead ends: 115182 [2019-12-26 23:39:05,433 INFO L226 Difference]: Without dead ends: 112830 [2019-12-26 23:39:05,435 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-26 23:39:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-26 23:39:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-26 23:39:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-26 23:39:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-26 23:39:16,416 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-26 23:39:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:39:16,418 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-26 23:39:16,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:39:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-26 23:39:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:39:16,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:39:16,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:39:16,426 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:39:16,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:39:16,426 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-26 23:39:16,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:39:16,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581716743] [2019-12-26 23:39:16,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:39:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:39:16,544 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-26 23:39:16,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581716743] [2019-12-26 23:39:16,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:39:16,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:39:16,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473028404] [2019-12-26 23:39:16,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:39:16,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:39:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:39:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:39:16,548 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-26 23:39:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:39:22,173 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-26 23:39:22,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:39:22,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:39:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:39:22,738 INFO L225 Difference]: With dead ends: 176302 [2019-12-26 23:39:22,738 INFO L226 Difference]: Without dead ends: 176253 [2019-12-26 23:39:22,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:39:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-26 23:39:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-26 23:39:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-26 23:39:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-26 23:39:31,516 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-26 23:39:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:39:31,517 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-26 23:39:31,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:39:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-26 23:39:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:39:31,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:39:31,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:39:31,523 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:39:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:39:31,523 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-26 23:39:31,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:39:31,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303153176] [2019-12-26 23:39:31,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:39:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:39:31,591 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-26 23:39:31,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303153176] [2019-12-26 23:39:31,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:39:31,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:39:31,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015896484] [2019-12-26 23:39:31,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:39:31,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:39:31,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:39:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:39:31,593 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-26 23:39:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:39:38,150 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-26 23:39:38,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:39:38,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:39:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:39:38,864 INFO L225 Difference]: With dead ends: 228428 [2019-12-26 23:39:38,865 INFO L226 Difference]: Without dead ends: 228365 [2019-12-26 23:39:38,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:39:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-26 23:39:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-26 23:39:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-26 23:39:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-26 23:39:57,077 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-26 23:39:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:39:57,078 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-26 23:39:57,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:39:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-26 23:39:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:39:57,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:39:57,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:39:57,083 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:39:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:39:57,083 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-26 23:39:57,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:39:57,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649033808] [2019-12-26 23:39:57,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:39:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:39:57,159 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-26 23:39:57,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649033808] [2019-12-26 23:39:57,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:39:57,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:39:57,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453041280] [2019-12-26 23:39:57,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:39:57,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:39:57,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:39:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:39:57,161 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-26 23:39:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:39:57,301 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-26 23:39:57,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:39:57,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:39:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:39:57,390 INFO L225 Difference]: With dead ends: 38255 [2019-12-26 23:39:57,390 INFO L226 Difference]: Without dead ends: 38255 [2019-12-26 23:39:57,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:39:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-26 23:39:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-26 23:39:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-26 23:39:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-26 23:39:59,678 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-26 23:39:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:39:59,678 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-26 23:39:59,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:39:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-26 23:39:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:39:59,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:39:59,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:39:59,683 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:39:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:39:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-26 23:39:59,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:39:59,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996578092] [2019-12-26 23:39:59,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:39:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:39:59,763 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-26 23:39:59,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996578092] [2019-12-26 23:39:59,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:39:59,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:39:59,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487679639] [2019-12-26 23:39:59,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:39:59,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:39:59,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:39:59,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:39:59,765 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-26 23:40:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:00,526 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-26 23:40:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:40:00,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:40:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:00,611 INFO L225 Difference]: With dead ends: 51712 [2019-12-26 23:40:00,611 INFO L226 Difference]: Without dead ends: 51699 [2019-12-26 23:40:00,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:40:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-26 23:40:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-26 23:40:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-26 23:40:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-26 23:40:04,407 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-26 23:40:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:04,407 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-26 23:40:04,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-26 23:40:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:40:04,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:04,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:04,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:04,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:04,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-26 23:40:04,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:04,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973771706] [2019-12-26 23:40:04,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:04,487 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-26 23:40:04,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973771706] [2019-12-26 23:40:04,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:04,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:40:04,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442730784] [2019-12-26 23:40:04,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:40:04,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:04,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:40:04,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:40:04,489 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-26 23:40:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:04,530 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-26 23:40:04,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:40:04,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:40:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:04,542 INFO L225 Difference]: With dead ends: 7422 [2019-12-26 23:40:04,543 INFO L226 Difference]: Without dead ends: 7422 [2019-12-26 23:40:04,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-26 23:40:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-26 23:40:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-26 23:40:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-26 23:40:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-26 23:40:04,652 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-26 23:40:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:04,652 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-26 23:40:04,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:40:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-26 23:40:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:40:04,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:04,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:04,664 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:04,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-26 23:40:04,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:04,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998756905] [2019-12-26 23:40:04,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:04,735 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-26 23:40:04,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998756905] [2019-12-26 23:40:04,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:04,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:40:04,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428189528] [2019-12-26 23:40:04,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:04,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:04,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:04,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:04,737 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-26 23:40:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:04,782 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-26 23:40:04,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:40:04,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:40:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:04,791 INFO L225 Difference]: With dead ends: 5312 [2019-12-26 23:40:04,791 INFO L226 Difference]: Without dead ends: 5312 [2019-12-26 23:40:04,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-26 23:40:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-26 23:40:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-26 23:40:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-26 23:40:04,866 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-26 23:40:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:04,867 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-26 23:40:04,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-26 23:40:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:40:04,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:04,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:04,875 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-26 23:40:04,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:04,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667511139] [2019-12-26 23:40:04,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:05,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667511139] [2019-12-26 23:40:05,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:05,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:40:05,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933299087] [2019-12-26 23:40:05,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:05,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:05,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:05,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:05,015 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 5 states. [2019-12-26 23:40:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:05,317 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-26 23:40:05,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:40:05,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:40:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:05,328 INFO L225 Difference]: With dead ends: 7539 [2019-12-26 23:40:05,328 INFO L226 Difference]: Without dead ends: 7539 [2019-12-26 23:40:05,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:40:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-26 23:40:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-26 23:40:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-26 23:40:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-26 23:40:05,416 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-26 23:40:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:05,416 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-26 23:40:05,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-26 23:40:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:40:05,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:05,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:05,426 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-26 23:40:05,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:05,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038600154] [2019-12-26 23:40:05,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:05,536 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-26 23:40:05,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038600154] [2019-12-26 23:40:05,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:05,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:40:05,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494907791] [2019-12-26 23:40:05,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:40:05,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:40:05,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:05,543 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-26 23:40:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:05,576 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-26 23:40:05,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:40:05,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:40:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:05,584 INFO L225 Difference]: With dead ends: 5975 [2019-12-26 23:40:05,584 INFO L226 Difference]: Without dead ends: 5975 [2019-12-26 23:40:05,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-26 23:40:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-26 23:40:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-26 23:40:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-26 23:40:05,659 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-26 23:40:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:05,659 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-26 23:40:05,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:40:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-26 23:40:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:40:05,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:05,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:05,667 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-26 23:40:05,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:05,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746091895] [2019-12-26 23:40:05,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:05,790 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-26 23:40:05,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746091895] [2019-12-26 23:40:05,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:05,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:40:05,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352615596] [2019-12-26 23:40:05,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:05,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:05,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:05,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:05,793 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-26 23:40:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:06,138 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-26 23:40:06,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:40:06,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:40:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:06,151 INFO L225 Difference]: With dead ends: 8394 [2019-12-26 23:40:06,152 INFO L226 Difference]: Without dead ends: 8394 [2019-12-26 23:40:06,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:40:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-26 23:40:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-26 23:40:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-26 23:40:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-26 23:40:06,281 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-26 23:40:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:06,281 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-26 23:40:06,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-26 23:40:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:40:06,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:06,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:06,295 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:06,296 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-26 23:40:06,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:06,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873593889] [2019-12-26 23:40:06,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:06,379 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-26 23:40:06,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873593889] [2019-12-26 23:40:06,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:06,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:40:06,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357510592] [2019-12-26 23:40:06,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:40:06,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:40:06,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:06,382 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 3 states. [2019-12-26 23:40:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:06,439 INFO L93 Difference]: Finished difference Result 6166 states and 17578 transitions. [2019-12-26 23:40:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:40:06,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:40:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:06,449 INFO L225 Difference]: With dead ends: 6166 [2019-12-26 23:40:06,449 INFO L226 Difference]: Without dead ends: 6166 [2019-12-26 23:40:06,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2019-12-26 23:40:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 3978. [2019-12-26 23:40:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-26 23:40:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 11512 transitions. [2019-12-26 23:40:06,545 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 11512 transitions. Word has length 66 [2019-12-26 23:40:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:06,545 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 11512 transitions. [2019-12-26 23:40:06,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:40:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 11512 transitions. [2019-12-26 23:40:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:40:06,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:06,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:06,555 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1064755320, now seen corresponding path program 1 times [2019-12-26 23:40:06,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:06,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694985393] [2019-12-26 23:40:06,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:06,656 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-26 23:40:06,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694985393] [2019-12-26 23:40:06,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:06,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:40:06,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949012177] [2019-12-26 23:40:06,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:40:06,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:06,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:40:06,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:40:06,659 INFO L87 Difference]: Start difference. First operand 3978 states and 11512 transitions. Second operand 6 states. [2019-12-26 23:40:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:07,283 INFO L93 Difference]: Finished difference Result 6598 states and 18721 transitions. [2019-12-26 23:40:07,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:40:07,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-26 23:40:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:07,292 INFO L225 Difference]: With dead ends: 6598 [2019-12-26 23:40:07,292 INFO L226 Difference]: Without dead ends: 6598 [2019-12-26 23:40:07,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:40:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2019-12-26 23:40:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 3978. [2019-12-26 23:40:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-26 23:40:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 11512 transitions. [2019-12-26 23:40:07,355 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 11512 transitions. Word has length 67 [2019-12-26 23:40:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:07,355 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 11512 transitions. [2019-12-26 23:40:07,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:40:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 11512 transitions. [2019-12-26 23:40:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:40:07,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:07,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:07,361 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash -361266720, now seen corresponding path program 2 times [2019-12-26 23:40:07,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:07,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310714145] [2019-12-26 23:40:07,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:07,473 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-26 23:40:07,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310714145] [2019-12-26 23:40:07,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:07,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:40:07,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25421211] [2019-12-26 23:40:07,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:40:07,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:07,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:40:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:40:07,475 INFO L87 Difference]: Start difference. First operand 3978 states and 11512 transitions. Second operand 6 states. [2019-12-26 23:40:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:07,547 INFO L93 Difference]: Finished difference Result 6630 states and 19227 transitions. [2019-12-26 23:40:07,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:40:07,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-26 23:40:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:07,554 INFO L225 Difference]: With dead ends: 6630 [2019-12-26 23:40:07,554 INFO L226 Difference]: Without dead ends: 3767 [2019-12-26 23:40:07,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:40:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2019-12-26 23:40:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3767. [2019-12-26 23:40:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3767 states. [2019-12-26 23:40:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 10857 transitions. [2019-12-26 23:40:07,624 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 10857 transitions. Word has length 67 [2019-12-26 23:40:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:07,625 INFO L462 AbstractCegarLoop]: Abstraction has 3767 states and 10857 transitions. [2019-12-26 23:40:07,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:40:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 10857 transitions. [2019-12-26 23:40:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:40:07,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:07,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:07,632 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:07,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1374418208, now seen corresponding path program 3 times [2019-12-26 23:40:07,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:07,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809825196] [2019-12-26 23:40:07,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:07,704 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-26 23:40:07,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809825196] [2019-12-26 23:40:07,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:07,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:40:07,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6585397] [2019-12-26 23:40:07,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:40:07,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:07,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:40:07,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:07,706 INFO L87 Difference]: Start difference. First operand 3767 states and 10857 transitions. Second operand 3 states. [2019-12-26 23:40:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:07,728 INFO L93 Difference]: Finished difference Result 3503 states and 9871 transitions. [2019-12-26 23:40:07,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:40:07,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:40:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:07,733 INFO L225 Difference]: With dead ends: 3503 [2019-12-26 23:40:07,734 INFO L226 Difference]: Without dead ends: 3503 [2019-12-26 23:40:07,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2019-12-26 23:40:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2810. [2019-12-26 23:40:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-26 23:40:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-26 23:40:07,793 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 67 [2019-12-26 23:40:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:07,794 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-26 23:40:07,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:40:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-26 23:40:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:07,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:07,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:07,799 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 1 times [2019-12-26 23:40:07,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:07,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785966416] [2019-12-26 23:40:07,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:08,916 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-26 23:40:08,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785966416] [2019-12-26 23:40:08,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:08,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-26 23:40:08,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740117516] [2019-12-26 23:40:08,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 23:40:08,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:08,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 23:40:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:40:08,919 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 22 states. [2019-12-26 23:40:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:15,145 INFO L93 Difference]: Finished difference Result 11950 states and 33613 transitions. [2019-12-26 23:40:15,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-26 23:40:15,146 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-26 23:40:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:15,160 INFO L225 Difference]: With dead ends: 11950 [2019-12-26 23:40:15,161 INFO L226 Difference]: Without dead ends: 11925 [2019-12-26 23:40:15,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=899, Invalid=6241, Unknown=0, NotChecked=0, Total=7140 [2019-12-26 23:40:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11925 states. [2019-12-26 23:40:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11925 to 4120. [2019-12-26 23:40:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4120 states. [2019-12-26 23:40:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 11535 transitions. [2019-12-26 23:40:15,258 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 11535 transitions. Word has length 68 [2019-12-26 23:40:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:15,258 INFO L462 AbstractCegarLoop]: Abstraction has 4120 states and 11535 transitions. [2019-12-26 23:40:15,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-26 23:40:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 11535 transitions. [2019-12-26 23:40:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:15,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:15,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:15,264 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash -243969052, now seen corresponding path program 2 times [2019-12-26 23:40:15,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:15,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12747213] [2019-12-26 23:40:15,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:15,698 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-26 23:40:15,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12747213] [2019-12-26 23:40:15,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:15,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:40:15,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243637994] [2019-12-26 23:40:15,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:40:15,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:40:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:40:15,700 INFO L87 Difference]: Start difference. First operand 4120 states and 11535 transitions. Second operand 18 states. [2019-12-26 23:40:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:18,639 INFO L93 Difference]: Finished difference Result 10225 states and 28457 transitions. [2019-12-26 23:40:18,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-26 23:40:18,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-26 23:40:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:18,654 INFO L225 Difference]: With dead ends: 10225 [2019-12-26 23:40:18,654 INFO L226 Difference]: Without dead ends: 10200 [2019-12-26 23:40:18,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=366, Invalid=2286, Unknown=0, NotChecked=0, Total=2652 [2019-12-26 23:40:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10200 states. [2019-12-26 23:40:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10200 to 4243. [2019-12-26 23:40:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4243 states. [2019-12-26 23:40:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4243 states to 4243 states and 11870 transitions. [2019-12-26 23:40:18,742 INFO L78 Accepts]: Start accepts. Automaton has 4243 states and 11870 transitions. Word has length 68 [2019-12-26 23:40:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:18,742 INFO L462 AbstractCegarLoop]: Abstraction has 4243 states and 11870 transitions. [2019-12-26 23:40:18,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:40:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4243 states and 11870 transitions. [2019-12-26 23:40:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:18,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:18,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:18,748 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 3 times [2019-12-26 23:40:18,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:18,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39942430] [2019-12-26 23:40:18,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:19,369 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-26 23:40:19,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39942430] [2019-12-26 23:40:19,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:19,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:40:19,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482311336] [2019-12-26 23:40:19,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:40:19,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:19,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:40:19,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:40:19,373 INFO L87 Difference]: Start difference. First operand 4243 states and 11870 transitions. Second operand 18 states. [2019-12-26 23:40:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:21,656 INFO L93 Difference]: Finished difference Result 9092 states and 25360 transitions. [2019-12-26 23:40:21,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 23:40:21,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-26 23:40:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:21,668 INFO L225 Difference]: With dead ends: 9092 [2019-12-26 23:40:21,669 INFO L226 Difference]: Without dead ends: 9067 [2019-12-26 23:40:21,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 23:40:21,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-26 23:40:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 4289. [2019-12-26 23:40:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4289 states. [2019-12-26 23:40:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 12001 transitions. [2019-12-26 23:40:21,765 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 12001 transitions. Word has length 68 [2019-12-26 23:40:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:21,765 INFO L462 AbstractCegarLoop]: Abstraction has 4289 states and 12001 transitions. [2019-12-26 23:40:21,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:40:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 12001 transitions. [2019-12-26 23:40:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:21,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:21,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:21,772 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 209870412, now seen corresponding path program 4 times [2019-12-26 23:40:21,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:21,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783766950] [2019-12-26 23:40:21,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:22,239 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-26 23:40:22,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783766950] [2019-12-26 23:40:22,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:22,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:40:22,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315670982] [2019-12-26 23:40:22,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:40:22,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:22,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:40:22,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:40:22,242 INFO L87 Difference]: Start difference. First operand 4289 states and 12001 transitions. Second operand 19 states. [2019-12-26 23:40:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:25,340 INFO L93 Difference]: Finished difference Result 10661 states and 29556 transitions. [2019-12-26 23:40:25,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-26 23:40:25,340 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-26 23:40:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:25,357 INFO L225 Difference]: With dead ends: 10661 [2019-12-26 23:40:25,357 INFO L226 Difference]: Without dead ends: 10636 [2019-12-26 23:40:25,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=335, Invalid=1921, Unknown=0, NotChecked=0, Total=2256 [2019-12-26 23:40:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10636 states. [2019-12-26 23:40:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10636 to 4439. [2019-12-26 23:40:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4439 states. [2019-12-26 23:40:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 12454 transitions. [2019-12-26 23:40:25,492 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 12454 transitions. Word has length 68 [2019-12-26 23:40:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:25,492 INFO L462 AbstractCegarLoop]: Abstraction has 4439 states and 12454 transitions. [2019-12-26 23:40:25,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:40:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 12454 transitions. [2019-12-26 23:40:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:25,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:25,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:25,497 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1592868418, now seen corresponding path program 5 times [2019-12-26 23:40:25,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:25,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228926167] [2019-12-26 23:40:25,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:25,967 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-26 23:40:25,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228926167] [2019-12-26 23:40:25,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:25,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:40:25,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152280986] [2019-12-26 23:40:25,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:40:25,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:25,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:40:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:40:25,970 INFO L87 Difference]: Start difference. First operand 4439 states and 12454 transitions. Second operand 19 states. [2019-12-26 23:40:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:29,042 INFO L93 Difference]: Finished difference Result 12562 states and 34444 transitions. [2019-12-26 23:40:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-26 23:40:29,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-26 23:40:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:29,058 INFO L225 Difference]: With dead ends: 12562 [2019-12-26 23:40:29,059 INFO L226 Difference]: Without dead ends: 12537 [2019-12-26 23:40:29,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=430, Invalid=2540, Unknown=0, NotChecked=0, Total=2970 [2019-12-26 23:40:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12537 states. [2019-12-26 23:40:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12537 to 4454. [2019-12-26 23:40:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-12-26 23:40:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 12487 transitions. [2019-12-26 23:40:29,156 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 12487 transitions. Word has length 68 [2019-12-26 23:40:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:29,156 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 12487 transitions. [2019-12-26 23:40:29,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:40:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 12487 transitions. [2019-12-26 23:40:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:29,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:29,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:29,161 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:29,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 6 times [2019-12-26 23:40:29,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:29,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890122025] [2019-12-26 23:40:29,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:29,676 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-26 23:40:29,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890122025] [2019-12-26 23:40:29,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:29,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:40:29,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408879872] [2019-12-26 23:40:29,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:40:29,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:40:29,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:40:29,678 INFO L87 Difference]: Start difference. First operand 4454 states and 12487 transitions. Second operand 19 states. [2019-12-26 23:40:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:32,146 INFO L93 Difference]: Finished difference Result 10651 states and 29664 transitions. [2019-12-26 23:40:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 23:40:32,147 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-26 23:40:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:32,159 INFO L225 Difference]: With dead ends: 10651 [2019-12-26 23:40:32,159 INFO L226 Difference]: Without dead ends: 10626 [2019-12-26 23:40:32,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=1815, Unknown=0, NotChecked=0, Total=2162 [2019-12-26 23:40:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10626 states. [2019-12-26 23:40:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10626 to 4550. [2019-12-26 23:40:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2019-12-26 23:40:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 12759 transitions. [2019-12-26 23:40:32,250 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 12759 transitions. Word has length 68 [2019-12-26 23:40:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:32,250 INFO L462 AbstractCegarLoop]: Abstraction has 4550 states and 12759 transitions. [2019-12-26 23:40:32,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:40:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 12759 transitions. [2019-12-26 23:40:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:32,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:32,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:32,255 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash -450226916, now seen corresponding path program 7 times [2019-12-26 23:40:32,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:32,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985637909] [2019-12-26 23:40:32,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:32,478 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-26 23:40:32,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985637909] [2019-12-26 23:40:32,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:32,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:40:32,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648219726] [2019-12-26 23:40:32,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:40:32,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:40:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:40:32,480 INFO L87 Difference]: Start difference. First operand 4550 states and 12759 transitions. Second operand 14 states. [2019-12-26 23:40:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:33,159 INFO L93 Difference]: Finished difference Result 7131 states and 19818 transitions. [2019-12-26 23:40:33,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:40:33,159 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-26 23:40:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:33,169 INFO L225 Difference]: With dead ends: 7131 [2019-12-26 23:40:33,169 INFO L226 Difference]: Without dead ends: 7106 [2019-12-26 23:40:33,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-26 23:40:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states. [2019-12-26 23:40:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 4062. [2019-12-26 23:40:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-26 23:40:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-26 23:40:33,235 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-26 23:40:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:33,235 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-26 23:40:33,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:40:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-26 23:40:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:40:33,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:33,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:33,239 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:33,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 8 times [2019-12-26 23:40:33,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:33,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931601384] [2019-12-26 23:40:33,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:40:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:40:33,346 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:40:33,346 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:40:33,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= 0 |v_ULTIMATE.start_main_~#t1967~0.offset_17|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1967~0.base_23| 4)) (= v_~z$w_buff1_used~0_381 0) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_23|)) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_23| 1)) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_41) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1967~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1967~0.base_23|) |v_ULTIMATE.start_main_~#t1967~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd2~0_100 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1967~0.base_23|) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_~#t1967~0.offset=|v_ULTIMATE.start_main_~#t1967~0.offset_17|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_21|, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_~#t1967~0.base=|v_ULTIMATE.start_main_~#t1967~0.base_23|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t1967~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1969~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1968~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1967~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1969~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:40:33,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1968~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1968~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1968~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11|) |v_ULTIMATE.start_main_~#t1968~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1968~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1968~0.base, #length] because there is no mapped edge [2019-12-26 23:40:33,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 23:40:33,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= |v_ULTIMATE.start_main_~#t1969~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1969~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1969~0.base_12| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12|) |v_ULTIMATE.start_main_~#t1969~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1969~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1969~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1969~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:40:33,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In288573823 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In288573823 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out288573823|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In288573823 |P0Thread1of1ForFork0_#t~ite5_Out288573823|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In288573823, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In288573823} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out288573823|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In288573823, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In288573823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:40:33,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In210180442 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In210180442 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In210180442 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In210180442 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out210180442| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out210180442| ~z$w_buff1_used~0_In210180442)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In210180442, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In210180442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In210180442, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In210180442} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out210180442|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In210180442, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In210180442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In210180442, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In210180442} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:40:33,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-619546537 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-619546537 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In-619546537 ~z$r_buff0_thd1~0_Out-619546537) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-619546537) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-619546537, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-619546537} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-619546537, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-619546537|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-619546537} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:40:33,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In1169431095 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1169431095 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1169431095 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1169431095 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1169431095| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In1169431095 |P0Thread1of1ForFork0_#t~ite8_Out1169431095|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1169431095, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1169431095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1169431095, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1169431095} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1169431095, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1169431095|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1169431095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1169431095, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1169431095} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:40:33,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:40:33,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In615380505 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In615380505 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In615380505 |P1Thread1of1ForFork1_#t~ite9_Out615380505|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out615380505| ~z~0_In615380505)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In615380505, ~z$w_buff1_used~0=~z$w_buff1_used~0_In615380505, ~z$w_buff1~0=~z$w_buff1~0_In615380505, ~z~0=~z~0_In615380505} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out615380505|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In615380505, ~z$w_buff1_used~0=~z$w_buff1_used~0_In615380505, ~z$w_buff1~0=~z$w_buff1~0_In615380505, ~z~0=~z~0_In615380505} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-26 23:40:33,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 23:40:33,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-127299317 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-127299317 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-127299317|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-127299317| ~z$w_buff0_used~0_In-127299317)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-127299317, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-127299317} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-127299317, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-127299317|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-127299317} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:40:33,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1305376504 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1305376504 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1305376504| ~z$w_buff1~0_In-1305376504)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1305376504| ~z~0_In-1305376504)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1305376504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1305376504, ~z$w_buff1~0=~z$w_buff1~0_In-1305376504, ~z~0=~z~0_In-1305376504} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1305376504|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1305376504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1305376504, ~z$w_buff1~0=~z$w_buff1~0_In-1305376504, ~z~0=~z~0_In-1305376504} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:40:33,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In301300302 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In301300302 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In301300302 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In301300302 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out301300302| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In301300302 |P1Thread1of1ForFork1_#t~ite12_Out301300302|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In301300302, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In301300302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301300302, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In301300302} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In301300302, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In301300302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301300302, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out301300302|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In301300302} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:40:33,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-447148347 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-447148347 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-447148347|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-447148347 |P1Thread1of1ForFork1_#t~ite13_Out-447148347|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-447148347, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-447148347} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-447148347, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-447148347|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-447148347} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:40:33,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 23:40:33,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1711454950 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1711454950 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1711454950| ~z$w_buff0_used~0_In1711454950)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1711454950| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1711454950, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1711454950} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1711454950, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1711454950, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1711454950|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:40:33,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In278719601 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In278719601 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In278719601 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In278719601 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out278719601| 0)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out278719601| ~z$w_buff1_used~0_In278719601) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In278719601, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In278719601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In278719601, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In278719601} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In278719601, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In278719601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In278719601, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In278719601, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out278719601|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:40:33,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-801024699 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-801024699 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-801024699| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-801024699| ~z$r_buff0_thd3~0_In-801024699) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-801024699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-801024699} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-801024699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-801024699, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-801024699|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:40:33,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2147095197 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-2147095197 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-2147095197 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2147095197 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-2147095197| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-2147095197| ~z$r_buff1_thd3~0_In-2147095197)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2147095197, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2147095197, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2147095197, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2147095197} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2147095197, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-2147095197|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2147095197, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2147095197, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2147095197} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:40:33,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:40:33,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In1701311746 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1701311746 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1701311746 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1701311746 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1701311746 |P1Thread1of1ForFork1_#t~ite14_Out1701311746|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1701311746|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1701311746, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1701311746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1701311746, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1701311746} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1701311746, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1701311746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1701311746, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1701311746|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1701311746} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:40:33,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:40:33,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:40:33,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1154529137 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1154529137 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out1154529137| ~z$w_buff1~0_In1154529137)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out1154529137| ~z~0_In1154529137)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1154529137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1154529137, ~z$w_buff1~0=~z$w_buff1~0_In1154529137, ~z~0=~z~0_In1154529137} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1154529137, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1154529137|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1154529137, ~z$w_buff1~0=~z$w_buff1~0_In1154529137, ~z~0=~z~0_In1154529137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 23:40:33,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-26 23:40:33,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2110208182 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2110208182 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2110208182 |ULTIMATE.start_main_#t~ite26_Out-2110208182|)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-2110208182|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2110208182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2110208182} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2110208182, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2110208182, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-2110208182|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:40:33,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2049095543 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-2049095543 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2049095543 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2049095543 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-2049095543| ~z$w_buff1_used~0_In-2049095543)) (and (= |ULTIMATE.start_main_#t~ite27_Out-2049095543| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2049095543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2049095543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2049095543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2049095543} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2049095543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2049095543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2049095543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2049095543, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-2049095543|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:40:33,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1347272973 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1347272973 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1347272973 |ULTIMATE.start_main_#t~ite28_Out1347272973|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out1347272973|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1347272973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1347272973} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1347272973, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1347272973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1347272973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:40:33,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1922474792 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1922474792 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1922474792 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1922474792 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out1922474792|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1922474792 |ULTIMATE.start_main_#t~ite29_Out1922474792|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1922474792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1922474792, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1922474792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1922474792} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1922474792, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1922474792|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1922474792, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1922474792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1922474792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:40:33,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:40:33,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:40:33,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:40:33,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:40:33 BasicIcfg [2019-12-26 23:40:33,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:40:33,482 INFO L168 Benchmark]: Toolchain (without parser) took 119871.18 ms. Allocated memory was 139.5 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 23:40:33,483 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:40:33,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.70 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 156.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:33,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.34 ms. Allocated memory is still 203.9 MB. Free memory was 156.6 MB in the beginning and 153.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:33,485 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:33,485 INFO L168 Benchmark]: RCFGBuilder took 832.97 ms. Allocated memory is still 203.9 MB. Free memory was 150.8 MB in the beginning and 101.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:40:33,486 INFO L168 Benchmark]: TraceAbstraction took 118072.21 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-26 23:40:33,489 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 852.70 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 156.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.34 ms. Allocated memory is still 203.9 MB. Free memory was 156.6 MB in the beginning and 153.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.97 ms. Allocated memory is still 203.9 MB. Free memory was 150.8 MB in the beginning and 101.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118072.21 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1967, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1968, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1969, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.7s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 42.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3464 SDtfs, 5497 SDslu, 15883 SDs, 0 SdLazy, 18971 SolverSat, 530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 27 SyntacticMatches, 30 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4959 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 117266 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1128 NumberOfCodeBlocks, 1128 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 378651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 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...