/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:33:18,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:33:18,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:33:18,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:33:18,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:33:18,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:33:18,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:33:18,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:33:18,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:33:18,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:33:18,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:33:18,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:33:18,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:33:18,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:33:18,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:33:18,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:33:18,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:33:18,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:33:18,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:33:18,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:33:18,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:33:18,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:33:18,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:33:18,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:33:18,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:33:18,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:33:18,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:33:18,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:33:18,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:33:18,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:33:18,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:33:18,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:33:18,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:33:18,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:33:18,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:33:18,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:33:18,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:33:18,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:33:18,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:33:18,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:33:18,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:33:18,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:33:18,329 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:33:18,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:33:18,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:33:18,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:33:18,334 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:33:18,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:33:18,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:33:18,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:33:18,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:33:18,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:33:18,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:33:18,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:33:18,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:33:18,338 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:33:18,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:33:18,338 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:33:18,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:33:18,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:33:18,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:33:18,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:33:18,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:33:18,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:33:18,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:33:18,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:33:18,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:33:18,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:33:18,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:33:18,341 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:33:18,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:33:18,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:33:18,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:33:18,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:33:18,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:33:18,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:33:18,642 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:33:18,643 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-27 07:33:18,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ecffe3d/59b2c4a1f6fa4be9ae7309325fd07a7b/FLAG5ec65324a [2019-12-27 07:33:19,253 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:33:19,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-27 07:33:19,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ecffe3d/59b2c4a1f6fa4be9ae7309325fd07a7b/FLAG5ec65324a [2019-12-27 07:33:19,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ecffe3d/59b2c4a1f6fa4be9ae7309325fd07a7b [2019-12-27 07:33:19,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:33:19,553 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:33:19,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:33:19,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:33:19,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:33:19,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:33:19" (1/1) ... [2019-12-27 07:33:19,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aced33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:19, skipping insertion in model container [2019-12-27 07:33:19,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:33:19" (1/1) ... [2019-12-27 07:33:19,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:33:19,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:33:20,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:33:20,234 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:33:20,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:33:20,385 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:33:20,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20 WrapperNode [2019-12-27 07:33:20,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:33:20,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:33:20,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:33:20,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:33:20,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:33:20,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:33:20,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:33:20,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:33:20,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... [2019-12-27 07:33:20,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:33:20,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:33:20,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:33:20,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:33:20,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:33:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:33:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:33:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:33:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:33:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:33:20,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:33:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:33:20,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:33:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:33:20,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:33:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:33:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:33:20,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:33:20,583 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:33:21,479 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:33:21,479 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:33:21,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:33:21 BoogieIcfgContainer [2019-12-27 07:33:21,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:33:21,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:33:21,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:33:21,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:33:21,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:33:19" (1/3) ... [2019-12-27 07:33:21,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9a4c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:33:21, skipping insertion in model container [2019-12-27 07:33:21,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:33:20" (2/3) ... [2019-12-27 07:33:21,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9a4c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:33:21, skipping insertion in model container [2019-12-27 07:33:21,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:33:21" (3/3) ... [2019-12-27 07:33:21,491 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.oepc.i [2019-12-27 07:33:21,502 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:33:21,503 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:33:21,514 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:33:21,516 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:33:21,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,594 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,613 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,613 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,655 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,656 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,667 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,667 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:33:21,686 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:33:21,704 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:33:21,704 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:33:21,704 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:33:21,704 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:33:21,704 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:33:21,705 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:33:21,705 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:33:21,705 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:33:21,720 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 07:33:21,722 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:33:21,821 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:33:21,821 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:33:21,838 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-27 07:33:21,862 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:33:21,957 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:33:21,958 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:33:21,968 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-27 07:33:21,993 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 07:33:21,994 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:33:25,345 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:33:25,466 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:33:25,492 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84694 [2019-12-27 07:33:25,492 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 07:33:25,496 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 111 transitions [2019-12-27 07:33:47,934 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129812 states. [2019-12-27 07:33:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 129812 states. [2019-12-27 07:33:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:33:47,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:33:47,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:33:47,944 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-27 07:33:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:33:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash 841641, now seen corresponding path program 1 times [2019-12-27 07:33:47,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:33:47,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901474949] [2019-12-27 07:33:47,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:33:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:33:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:33:48,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901474949] [2019-12-27 07:33:48,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:33:48,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:33:48,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785340917] [2019-12-27 07:33:48,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:33:48,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:33:48,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:33:48,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:33:48,282 INFO L87 Difference]: Start difference. First operand 129812 states. Second operand 3 states. [2019-12-27 07:33:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:33:51,641 INFO L93 Difference]: Finished difference Result 129324 states and 557563 transitions. [2019-12-27 07:33:51,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:33:51,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:33:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:33:52,424 INFO L225 Difference]: With dead ends: 129324 [2019-12-27 07:33:52,424 INFO L226 Difference]: Without dead ends: 126776 [2019-12-27 07:33:52,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:33:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126776 states. [2019-12-27 07:34:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126776 to 126776. [2019-12-27 07:34:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126776 states. [2019-12-27 07:34:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126776 states to 126776 states and 547175 transitions. [2019-12-27 07:34:06,044 INFO L78 Accepts]: Start accepts. Automaton has 126776 states and 547175 transitions. Word has length 3 [2019-12-27 07:34:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:34:06,045 INFO L462 AbstractCegarLoop]: Abstraction has 126776 states and 547175 transitions. [2019-12-27 07:34:06,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:34:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 126776 states and 547175 transitions. [2019-12-27 07:34:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:34:06,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:34:06,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:34:06,058 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-27 07:34:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:34:06,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1225155789, now seen corresponding path program 1 times [2019-12-27 07:34:06,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:34:06,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299246452] [2019-12-27 07:34:06,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:34:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:34:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:34:06,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299246452] [2019-12-27 07:34:06,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:34:06,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:34:06,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899941615] [2019-12-27 07:34:06,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:34:06,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:34:06,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:34:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:34:06,195 INFO L87 Difference]: Start difference. First operand 126776 states and 547175 transitions. Second operand 4 states. [2019-12-27 07:34:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:34:12,428 INFO L93 Difference]: Finished difference Result 198216 states and 822018 transitions. [2019-12-27 07:34:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:34:12,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:34:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:34:13,113 INFO L225 Difference]: With dead ends: 198216 [2019-12-27 07:34:13,113 INFO L226 Difference]: Without dead ends: 198167 [2019-12-27 07:34:13,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:34:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198167 states. [2019-12-27 07:34:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198167 to 182118. [2019-12-27 07:34:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182118 states. [2019-12-27 07:34:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182118 states to 182118 states and 765134 transitions. [2019-12-27 07:34:23,518 INFO L78 Accepts]: Start accepts. Automaton has 182118 states and 765134 transitions. Word has length 11 [2019-12-27 07:34:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:34:23,520 INFO L462 AbstractCegarLoop]: Abstraction has 182118 states and 765134 transitions. [2019-12-27 07:34:23,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:34:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 182118 states and 765134 transitions. [2019-12-27 07:34:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:34:23,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:34:23,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:34:23,525 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-27 07:34:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:34:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1435968535, now seen corresponding path program 1 times [2019-12-27 07:34:23,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:34:23,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593011294] [2019-12-27 07:34:23,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:34:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:34:30,891 WARN L192 SmtUtils]: Spent 7.27 s on a formula simplification that was a NOOP. DAG size: 5 [2019-12-27 07:34:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:34:30,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593011294] [2019-12-27 07:34:30,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:34:30,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:34:30,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782308582] [2019-12-27 07:34:30,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:34:30,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:34:30,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:34:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:34:30,929 INFO L87 Difference]: Start difference. First operand 182118 states and 765134 transitions. Second operand 4 states. [2019-12-27 07:34:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:34:32,561 INFO L93 Difference]: Finished difference Result 260296 states and 1067327 transitions. [2019-12-27 07:34:32,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:34:32,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:34:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:34:34,906 INFO L225 Difference]: With dead ends: 260296 [2019-12-27 07:34:34,906 INFO L226 Difference]: Without dead ends: 260233 [2019-12-27 07:34:34,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:34:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260233 states. [2019-12-27 07:34:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260233 to 221154. [2019-12-27 07:34:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221154 states. [2019-12-27 07:34:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221154 states to 221154 states and 922215 transitions. [2019-12-27 07:34:54,612 INFO L78 Accepts]: Start accepts. Automaton has 221154 states and 922215 transitions. Word has length 13 [2019-12-27 07:34:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:34:54,613 INFO L462 AbstractCegarLoop]: Abstraction has 221154 states and 922215 transitions. [2019-12-27 07:34:54,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:34:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 221154 states and 922215 transitions. [2019-12-27 07:34:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:34:54,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:34:54,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:34:54,618 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-27 07:34:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:34:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash 472638345, now seen corresponding path program 1 times [2019-12-27 07:34:54,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:34:54,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460787421] [2019-12-27 07:34:54,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:34:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:34:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:34:54,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460787421] [2019-12-27 07:34:54,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:34:54,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:34:54,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981449324] [2019-12-27 07:34:54,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:34:54,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:34:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:34:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:34:54,707 INFO L87 Difference]: Start difference. First operand 221154 states and 922215 transitions. Second operand 3 states. [2019-12-27 07:34:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:34:54,908 INFO L93 Difference]: Finished difference Result 42754 states and 139696 transitions. [2019-12-27 07:34:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:34:54,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:34:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:34:54,977 INFO L225 Difference]: With dead ends: 42754 [2019-12-27 07:34:54,977 INFO L226 Difference]: Without dead ends: 42754 [2019-12-27 07:34:54,977 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-27 07:34:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-12-27 07:35:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754. [2019-12-27 07:35:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42754 states. [2019-12-27 07:35:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 139696 transitions. [2019-12-27 07:35:01,753 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 139696 transitions. Word has length 13 [2019-12-27 07:35:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:01,753 INFO L462 AbstractCegarLoop]: Abstraction has 42754 states and 139696 transitions. [2019-12-27 07:35:01,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 139696 transitions. [2019-12-27 07:35:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:35:01,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:01,760 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-27 07:35:01,760 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-27 07:35:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash -589628414, now seen corresponding path program 1 times [2019-12-27 07:35:01,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:01,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469719807] [2019-12-27 07:35:01,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:01,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469719807] [2019-12-27 07:35:01,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:01,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:35:01,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746138768] [2019-12-27 07:35:01,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:35:01,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:01,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:35:01,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:01,923 INFO L87 Difference]: Start difference. First operand 42754 states and 139696 transitions. Second operand 5 states. [2019-12-27 07:35:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:02,763 INFO L93 Difference]: Finished difference Result 57358 states and 183378 transitions. [2019-12-27 07:35:02,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:35:02,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:35:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:02,867 INFO L225 Difference]: With dead ends: 57358 [2019-12-27 07:35:02,867 INFO L226 Difference]: Without dead ends: 57345 [2019-12-27 07:35:02,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:35:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57345 states. [2019-12-27 07:35:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57345 to 43244. [2019-12-27 07:35:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43244 states. [2019-12-27 07:35:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43244 states to 43244 states and 140907 transitions. [2019-12-27 07:35:04,163 INFO L78 Accepts]: Start accepts. Automaton has 43244 states and 140907 transitions. Word has length 19 [2019-12-27 07:35:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:04,164 INFO L462 AbstractCegarLoop]: Abstraction has 43244 states and 140907 transitions. [2019-12-27 07:35:04,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:35:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 43244 states and 140907 transitions. [2019-12-27 07:35:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:35:04,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:04,175 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-27 07:35:04,175 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-27 07:35:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1356407650, now seen corresponding path program 1 times [2019-12-27 07:35:04,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:04,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738177605] [2019-12-27 07:35:04,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:04,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738177605] [2019-12-27 07:35:04,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:04,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:35:04,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826849684] [2019-12-27 07:35:04,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:35:04,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:04,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:35:04,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:35:04,234 INFO L87 Difference]: Start difference. First operand 43244 states and 140907 transitions. Second operand 4 states. [2019-12-27 07:35:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:04,280 INFO L93 Difference]: Finished difference Result 8037 states and 21818 transitions. [2019-12-27 07:35:04,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:35:04,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:35:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:04,294 INFO L225 Difference]: With dead ends: 8037 [2019-12-27 07:35:04,294 INFO L226 Difference]: Without dead ends: 8037 [2019-12-27 07:35:04,296 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-27 07:35:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2019-12-27 07:35:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 7897. [2019-12-27 07:35:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 07:35:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 21446 transitions. [2019-12-27 07:35:04,406 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 21446 transitions. Word has length 25 [2019-12-27 07:35:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:04,407 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 21446 transitions. [2019-12-27 07:35:04,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:35:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 21446 transitions. [2019-12-27 07:35:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:35:04,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:04,419 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-27 07:35:04,419 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-27 07:35:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1453764539, now seen corresponding path program 1 times [2019-12-27 07:35:04,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:04,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876218160] [2019-12-27 07:35:04,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:04,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876218160] [2019-12-27 07:35:04,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:04,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:35:04,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496658648] [2019-12-27 07:35:04,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:35:04,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:04,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:35:04,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:04,516 INFO L87 Difference]: Start difference. First operand 7897 states and 21446 transitions. Second operand 5 states. [2019-12-27 07:35:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:04,560 INFO L93 Difference]: Finished difference Result 5718 states and 16246 transitions. [2019-12-27 07:35:04,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:35:04,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:35:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:04,569 INFO L225 Difference]: With dead ends: 5718 [2019-12-27 07:35:04,569 INFO L226 Difference]: Without dead ends: 5314 [2019-12-27 07:35:04,570 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-27 07:35:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2019-12-27 07:35:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4950. [2019-12-27 07:35:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 07:35:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14287 transitions. [2019-12-27 07:35:04,646 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14287 transitions. Word has length 37 [2019-12-27 07:35:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:04,647 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14287 transitions. [2019-12-27 07:35:04,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:35:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14287 transitions. [2019-12-27 07:35:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:04,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:04,655 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-27 07:35:04,655 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-27 07:35:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1228802019, now seen corresponding path program 1 times [2019-12-27 07:35:04,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:04,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035547682] [2019-12-27 07:35:04,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:04,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035547682] [2019-12-27 07:35:04,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:04,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:35:04,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188299010] [2019-12-27 07:35:04,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:04,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:04,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:04,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:04,728 INFO L87 Difference]: Start difference. First operand 4950 states and 14287 transitions. Second operand 3 states. [2019-12-27 07:35:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:04,796 INFO L93 Difference]: Finished difference Result 4959 states and 14296 transitions. [2019-12-27 07:35:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:04,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:35:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:04,804 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 07:35:04,804 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 07:35:04,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 07:35:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 07:35:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 07:35:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14292 transitions. [2019-12-27 07:35:04,876 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14292 transitions. Word has length 65 [2019-12-27 07:35:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:04,876 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14292 transitions. [2019-12-27 07:35:04,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14292 transitions. [2019-12-27 07:35:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:04,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:04,883 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-27 07:35:04,883 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-27 07:35:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash 320653868, now seen corresponding path program 1 times [2019-12-27 07:35:04,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:04,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593138205] [2019-12-27 07:35:04,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:05,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593138205] [2019-12-27 07:35:05,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:05,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:35:05,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150544238] [2019-12-27 07:35:05,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:35:05,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:05,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:35:05,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:05,002 INFO L87 Difference]: Start difference. First operand 4955 states and 14292 transitions. Second operand 5 states. [2019-12-27 07:35:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:05,329 INFO L93 Difference]: Finished difference Result 7546 states and 21557 transitions. [2019-12-27 07:35:05,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:35:05,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:35:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:05,340 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 07:35:05,341 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 07:35:05,341 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-27 07:35:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 07:35:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 07:35:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 07:35:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18327 transitions. [2019-12-27 07:35:05,437 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18327 transitions. Word has length 65 [2019-12-27 07:35:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:05,437 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18327 transitions. [2019-12-27 07:35:05,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:35:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18327 transitions. [2019-12-27 07:35:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:05,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:05,446 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-27 07:35:05,447 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-27 07:35:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2108512596, now seen corresponding path program 2 times [2019-12-27 07:35:05,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:05,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006794585] [2019-12-27 07:35:05,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:05,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006794585] [2019-12-27 07:35:05,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:05,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:35:05,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253808434] [2019-12-27 07:35:05,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:35:05,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:35:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:35:05,588 INFO L87 Difference]: Start difference. First operand 6352 states and 18327 transitions. Second operand 5 states. [2019-12-27 07:35:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:05,923 INFO L93 Difference]: Finished difference Result 9350 states and 26643 transitions. [2019-12-27 07:35:05,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:35:05,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:35:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:05,935 INFO L225 Difference]: With dead ends: 9350 [2019-12-27 07:35:05,935 INFO L226 Difference]: Without dead ends: 9350 [2019-12-27 07:35:05,936 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-27 07:35:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9350 states. [2019-12-27 07:35:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9350 to 7014. [2019-12-27 07:35:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-27 07:35:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20305 transitions. [2019-12-27 07:35:06,048 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20305 transitions. Word has length 65 [2019-12-27 07:35:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:06,048 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20305 transitions. [2019-12-27 07:35:06,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:35:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20305 transitions. [2019-12-27 07:35:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:06,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:06,058 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-27 07:35:06,058 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-27 07:35:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash 27480750, now seen corresponding path program 3 times [2019-12-27 07:35:06,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:06,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792534057] [2019-12-27 07:35:06,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:06,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792534057] [2019-12-27 07:35:06,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:06,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:35:06,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824556714] [2019-12-27 07:35:06,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:35:06,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:35:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:35:06,158 INFO L87 Difference]: Start difference. First operand 7014 states and 20305 transitions. Second operand 6 states. [2019-12-27 07:35:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:06,966 INFO L93 Difference]: Finished difference Result 11291 states and 32444 transitions. [2019-12-27 07:35:06,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:35:06,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:35:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:06,988 INFO L225 Difference]: With dead ends: 11291 [2019-12-27 07:35:06,988 INFO L226 Difference]: Without dead ends: 11291 [2019-12-27 07:35:06,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:35:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2019-12-27 07:35:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 7569. [2019-12-27 07:35:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-27 07:35:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 21975 transitions. [2019-12-27 07:35:07,228 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 21975 transitions. Word has length 65 [2019-12-27 07:35:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:07,229 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 21975 transitions. [2019-12-27 07:35:07,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:35:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 21975 transitions. [2019-12-27 07:35:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:07,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:07,248 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-27 07:35:07,248 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-27 07:35:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1465472054, now seen corresponding path program 4 times [2019-12-27 07:35:07,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:07,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138481808] [2019-12-27 07:35:07,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:07,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138481808] [2019-12-27 07:35:07,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:07,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:35:07,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562374927] [2019-12-27 07:35:07,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:35:07,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:07,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:35:07,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:35:07,444 INFO L87 Difference]: Start difference. First operand 7569 states and 21975 transitions. Second operand 7 states. [2019-12-27 07:35:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:08,070 INFO L93 Difference]: Finished difference Result 10727 states and 30551 transitions. [2019-12-27 07:35:08,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:35:08,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:35:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:08,085 INFO L225 Difference]: With dead ends: 10727 [2019-12-27 07:35:08,085 INFO L226 Difference]: Without dead ends: 10727 [2019-12-27 07:35:08,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:35:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10727 states. [2019-12-27 07:35:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10727 to 7940. [2019-12-27 07:35:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7940 states. [2019-12-27 07:35:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7940 states to 7940 states and 23023 transitions. [2019-12-27 07:35:08,214 INFO L78 Accepts]: Start accepts. Automaton has 7940 states and 23023 transitions. Word has length 65 [2019-12-27 07:35:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:08,214 INFO L462 AbstractCegarLoop]: Abstraction has 7940 states and 23023 transitions. [2019-12-27 07:35:08,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:35:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7940 states and 23023 transitions. [2019-12-27 07:35:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:08,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:08,226 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-27 07:35:08,226 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-27 07:35:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1501839526, now seen corresponding path program 5 times [2019-12-27 07:35:08,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:08,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61242090] [2019-12-27 07:35:08,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:08,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61242090] [2019-12-27 07:35:08,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:08,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:35:08,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611759347] [2019-12-27 07:35:08,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:35:08,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:35:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:35:08,503 INFO L87 Difference]: Start difference. First operand 7940 states and 23023 transitions. Second operand 13 states. [2019-12-27 07:35:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:09,364 INFO L93 Difference]: Finished difference Result 18043 states and 52185 transitions. [2019-12-27 07:35:09,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:35:09,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 07:35:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:09,378 INFO L225 Difference]: With dead ends: 18043 [2019-12-27 07:35:09,378 INFO L226 Difference]: Without dead ends: 9160 [2019-12-27 07:35:09,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 07:35:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9160 states. [2019-12-27 07:35:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9160 to 7452. [2019-12-27 07:35:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7452 states. [2019-12-27 07:35:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7452 states to 7452 states and 21587 transitions. [2019-12-27 07:35:09,496 INFO L78 Accepts]: Start accepts. Automaton has 7452 states and 21587 transitions. Word has length 65 [2019-12-27 07:35:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:09,496 INFO L462 AbstractCegarLoop]: Abstraction has 7452 states and 21587 transitions. [2019-12-27 07:35:09,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:35:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7452 states and 21587 transitions. [2019-12-27 07:35:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:09,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:09,507 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-27 07:35:09,507 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-27 07:35:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash 986166422, now seen corresponding path program 6 times [2019-12-27 07:35:09,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:09,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233700614] [2019-12-27 07:35:09,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:09,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233700614] [2019-12-27 07:35:09,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:09,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:35:09,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098928085] [2019-12-27 07:35:09,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:35:09,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:09,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:35:09,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:35:09,621 INFO L87 Difference]: Start difference. First operand 7452 states and 21587 transitions. Second operand 7 states. [2019-12-27 07:35:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:10,475 INFO L93 Difference]: Finished difference Result 11601 states and 33214 transitions. [2019-12-27 07:35:10,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:35:10,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:35:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:10,491 INFO L225 Difference]: With dead ends: 11601 [2019-12-27 07:35:10,491 INFO L226 Difference]: Without dead ends: 11601 [2019-12-27 07:35:10,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:35:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11601 states. [2019-12-27 07:35:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11601 to 7191. [2019-12-27 07:35:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7191 states. [2019-12-27 07:35:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7191 states to 7191 states and 20821 transitions. [2019-12-27 07:35:10,620 INFO L78 Accepts]: Start accepts. Automaton has 7191 states and 20821 transitions. Word has length 65 [2019-12-27 07:35:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:10,620 INFO L462 AbstractCegarLoop]: Abstraction has 7191 states and 20821 transitions. [2019-12-27 07:35:10,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:35:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7191 states and 20821 transitions. [2019-12-27 07:35:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:10,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:10,629 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-27 07:35:10,629 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-27 07:35:10,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:10,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2023448256, now seen corresponding path program 7 times [2019-12-27 07:35:10,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:10,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82961137] [2019-12-27 07:35:10,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:10,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82961137] [2019-12-27 07:35:10,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:10,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:35:10,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922604835] [2019-12-27 07:35:10,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:35:10,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:35:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:35:10,743 INFO L87 Difference]: Start difference. First operand 7191 states and 20821 transitions. Second operand 7 states. [2019-12-27 07:35:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:11,829 INFO L93 Difference]: Finished difference Result 11101 states and 31555 transitions. [2019-12-27 07:35:11,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 07:35:11,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:35:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:11,844 INFO L225 Difference]: With dead ends: 11101 [2019-12-27 07:35:11,845 INFO L226 Difference]: Without dead ends: 11101 [2019-12-27 07:35:11,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:35:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11101 states. [2019-12-27 07:35:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11101 to 7681. [2019-12-27 07:35:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7681 states. [2019-12-27 07:35:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7681 states to 7681 states and 22251 transitions. [2019-12-27 07:35:11,978 INFO L78 Accepts]: Start accepts. Automaton has 7681 states and 22251 transitions. Word has length 65 [2019-12-27 07:35:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:11,978 INFO L462 AbstractCegarLoop]: Abstraction has 7681 states and 22251 transitions. [2019-12-27 07:35:11,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:35:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7681 states and 22251 transitions. [2019-12-27 07:35:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:35:11,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:11,986 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-27 07:35:11,986 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-27 07:35:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1090586468, now seen corresponding path program 8 times [2019-12-27 07:35:11,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:11,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273798338] [2019-12-27 07:35:11,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:12,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273798338] [2019-12-27 07:35:12,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:12,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:35:12,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297330672] [2019-12-27 07:35:12,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:12,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:12,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:12,056 INFO L87 Difference]: Start difference. First operand 7681 states and 22251 transitions. Second operand 3 states. [2019-12-27 07:35:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:12,136 INFO L93 Difference]: Finished difference Result 7680 states and 22249 transitions. [2019-12-27 07:35:12,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:12,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:35:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:12,149 INFO L225 Difference]: With dead ends: 7680 [2019-12-27 07:35:12,149 INFO L226 Difference]: Without dead ends: 7680 [2019-12-27 07:35:12,149 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-27 07:35:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7680 states. [2019-12-27 07:35:12,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7680 to 4539. [2019-12-27 07:35:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4539 states. [2019-12-27 07:35:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 13435 transitions. [2019-12-27 07:35:12,273 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 13435 transitions. Word has length 65 [2019-12-27 07:35:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:12,273 INFO L462 AbstractCegarLoop]: Abstraction has 4539 states and 13435 transitions. [2019-12-27 07:35:12,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 13435 transitions. [2019-12-27 07:35:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:35:12,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:12,280 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-27 07:35:12,280 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-27 07:35:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash 709972618, now seen corresponding path program 1 times [2019-12-27 07:35:12,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:12,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021768695] [2019-12-27 07:35:12,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:12,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021768695] [2019-12-27 07:35:12,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:12,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:35:12,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875956594] [2019-12-27 07:35:12,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:12,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:12,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:12,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:12,353 INFO L87 Difference]: Start difference. First operand 4539 states and 13435 transitions. Second operand 3 states. [2019-12-27 07:35:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:12,378 INFO L93 Difference]: Finished difference Result 4233 states and 12237 transitions. [2019-12-27 07:35:12,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:12,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:35:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:12,385 INFO L225 Difference]: With dead ends: 4233 [2019-12-27 07:35:12,385 INFO L226 Difference]: Without dead ends: 4233 [2019-12-27 07:35:12,386 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-27 07:35:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-12-27 07:35:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 3405. [2019-12-27 07:35:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2019-12-27 07:35:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 9885 transitions. [2019-12-27 07:35:12,461 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 9885 transitions. Word has length 66 [2019-12-27 07:35:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:12,462 INFO L462 AbstractCegarLoop]: Abstraction has 3405 states and 9885 transitions. [2019-12-27 07:35:12,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 9885 transitions. [2019-12-27 07:35:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:35:12,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:12,467 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-27 07:35:12,467 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-27 07:35:12,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:12,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1990304176, now seen corresponding path program 1 times [2019-12-27 07:35:12,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:12,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992875931] [2019-12-27 07:35:12,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:12,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992875931] [2019-12-27 07:35:12,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:12,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:35:12,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254183734] [2019-12-27 07:35:12,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:35:12,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:35:12,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:35:12,534 INFO L87 Difference]: Start difference. First operand 3405 states and 9885 transitions. Second operand 3 states. [2019-12-27 07:35:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:12,556 INFO L93 Difference]: Finished difference Result 3051 states and 8584 transitions. [2019-12-27 07:35:12,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:35:12,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:35:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:12,561 INFO L225 Difference]: With dead ends: 3051 [2019-12-27 07:35:12,561 INFO L226 Difference]: Without dead ends: 3051 [2019-12-27 07:35:12,561 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-27 07:35:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2019-12-27 07:35:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2817. [2019-12-27 07:35:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-27 07:35:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7945 transitions. [2019-12-27 07:35:12,612 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7945 transitions. Word has length 67 [2019-12-27 07:35:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:12,612 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7945 transitions. [2019-12-27 07:35:12,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:35:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7945 transitions. [2019-12-27 07:35:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:35:12,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:12,615 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-27 07:35:12,616 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-27 07:35:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1307128750, now seen corresponding path program 1 times [2019-12-27 07:35:12,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:12,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980518140] [2019-12-27 07:35:12,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:12,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980518140] [2019-12-27 07:35:12,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:12,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:35:12,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76841375] [2019-12-27 07:35:12,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:35:12,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:12,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:35:12,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:35:12,828 INFO L87 Difference]: Start difference. First operand 2817 states and 7945 transitions. Second operand 13 states. [2019-12-27 07:35:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:13,403 INFO L93 Difference]: Finished difference Result 5574 states and 15703 transitions. [2019-12-27 07:35:13,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:35:13,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 07:35:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:13,413 INFO L225 Difference]: With dead ends: 5574 [2019-12-27 07:35:13,413 INFO L226 Difference]: Without dead ends: 5542 [2019-12-27 07:35:13,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-27 07:35:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5542 states. [2019-12-27 07:35:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5542 to 3948. [2019-12-27 07:35:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-27 07:35:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11039 transitions. [2019-12-27 07:35:13,493 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11039 transitions. Word has length 68 [2019-12-27 07:35:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:13,494 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 11039 transitions. [2019-12-27 07:35:13,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:35:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11039 transitions. [2019-12-27 07:35:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:35:13,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:13,498 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-27 07:35:13,498 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-27 07:35:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:13,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1086450056, now seen corresponding path program 2 times [2019-12-27 07:35:13,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:13,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808834317] [2019-12-27 07:35:13,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:13,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808834317] [2019-12-27 07:35:13,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:13,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:35:13,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470764787] [2019-12-27 07:35:13,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:35:13,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:13,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:35:13,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:35:13,713 INFO L87 Difference]: Start difference. First operand 3948 states and 11039 transitions. Second operand 13 states. [2019-12-27 07:35:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:14,371 INFO L93 Difference]: Finished difference Result 7046 states and 19795 transitions. [2019-12-27 07:35:14,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:35:14,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 07:35:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:14,380 INFO L225 Difference]: With dead ends: 7046 [2019-12-27 07:35:14,381 INFO L226 Difference]: Without dead ends: 7014 [2019-12-27 07:35:14,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-27 07:35:14,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2019-12-27 07:35:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 4160. [2019-12-27 07:35:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-27 07:35:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11656 transitions. [2019-12-27 07:35:14,510 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11656 transitions. Word has length 68 [2019-12-27 07:35:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:14,510 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11656 transitions. [2019-12-27 07:35:14,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:35:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11656 transitions. [2019-12-27 07:35:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:35:14,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:14,518 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-27 07:35:14,519 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-27 07:35:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1871389806, now seen corresponding path program 3 times [2019-12-27 07:35:14,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:14,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321642935] [2019-12-27 07:35:14,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:35:14,774 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-27 07:35:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:35:14,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321642935] [2019-12-27 07:35:14,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:35:14,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:35:14,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104985771] [2019-12-27 07:35:14,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:35:14,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:35:14,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:35:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:35:14,888 INFO L87 Difference]: Start difference. First operand 4160 states and 11656 transitions. Second operand 13 states. [2019-12-27 07:35:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:35:15,573 INFO L93 Difference]: Finished difference Result 6163 states and 17081 transitions. [2019-12-27 07:35:15,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 07:35:15,573 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 07:35:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:35:15,582 INFO L225 Difference]: With dead ends: 6163 [2019-12-27 07:35:15,583 INFO L226 Difference]: Without dead ends: 6131 [2019-12-27 07:35:15,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-12-27 07:35:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2019-12-27 07:35:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 4069. [2019-12-27 07:35:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-12-27 07:35:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 11331 transitions. [2019-12-27 07:35:15,648 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 11331 transitions. Word has length 68 [2019-12-27 07:35:15,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:35:15,648 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 11331 transitions. [2019-12-27 07:35:15,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:35:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 11331 transitions. [2019-12-27 07:35:15,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:35:15,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:35:15,652 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-27 07:35:15,652 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-27 07:35:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:35:15,652 INFO L82 PathProgramCache]: Analyzing trace with hash 158566424, now seen corresponding path program 4 times [2019-12-27 07:35:15,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:35:15,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209112861] [2019-12-27 07:35:15,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:35:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:35:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:35:15,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:35:15,772 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:35:15,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_22| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1967~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1967~0.base_22|) |v_ULTIMATE.start_main_~#t1967~0.offset_16| 0)) |v_#memory_int_21|) (= 0 |v_ULTIMATE.start_main_~#t1967~0.offset_16|) (= v_~z$r_buff0_thd3~0_20 0) (= |v_#NULL.offset_3| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1967~0.base_22| 4)) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$r_buff1_thd2~0_16) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1967~0.base_22|) (= 0 v_~y~0_8) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_22|)) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$r_buff1_thd0~0_46) (= v_~z~0_29 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_~#t1967~0.offset=|v_ULTIMATE.start_main_~#t1967~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~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_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~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_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_20|, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_~#t1967~0.base=|v_ULTIMATE.start_main_~#t1967~0.base_22|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_28, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_15|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} 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-27 07:35:15,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] 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-27 07:35:15,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (= (mod v_~z$w_buff1_used~0_56 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_89 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_56)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} 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-27 07:35:15,779 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-27 07:35:15,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1839122569 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1839122569 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1839122569| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1839122569| ~z$w_buff0_used~0_In1839122569)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1839122569, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1839122569} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1839122569|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1839122569, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1839122569} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:35:15,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-2125064542 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2125064542 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2125064542 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-2125064542 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2125064542|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2125064542| ~z$w_buff1_used~0_In-2125064542) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125064542, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2125064542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125064542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2125064542} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2125064542|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125064542, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2125064542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125064542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2125064542} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:35:15,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2062782090 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-2062782090 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-2062782090) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-2062782090 ~z$r_buff0_thd1~0_Out-2062782090)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2062782090, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2062782090} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2062782090, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2062782090|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2062782090} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:35:15,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1044466083 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1044466083 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1044466083 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1044466083 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1044466083| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1044466083| ~z$r_buff1_thd1~0_In-1044466083)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1044466083, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1044466083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1044466083, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1044466083} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1044466083, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1044466083|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1044466083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1044466083, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1044466083} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:35:15,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L748-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} 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-27 07:35:15,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2142325399 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In2142325399 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out2142325399| ~z~0_In2142325399) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out2142325399| ~z$w_buff1~0_In2142325399)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2142325399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142325399, ~z$w_buff1~0=~z$w_buff1~0_In2142325399, ~z~0=~z~0_In2142325399} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2142325399|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2142325399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142325399, ~z$w_buff1~0=~z$w_buff1~0_In2142325399, ~z~0=~z~0_In2142325399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 07:35:15,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 07:35:15,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-91662603 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-91662603 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-91662603|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-91662603 |P1Thread1of1ForFork1_#t~ite11_Out-91662603|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-91662603, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-91662603} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-91662603, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-91662603|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-91662603} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:35:15,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1256563830 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1256563830 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1256563830| ~z~0_In1256563830)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1256563830| ~z$w_buff1~0_In1256563830) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1256563830, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1256563830, ~z$w_buff1~0=~z$w_buff1~0_In1256563830, ~z~0=~z~0_In1256563830} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1256563830|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1256563830, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1256563830, ~z$w_buff1~0=~z$w_buff1~0_In1256563830, ~z~0=~z~0_In1256563830} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:35:15,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1222242023 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1222242023 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1222242023 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1222242023 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1222242023 |P1Thread1of1ForFork1_#t~ite12_Out1222242023|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out1222242023| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1222242023, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1222242023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1222242023, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1222242023} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1222242023, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1222242023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1222242023, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1222242023|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1222242023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:35:15,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-856040228 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-856040228 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-856040228 |P1Thread1of1ForFork1_#t~ite13_Out-856040228|)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-856040228| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-856040228, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-856040228} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-856040228, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-856040228|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-856040228} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:35:15,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 07:35:15,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-306014163 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-306014163 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-306014163| ~z$w_buff0_used~0_In-306014163) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-306014163|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-306014163, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-306014163} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-306014163, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-306014163, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-306014163|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:35:15,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In900388080 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In900388080 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In900388080 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In900388080 256) 0))) (or (and (= ~z$w_buff1_used~0_In900388080 |P2Thread1of1ForFork2_#t~ite18_Out900388080|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out900388080|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In900388080, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900388080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900388080, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900388080} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In900388080, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900388080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900388080, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900388080, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out900388080|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:35:15,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1897921571 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1897921571 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out1897921571| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out1897921571| ~z$r_buff0_thd3~0_In1897921571)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1897921571, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1897921571} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1897921571, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1897921571, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1897921571|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:35:15,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In621547805 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In621547805 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In621547805 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In621547805 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out621547805| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In621547805 |P2Thread1of1ForFork2_#t~ite20_Out621547805|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In621547805, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In621547805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In621547805, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In621547805} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In621547805, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out621547805|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In621547805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In621547805, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In621547805} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:35:15,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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-27 07:35:15,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-328479300 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-328479300 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-328479300 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-328479300 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-328479300| ~z$r_buff1_thd2~0_In-328479300)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite14_Out-328479300| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-328479300, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-328479300, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-328479300, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-328479300} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-328479300, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-328479300, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-328479300, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-328479300|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-328479300} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:35:15,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_10 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, 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-27 07:35:15,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:35:15,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In60598353 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In60598353 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In60598353 |ULTIMATE.start_main_#t~ite24_Out60598353|) (not .cse1)) (and (= ~z~0_In60598353 |ULTIMATE.start_main_#t~ite24_Out60598353|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In60598353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60598353, ~z$w_buff1~0=~z$w_buff1~0_In60598353, ~z~0=~z~0_In60598353} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In60598353, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out60598353|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60598353, ~z$w_buff1~0=~z$w_buff1~0_In60598353, ~z~0=~z~0_In60598353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 07:35:15,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite24_7|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_6|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_6|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 07:35:15,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-496358353 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-496358353 256) 0))) (or (and (= ~z$w_buff0_used~0_In-496358353 |ULTIMATE.start_main_#t~ite26_Out-496358353|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-496358353|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-496358353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-496358353} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-496358353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-496358353, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-496358353|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:35:15,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2065238238 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2065238238 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2065238238 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2065238238 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out-2065238238| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out-2065238238| ~z$w_buff1_used~0_In-2065238238)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2065238238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2065238238, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2065238238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2065238238} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2065238238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2065238238, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2065238238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2065238238, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-2065238238|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:35:15,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1930461048 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1930461048 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out-1930461048| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-1930461048| ~z$r_buff0_thd0~0_In-1930461048)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1930461048, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1930461048} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1930461048, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1930461048|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1930461048} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:35:15,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In939996803 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In939996803 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In939996803 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In939996803 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out939996803| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In939996803 |ULTIMATE.start_main_#t~ite29_Out939996803|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In939996803, ~z$w_buff0_used~0=~z$w_buff0_used~0_In939996803, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In939996803, ~z$w_buff1_used~0=~z$w_buff1_used~0_In939996803} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In939996803, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out939996803|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In939996803, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In939996803, ~z$w_buff1_used~0=~z$w_buff1_used~0_In939996803} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:35:15,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_27} 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-27 07:35:15,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L836-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_8 256)) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, 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-27 07:35:15,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] 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-27 07:35:15,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:35:15 BasicIcfg [2019-12-27 07:35:15,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:35:15,910 INFO L168 Benchmark]: Toolchain (without parser) took 116358.03 ms. Allocated memory was 143.7 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 07:35:15,911 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:35:15,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.93 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 154.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:15,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.00 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:15,915 INFO L168 Benchmark]: Boogie Preprocessor took 39.23 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 148.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:15,915 INFO L168 Benchmark]: RCFGBuilder took 986.22 ms. Allocated memory is still 201.3 MB. Free memory was 148.6 MB in the beginning and 98.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:35:15,916 INFO L168 Benchmark]: TraceAbstraction took 114426.79 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 97.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 07:35:15,920 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.93 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 154.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.00 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.23 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 148.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 986.22 ms. Allocated memory is still 201.3 MB. Free memory was 148.6 MB in the beginning and 98.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114426.79 ms. Allocated memory was 201.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 97.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 98 ProgramPointsAfterwards, 212 TransitionsBefore, 111 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 5348 VarBasedMoverChecksPositive, 177 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84694 CheckedPairsTotal, 109 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: 114.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3515 SDtfs, 3824 SDslu, 9857 SDs, 0 SdLazy, 5571 SolverSat, 281 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 49 SyntacticMatches, 22 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221154occurred 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: 53.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 100027 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1111 NumberOfCodeBlocks, 1111 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1022 ConstructedInterpolants, 0 QuantifiedInterpolants, 235437 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...