/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:41:24,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:41:24,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:41:24,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:41:24,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:41:24,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:41:24,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:41:24,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:41:24,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:41:24,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:41:24,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:41:24,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:41:24,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:41:24,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:41:24,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:41:24,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:41:24,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:41:24,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:41:24,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:41:24,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:41:24,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:41:24,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:41:24,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:41:24,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:41:24,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:41:24,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:41:24,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:41:24,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:41:24,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:41:24,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:41:24,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:41:24,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:41:24,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:41:24,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:41:24,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:41:24,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:41:24,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:41:24,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:41:24,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:41:24,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:41:24,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:41:24,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:41:24,334 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:41:24,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:41:24,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:41:24,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:41:24,335 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:41:24,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:41:24,336 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:41:24,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:41:24,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:41:24,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:41:24,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:41:24,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:41:24,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:41:24,337 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:41:24,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:41:24,338 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:41:24,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:41:24,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:41:24,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:41:24,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:41:24,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:41:24,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:41:24,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:41:24,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:41:24,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:41:24,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:41:24,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:41:24,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:41:24,340 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:41:24,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:41:24,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:41:24,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:41:24,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:41:24,618 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:41:24,618 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:41:24,619 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2019-12-26 23:41:24,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a647c3a3/9357ef3364c048909365243fcc5b99bd/FLAG86d891b44 [2019-12-26 23:41:25,298 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:41:25,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2019-12-26 23:41:25,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a647c3a3/9357ef3364c048909365243fcc5b99bd/FLAG86d891b44 [2019-12-26 23:41:25,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a647c3a3/9357ef3364c048909365243fcc5b99bd [2019-12-26 23:41:25,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:41:25,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:41:25,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:25,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:41:25,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:41:25,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:25" (1/1) ... [2019-12-26 23:41:25,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc34d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:25, skipping insertion in model container [2019-12-26 23:41:25,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:25" (1/1) ... [2019-12-26 23:41:25,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:41:25,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:41:26,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:41:26,238 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:41:26,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:41:26,380 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:41:26,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26 WrapperNode [2019-12-26 23:41:26,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:26,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:41:26,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:41:26,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:41:26,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:41:26,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:41:26,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:41:26,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:41:26,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... [2019-12-26 23:41:26,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:41:26,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:41:26,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:41:26,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:41:26,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:41:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:41:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:41:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:41:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:41:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:41:26,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:41:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:41:26,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:41:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:41:26,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:41:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:41:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:41:26,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:41:26,579 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:41:27,338 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:41:27,339 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:41:27,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:41:27 BoogieIcfgContainer [2019-12-26 23:41:27,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:41:27,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:41:27,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:41:27,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:41:27,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:41:25" (1/3) ... [2019-12-26 23:41:27,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff23f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:41:27, skipping insertion in model container [2019-12-26 23:41:27,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:26" (2/3) ... [2019-12-26 23:41:27,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff23f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:41:27, skipping insertion in model container [2019-12-26 23:41:27,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:41:27" (3/3) ... [2019-12-26 23:41:27,352 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2019-12-26 23:41:27,363 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:41:27,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:41:27,374 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:41:27,375 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:41:27,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,439 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,439 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,446 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,447 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,479 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,479 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,483 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,486 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,486 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:27,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:41:27,523 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:41:27,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:41:27,523 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:41:27,524 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:41:27,524 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:41:27,524 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:41:27,524 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:41:27,524 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:41:27,541 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:41:27,542 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:41:27,645 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:41:27,646 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:41:27,664 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:41:27,687 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:41:27,740 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:41:27,740 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:41:27,749 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:41:27,769 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-26 23:41:27,770 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:41:33,017 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:41:33,130 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:41:33,158 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-26 23:41:33,158 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:41:33,162 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-26 23:41:49,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-26 23:41:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-26 23:41:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:41:49,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:49,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:41:49,064 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-26 23:41:49,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:49,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497451340] [2019-12-26 23:41:49,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:49,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497451340] [2019-12-26 23:41:49,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:49,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:41:49,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853510167] [2019-12-26 23:41:49,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:49,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:49,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:49,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:49,344 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-26 23:41:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:52,860 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-26 23:41:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:52,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:41:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:53,737 INFO L225 Difference]: With dead ends: 104560 [2019-12-26 23:41:53,738 INFO L226 Difference]: Without dead ends: 102376 [2019-12-26 23:41:53,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-26 23:41:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-26 23:41:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-26 23:42:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-26 23:42:04,320 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-26 23:42:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:04,321 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-26 23:42:04,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-26 23:42:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:42:04,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:04,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:04,326 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-26 23:42:04,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:04,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177392399] [2019-12-26 23:42:04,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:04,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177392399] [2019-12-26 23:42:04,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:04,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:04,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278412003] [2019-12-26 23:42:04,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:04,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:04,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:04,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:04,443 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-26 23:42:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:09,489 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-26 23:42:09,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:09,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:42:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:10,079 INFO L225 Difference]: With dead ends: 164490 [2019-12-26 23:42:10,079 INFO L226 Difference]: Without dead ends: 164441 [2019-12-26 23:42:10,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-26 23:42:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-26 23:42:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-26 23:42:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-26 23:42:17,724 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-26 23:42:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:17,724 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-26 23:42:17,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-26 23:42:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:42:17,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:17,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:17,732 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:17,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-26 23:42:17,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:17,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833066739] [2019-12-26 23:42:17,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:17,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833066739] [2019-12-26 23:42:17,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:17,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:17,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898700402] [2019-12-26 23:42:17,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:17,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:17,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:17,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:17,843 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-26 23:42:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:24,122 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-26 23:42:24,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:24,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:42:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:24,717 INFO L225 Difference]: With dead ends: 211896 [2019-12-26 23:42:24,717 INFO L226 Difference]: Without dead ends: 211833 [2019-12-26 23:42:24,718 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-26 23:42:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-26 23:42:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-26 23:42:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-26 23:42:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-26 23:42:42,675 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-26 23:42:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:42,676 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-26 23:42:42,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-26 23:42:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:42:42,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:42,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:42,679 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:42,680 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-26 23:42:42,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:42,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855892501] [2019-12-26 23:42:42,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:42,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855892501] [2019-12-26 23:42:42,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:42,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:42,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920410401] [2019-12-26 23:42:42,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:42,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:42,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:42,730 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-26 23:42:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:42,871 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-26 23:42:42,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:42,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:42:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:42,940 INFO L225 Difference]: With dead ends: 36088 [2019-12-26 23:42:42,940 INFO L226 Difference]: Without dead ends: 36088 [2019-12-26 23:42:42,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-26 23:42:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-26 23:42:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-26 23:42:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-26 23:42:45,083 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-26 23:42:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:45,084 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-26 23:42:45,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-26 23:42:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:42:45,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:45,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:45,088 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-26 23:42:45,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:45,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986201264] [2019-12-26 23:42:45,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:45,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986201264] [2019-12-26 23:42:45,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:45,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:45,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571969495] [2019-12-26 23:42:45,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:45,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:45,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:45,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:45,188 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 5 states. [2019-12-26 23:42:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:45,930 INFO L93 Difference]: Finished difference Result 49088 states and 156546 transitions. [2019-12-26 23:42:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:42:45,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:42:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:46,007 INFO L225 Difference]: With dead ends: 49088 [2019-12-26 23:42:46,007 INFO L226 Difference]: Without dead ends: 49075 [2019-12-26 23:42:46,008 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-26 23:42:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49075 states. [2019-12-26 23:42:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49075 to 36431. [2019-12-26 23:42:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-26 23:42:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-26 23:42:46,727 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-26 23:42:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:46,727 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-26 23:42:46,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-26 23:42:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:42:46,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:46,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:46,741 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:46,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-26 23:42:46,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:46,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964963907] [2019-12-26 23:42:46,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:46,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964963907] [2019-12-26 23:42:46,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:46,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:46,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709652567] [2019-12-26 23:42:46,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:46,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:46,811 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-26 23:42:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:48,784 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-26 23:42:48,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:42:48,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:42:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:48,794 INFO L225 Difference]: With dead ends: 7050 [2019-12-26 23:42:48,795 INFO L226 Difference]: Without dead ends: 7050 [2019-12-26 23:42:48,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-26 23:42:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-26 23:42:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-26 23:42:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-26 23:42:48,902 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-26 23:42:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:48,903 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-26 23:42:48,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-26 23:42:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:42:48,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:48,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:48,914 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:48,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-26 23:42:48,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:48,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804227067] [2019-12-26 23:42:48,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:49,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804227067] [2019-12-26 23:42:49,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:49,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:42:49,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651307465] [2019-12-26 23:42:49,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:49,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:49,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:49,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:49,037 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-26 23:42:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:49,079 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-26 23:42:49,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:49,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:42:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:49,087 INFO L225 Difference]: With dead ends: 5023 [2019-12-26 23:42:49,087 INFO L226 Difference]: Without dead ends: 5023 [2019-12-26 23:42:49,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-26 23:42:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-26 23:42:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-26 23:42:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-26 23:42:49,207 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-26 23:42:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:49,208 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-26 23:42:49,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-26 23:42:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:49,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:49,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:49,224 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-26 23:42:49,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:49,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559819704] [2019-12-26 23:42:49,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:49,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559819704] [2019-12-26 23:42:49,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:49,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:49,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041045478] [2019-12-26 23:42:49,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:49,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:49,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:49,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:49,361 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-26 23:42:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:49,421 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-26 23:42:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:49,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:42:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:49,432 INFO L225 Difference]: With dead ends: 4668 [2019-12-26 23:42:49,432 INFO L226 Difference]: Without dead ends: 4668 [2019-12-26 23:42:49,433 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-26 23:42:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-26 23:42:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-26 23:42:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-26 23:42:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-26 23:42:49,524 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-26 23:42:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:49,526 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-26 23:42:49,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-26 23:42:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:49,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:49,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:49,536 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-26 23:42:49,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:49,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983626184] [2019-12-26 23:42:49,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:49,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983626184] [2019-12-26 23:42:49,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:49,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:49,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821649430] [2019-12-26 23:42:49,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:49,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:49,626 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-26 23:42:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:49,673 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-26 23:42:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:49,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:42:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:49,680 INFO L225 Difference]: With dead ends: 4668 [2019-12-26 23:42:49,680 INFO L226 Difference]: Without dead ends: 4668 [2019-12-26 23:42:49,681 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-26 23:42:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-26 23:42:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-26 23:42:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-26 23:42:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-26 23:42:49,738 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-26 23:42:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:49,739 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-26 23:42:49,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-26 23:42:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:49,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:49,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:49,745 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-26 23:42:49,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:49,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473287245] [2019-12-26 23:42:49,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:49,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473287245] [2019-12-26 23:42:49,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:49,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:49,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147161857] [2019-12-26 23:42:49,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:49,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:49,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:49,863 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 5 states. [2019-12-26 23:42:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:50,190 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-26 23:42:50,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:42:50,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:42:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:50,202 INFO L225 Difference]: With dead ends: 7088 [2019-12-26 23:42:50,202 INFO L226 Difference]: Without dead ends: 7088 [2019-12-26 23:42:50,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:42:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-26 23:42:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-26 23:42:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-26 23:42:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-26 23:42:50,307 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-26 23:42:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:50,307 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-26 23:42:50,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-26 23:42:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:50,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:50,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:50,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:50,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:50,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-26 23:42:50,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:50,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676530416] [2019-12-26 23:42:50,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:50,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676530416] [2019-12-26 23:42:50,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:50,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:50,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524117873] [2019-12-26 23:42:50,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:50,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:50,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:50,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:50,420 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 5 states. [2019-12-26 23:42:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:50,743 INFO L93 Difference]: Finished difference Result 9067 states and 25836 transitions. [2019-12-26 23:42:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:42:50,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:42:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:50,755 INFO L225 Difference]: With dead ends: 9067 [2019-12-26 23:42:50,756 INFO L226 Difference]: Without dead ends: 9067 [2019-12-26 23:42:50,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-26 23:42:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6731. [2019-12-26 23:42:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-12-26 23:42:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 19498 transitions. [2019-12-26 23:42:50,854 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 19498 transitions. Word has length 65 [2019-12-26 23:42:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:50,854 INFO L462 AbstractCegarLoop]: Abstraction has 6731 states and 19498 transitions. [2019-12-26 23:42:50,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 19498 transitions. [2019-12-26 23:42:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:50,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:50,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:50,864 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1650424373, now seen corresponding path program 3 times [2019-12-26 23:42:50,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:50,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134016893] [2019-12-26 23:42:50,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:50,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134016893] [2019-12-26 23:42:51,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:51,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:42:51,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705737166] [2019-12-26 23:42:51,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:42:51,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:51,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:42:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:42:51,002 INFO L87 Difference]: Start difference. First operand 6731 states and 19498 transitions. Second operand 6 states. [2019-12-26 23:42:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:51,501 INFO L93 Difference]: Finished difference Result 10883 states and 31287 transitions. [2019-12-26 23:42:51,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:42:51,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:42:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:51,515 INFO L225 Difference]: With dead ends: 10883 [2019-12-26 23:42:51,516 INFO L226 Difference]: Without dead ends: 10883 [2019-12-26 23:42:51,516 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-26 23:42:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-26 23:42:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7254. [2019-12-26 23:42:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-12-26 23:42:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 21077 transitions. [2019-12-26 23:42:51,628 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 21077 transitions. Word has length 65 [2019-12-26 23:42:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:51,628 INFO L462 AbstractCegarLoop]: Abstraction has 7254 states and 21077 transitions. [2019-12-26 23:42:51,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:42:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 21077 transitions. [2019-12-26 23:42:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:51,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:51,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:51,638 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2063456247, now seen corresponding path program 4 times [2019-12-26 23:42:51,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:51,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640092336] [2019-12-26 23:42:51,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:51,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640092336] [2019-12-26 23:42:51,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:51,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:42:51,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113477362] [2019-12-26 23:42:51,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:51,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:51,754 INFO L87 Difference]: Start difference. First operand 7254 states and 21077 transitions. Second operand 7 states. [2019-12-26 23:42:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:52,630 INFO L93 Difference]: Finished difference Result 11106 states and 31910 transitions. [2019-12-26 23:42:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:42:52,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:52,645 INFO L225 Difference]: With dead ends: 11106 [2019-12-26 23:42:52,645 INFO L226 Difference]: Without dead ends: 11106 [2019-12-26 23:42:52,646 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-26 23:42:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11106 states. [2019-12-26 23:42:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11106 to 6997. [2019-12-26 23:42:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6997 states. [2019-12-26 23:42:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 20313 transitions. [2019-12-26 23:42:52,781 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 20313 transitions. Word has length 65 [2019-12-26 23:42:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:52,781 INFO L462 AbstractCegarLoop]: Abstraction has 6997 states and 20313 transitions. [2019-12-26 23:42:52,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 20313 transitions. [2019-12-26 23:42:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:52,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:52,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:52,792 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash 695487673, now seen corresponding path program 5 times [2019-12-26 23:42:52,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:52,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357367127] [2019-12-26 23:42:52,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:52,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357367127] [2019-12-26 23:42:52,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:52,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:52,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248848466] [2019-12-26 23:42:52,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:52,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:52,921 INFO L87 Difference]: Start difference. First operand 6997 states and 20313 transitions. Second operand 7 states. [2019-12-26 23:42:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:53,037 INFO L93 Difference]: Finished difference Result 14297 states and 41924 transitions. [2019-12-26 23:42:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:42:53,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:53,051 INFO L225 Difference]: With dead ends: 14297 [2019-12-26 23:42:53,051 INFO L226 Difference]: Without dead ends: 8841 [2019-12-26 23:42:53,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:42:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2019-12-26 23:42:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 6579. [2019-12-26 23:42:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-26 23:42:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 19079 transitions. [2019-12-26 23:42:53,162 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 19079 transitions. Word has length 65 [2019-12-26 23:42:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:53,162 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 19079 transitions. [2019-12-26 23:42:53,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 19079 transitions. [2019-12-26 23:42:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:53,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:53,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:53,172 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1304907827, now seen corresponding path program 6 times [2019-12-26 23:42:53,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:53,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559416700] [2019-12-26 23:42:53,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:53,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559416700] [2019-12-26 23:42:53,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:53,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:42:53,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695059478] [2019-12-26 23:42:53,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:42:53,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:42:53,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:42:53,273 INFO L87 Difference]: Start difference. First operand 6579 states and 19079 transitions. Second operand 6 states. [2019-12-26 23:42:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:53,810 INFO L93 Difference]: Finished difference Result 9537 states and 27106 transitions. [2019-12-26 23:42:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:42:53,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:42:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:53,822 INFO L225 Difference]: With dead ends: 9537 [2019-12-26 23:42:53,822 INFO L226 Difference]: Without dead ends: 9537 [2019-12-26 23:42:53,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:42:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-26 23:42:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 6860. [2019-12-26 23:42:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6860 states. [2019-12-26 23:42:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 19878 transitions. [2019-12-26 23:42:53,928 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 19878 transitions. Word has length 65 [2019-12-26 23:42:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:53,928 INFO L462 AbstractCegarLoop]: Abstraction has 6860 states and 19878 transitions. [2019-12-26 23:42:53,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:42:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 19878 transitions. [2019-12-26 23:42:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:53,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:53,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:53,937 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -338304105, now seen corresponding path program 7 times [2019-12-26 23:42:53,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:53,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998771780] [2019-12-26 23:42:53,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:54,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998771780] [2019-12-26 23:42:54,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:54,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:42:54,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383150807] [2019-12-26 23:42:54,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:54,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:54,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:54,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:54,054 INFO L87 Difference]: Start difference. First operand 6860 states and 19878 transitions. Second operand 7 states. [2019-12-26 23:42:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:55,086 INFO L93 Difference]: Finished difference Result 10605 states and 30155 transitions. [2019-12-26 23:42:55,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:42:55,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:55,100 INFO L225 Difference]: With dead ends: 10605 [2019-12-26 23:42:55,100 INFO L226 Difference]: Without dead ends: 10605 [2019-12-26 23:42:55,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:42:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10605 states. [2019-12-26 23:42:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10605 to 7315. [2019-12-26 23:42:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2019-12-26 23:42:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 21208 transitions. [2019-12-26 23:42:55,225 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 21208 transitions. Word has length 65 [2019-12-26 23:42:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:55,225 INFO L462 AbstractCegarLoop]: Abstraction has 7315 states and 21208 transitions. [2019-12-26 23:42:55,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 21208 transitions. [2019-12-26 23:42:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:55,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:55,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:55,234 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash 882387211, now seen corresponding path program 8 times [2019-12-26 23:42:55,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:55,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903097215] [2019-12-26 23:42:55,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:55,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-26 23:42:55,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903097215] [2019-12-26 23:42:55,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:55,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:42:55,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412013467] [2019-12-26 23:42:55,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:55,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:55,354 INFO L87 Difference]: Start difference. First operand 7315 states and 21208 transitions. Second operand 7 states. [2019-12-26 23:42:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:56,205 INFO L93 Difference]: Finished difference Result 11968 states and 34206 transitions. [2019-12-26 23:42:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:42:56,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:56,221 INFO L225 Difference]: With dead ends: 11968 [2019-12-26 23:42:56,221 INFO L226 Difference]: Without dead ends: 11968 [2019-12-26 23:42:56,221 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-26 23:42:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11968 states. [2019-12-26 23:42:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11968 to 6995. [2019-12-26 23:42:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2019-12-26 23:42:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 20314 transitions. [2019-12-26 23:42:56,337 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 20314 transitions. Word has length 65 [2019-12-26 23:42:56,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:56,338 INFO L462 AbstractCegarLoop]: Abstraction has 6995 states and 20314 transitions. [2019-12-26 23:42:56,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 20314 transitions. [2019-12-26 23:42:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:56,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:56,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:56,344 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash -466619985, now seen corresponding path program 9 times [2019-12-26 23:42:56,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:56,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040991345] [2019-12-26 23:42:56,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:56,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040991345] [2019-12-26 23:42:56,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:56,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:42:56,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848988424] [2019-12-26 23:42:56,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:42:56,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:42:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:42:56,459 INFO L87 Difference]: Start difference. First operand 6995 states and 20314 transitions. Second operand 8 states. [2019-12-26 23:42:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:57,582 INFO L93 Difference]: Finished difference Result 11870 states and 33943 transitions. [2019-12-26 23:42:57,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:42:57,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 23:42:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:57,600 INFO L225 Difference]: With dead ends: 11870 [2019-12-26 23:42:57,601 INFO L226 Difference]: Without dead ends: 11870 [2019-12-26 23:42:57,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:42:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2019-12-26 23:42:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6757. [2019-12-26 23:42:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-12-26 23:42:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 19602 transitions. [2019-12-26 23:42:57,818 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 19602 transitions. Word has length 65 [2019-12-26 23:42:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:57,818 INFO L462 AbstractCegarLoop]: Abstraction has 6757 states and 19602 transitions. [2019-12-26 23:42:57,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:42:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 19602 transitions. [2019-12-26 23:42:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:57,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:57,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:57,832 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:57,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:57,832 INFO L82 PathProgramCache]: Analyzing trace with hash 794564457, now seen corresponding path program 10 times [2019-12-26 23:42:57,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:57,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907051240] [2019-12-26 23:42:57,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:57,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907051240] [2019-12-26 23:42:57,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:57,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:42:57,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902691714] [2019-12-26 23:42:57,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:57,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:57,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:57,975 INFO L87 Difference]: Start difference. First operand 6757 states and 19602 transitions. Second operand 7 states. [2019-12-26 23:42:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:58,627 INFO L93 Difference]: Finished difference Result 11247 states and 32123 transitions. [2019-12-26 23:42:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:42:58,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 23:42:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:58,642 INFO L225 Difference]: With dead ends: 11247 [2019-12-26 23:42:58,643 INFO L226 Difference]: Without dead ends: 11247 [2019-12-26 23:42:58,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:42:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11247 states. [2019-12-26 23:42:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11247 to 6841. [2019-12-26 23:42:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-12-26 23:42:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 19803 transitions. [2019-12-26 23:42:58,765 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 19803 transitions. Word has length 65 [2019-12-26 23:42:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:58,765 INFO L462 AbstractCegarLoop]: Abstraction has 6841 states and 19803 transitions. [2019-12-26 23:42:58,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 19803 transitions. [2019-12-26 23:42:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:58,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:58,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:58,773 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1278916147, now seen corresponding path program 11 times [2019-12-26 23:42:58,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:58,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907104487] [2019-12-26 23:42:58,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:58,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907104487] [2019-12-26 23:42:58,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:58,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:58,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871020855] [2019-12-26 23:42:58,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:58,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:58,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:58,838 INFO L87 Difference]: Start difference. First operand 6841 states and 19803 transitions. Second operand 3 states. [2019-12-26 23:42:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:58,893 INFO L93 Difference]: Finished difference Result 6841 states and 19802 transitions. [2019-12-26 23:42:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:58,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:42:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:58,904 INFO L225 Difference]: With dead ends: 6841 [2019-12-26 23:42:58,904 INFO L226 Difference]: Without dead ends: 6841 [2019-12-26 23:42:58,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6841 states. [2019-12-26 23:42:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6841 to 4065. [2019-12-26 23:42:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4065 states. [2019-12-26 23:42:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4065 states to 4065 states and 12040 transitions. [2019-12-26 23:42:58,979 INFO L78 Accepts]: Start accepts. Automaton has 4065 states and 12040 transitions. Word has length 65 [2019-12-26 23:42:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:58,980 INFO L462 AbstractCegarLoop]: Abstraction has 4065 states and 12040 transitions. [2019-12-26 23:42:58,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 12040 transitions. [2019-12-26 23:42:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:42:58,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:58,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:58,984 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:58,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash 662541241, now seen corresponding path program 1 times [2019-12-26 23:42:58,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:58,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123137910] [2019-12-26 23:42:58,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:59,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123137910] [2019-12-26 23:42:59,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:59,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:59,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969679751] [2019-12-26 23:42:59,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:59,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:59,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:59,037 INFO L87 Difference]: Start difference. First operand 4065 states and 12040 transitions. Second operand 3 states. [2019-12-26 23:42:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:59,064 INFO L93 Difference]: Finished difference Result 3829 states and 11067 transitions. [2019-12-26 23:42:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:59,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:42:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:59,071 INFO L225 Difference]: With dead ends: 3829 [2019-12-26 23:42:59,071 INFO L226 Difference]: Without dead ends: 3829 [2019-12-26 23:42:59,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2019-12-26 23:42:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3113. [2019-12-26 23:42:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2019-12-26 23:42:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 9035 transitions. [2019-12-26 23:42:59,144 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 9035 transitions. Word has length 66 [2019-12-26 23:42:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:59,144 INFO L462 AbstractCegarLoop]: Abstraction has 3113 states and 9035 transitions. [2019-12-26 23:42:59,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 9035 transitions. [2019-12-26 23:42:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:42:59,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:59,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:59,150 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:59,150 INFO L82 PathProgramCache]: Analyzing trace with hash 728190721, now seen corresponding path program 1 times [2019-12-26 23:42:59,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:59,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622090941] [2019-12-26 23:42:59,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:59,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622090941] [2019-12-26 23:42:59,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:59,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:59,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286405128] [2019-12-26 23:42:59,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:59,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:59,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:59,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:59,221 INFO L87 Difference]: Start difference. First operand 3113 states and 9035 transitions. Second operand 3 states. [2019-12-26 23:42:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:59,242 INFO L93 Difference]: Finished difference Result 3049 states and 8575 transitions. [2019-12-26 23:42:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:59,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:42:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:59,247 INFO L225 Difference]: With dead ends: 3049 [2019-12-26 23:42:59,247 INFO L226 Difference]: Without dead ends: 3049 [2019-12-26 23:42:59,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2019-12-26 23:42:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2815. [2019-12-26 23:42:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2019-12-26 23:42:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 7936 transitions. [2019-12-26 23:42:59,312 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 7936 transitions. Word has length 67 [2019-12-26 23:42:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:59,312 INFO L462 AbstractCegarLoop]: Abstraction has 2815 states and 7936 transitions. [2019-12-26 23:42:59,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 7936 transitions. [2019-12-26 23:42:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:42:59,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:59,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:59,317 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 1 times [2019-12-26 23:42:59,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:59,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798889358] [2019-12-26 23:42:59,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:59,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798889358] [2019-12-26 23:42:59,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:59,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:42:59,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007849887] [2019-12-26 23:42:59,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:42:59,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:42:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:42:59,760 INFO L87 Difference]: Start difference. First operand 2815 states and 7936 transitions. Second operand 17 states. [2019-12-26 23:43:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:01,248 INFO L93 Difference]: Finished difference Result 5746 states and 16019 transitions. [2019-12-26 23:43:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-26 23:43:01,249 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-26 23:43:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:01,257 INFO L225 Difference]: With dead ends: 5746 [2019-12-26 23:43:01,258 INFO L226 Difference]: Without dead ends: 5716 [2019-12-26 23:43:01,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 23:43:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-12-26 23:43:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 4139. [2019-12-26 23:43:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4139 states. [2019-12-26 23:43:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 11571 transitions. [2019-12-26 23:43:01,338 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 11571 transitions. Word has length 68 [2019-12-26 23:43:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:01,339 INFO L462 AbstractCegarLoop]: Abstraction has 4139 states and 11571 transitions. [2019-12-26 23:43:01,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:43:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 11571 transitions. [2019-12-26 23:43:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:01,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:01,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:01,343 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash 226058755, now seen corresponding path program 2 times [2019-12-26 23:43:01,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:01,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653129162] [2019-12-26 23:43:01,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:01,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653129162] [2019-12-26 23:43:01,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:01,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:43:01,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418445451] [2019-12-26 23:43:01,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:43:01,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:01,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:43:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:43:01,557 INFO L87 Difference]: Start difference. First operand 4139 states and 11571 transitions. Second operand 13 states. [2019-12-26 23:43:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:02,103 INFO L93 Difference]: Finished difference Result 7013 states and 19680 transitions. [2019-12-26 23:43:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:43:02,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-26 23:43:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:02,119 INFO L225 Difference]: With dead ends: 7013 [2019-12-26 23:43:02,119 INFO L226 Difference]: Without dead ends: 6983 [2019-12-26 23:43:02,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:43:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6983 states. [2019-12-26 23:43:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6983 to 4466. [2019-12-26 23:43:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2019-12-26 23:43:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 12510 transitions. [2019-12-26 23:43:02,271 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 12510 transitions. Word has length 68 [2019-12-26 23:43:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:02,272 INFO L462 AbstractCegarLoop]: Abstraction has 4466 states and 12510 transitions. [2019-12-26 23:43:02,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:43:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 12510 transitions. [2019-12-26 23:43:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:02,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:02,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:02,279 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:02,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1101405001, now seen corresponding path program 3 times [2019-12-26 23:43:02,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:02,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636181836] [2019-12-26 23:43:02,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:02,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636181836] [2019-12-26 23:43:02,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:02,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:43:02,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101266110] [2019-12-26 23:43:02,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:43:02,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:43:02,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:43:02,690 INFO L87 Difference]: Start difference. First operand 4466 states and 12510 transitions. Second operand 16 states. [2019-12-26 23:43:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:03,699 INFO L93 Difference]: Finished difference Result 5491 states and 15200 transitions. [2019-12-26 23:43:03,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 23:43:03,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-26 23:43:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:03,707 INFO L225 Difference]: With dead ends: 5491 [2019-12-26 23:43:03,707 INFO L226 Difference]: Without dead ends: 5461 [2019-12-26 23:43:03,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 23:43:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2019-12-26 23:43:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 4067. [2019-12-26 23:43:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-12-26 23:43:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 11322 transitions. [2019-12-26 23:43:03,769 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 11322 transitions. Word has length 68 [2019-12-26 23:43:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:03,770 INFO L462 AbstractCegarLoop]: Abstraction has 4067 states and 11322 transitions. [2019-12-26 23:43:03,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:43:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 11322 transitions. [2019-12-26 23:43:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:43:03,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:03,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:03,774 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 4 times [2019-12-26 23:43:03,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:03,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689849070] [2019-12-26 23:43:03,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:43:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:43:03,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:43:03,896 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:43:03,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2031~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2031~0.base_21|) |v_ULTIMATE.start_main_~#t2031~0.offset_17| 0)) |v_#memory_int_21|) (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$r_buff1_thd0~0_308 0) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2031~0.base_21|) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t2031~0.offset_17| 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= v_~main$tmp_guard0~0_21 0) (= v_~weak$$choice2~0_109 0) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= (select .cse0 |v_ULTIMATE.start_main_~#t2031~0.base_21|) 0) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2031~0.base_21| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t2031~0.base_21| 1) |v_#valid_53|) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_~#t2032~0.base=|v_ULTIMATE.start_main_~#t2032~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ULTIMATE.start_main_~#t2031~0.offset=|v_ULTIMATE.start_main_~#t2031~0.offset_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_~#t2033~0.base=|v_ULTIMATE.start_main_~#t2033~0.base_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~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_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_138, ULTIMATE.start_main_~#t2033~0.offset=|v_ULTIMATE.start_main_~#t2033~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~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_25|, ULTIMATE.start_main_~#t2032~0.offset=|v_ULTIMATE.start_main_~#t2032~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_~#t2031~0.base=|v_ULTIMATE.start_main_~#t2031~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2032~0.base, ~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, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2031~0.offset, ~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_~#t2033~0.base, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2033~0.offset, 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_~#t2032~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~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_~#t2031~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:43:03,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2032~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2032~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2032~0.base_12|) |v_ULTIMATE.start_main_~#t2032~0.offset_11| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2032~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2032~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t2032~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t2032~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2032~0.base=|v_ULTIMATE.start_main_~#t2032~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2032~0.offset=|v_ULTIMATE.start_main_~#t2032~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2032~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2032~0.offset] because there is no mapped edge [2019-12-26 23:43:03,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 23:43:03,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2033~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2033~0.base_9|) |v_ULTIMATE.start_main_~#t2033~0.offset_8| 2))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2033~0.base_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2033~0.base_9|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2033~0.base_9| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2033~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2033~0.base_9|)) (= |v_ULTIMATE.start_main_~#t2033~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2033~0.base=|v_ULTIMATE.start_main_~#t2033~0.base_9|, ULTIMATE.start_main_~#t2033~0.offset=|v_ULTIMATE.start_main_~#t2033~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2033~0.base, ULTIMATE.start_main_~#t2033~0.offset] because there is no mapped edge [2019-12-26 23:43:03,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1593146 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1593146 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1593146|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1593146| ~z$w_buff0_used~0_In1593146)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1593146, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1593146} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1593146|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1593146, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1593146} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:43:03,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In187793596 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In187793596 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In187793596 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In187793596 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out187793596|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In187793596 |P0Thread1of1ForFork0_#t~ite6_Out187793596|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In187793596, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In187793596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In187793596, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In187793596} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out187793596|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In187793596, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In187793596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In187793596, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In187793596} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:43:03,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In772198849 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In772198849 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In772198849 ~z$r_buff0_thd1~0_Out772198849) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out772198849) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In772198849, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In772198849} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In772198849, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out772198849|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out772198849} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:43:03,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In69889251 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In69889251 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In69889251 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In69889251 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In69889251 |P0Thread1of1ForFork0_#t~ite8_Out69889251|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out69889251|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In69889251, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In69889251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69889251, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In69889251} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In69889251, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out69889251|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In69889251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In69889251, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In69889251} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:43:03,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:43:03,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1138674683 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1138674683 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1138674683| |P1Thread1of1ForFork1_#t~ite10_Out-1138674683|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-1138674683| ~z$w_buff1~0_In-1138674683)) (and (or .cse0 .cse2) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1138674683| ~z~0_In-1138674683)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1138674683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138674683, ~z$w_buff1~0=~z$w_buff1~0_In-1138674683, ~z~0=~z~0_In-1138674683} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1138674683|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1138674683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138674683, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1138674683|, ~z$w_buff1~0=~z$w_buff1~0_In-1138674683, ~z~0=~z~0_In-1138674683} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-26 23:43:03,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-2280952 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2280952 256) 0))) (or (and (= ~z~0_In-2280952 |P2Thread1of1ForFork2_#t~ite15_Out-2280952|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-2280952 |P2Thread1of1ForFork2_#t~ite15_Out-2280952|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2280952, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2280952, ~z$w_buff1~0=~z$w_buff1~0_In-2280952, ~z~0=~z~0_In-2280952} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-2280952|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2280952, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2280952, ~z$w_buff1~0=~z$w_buff1~0_In-2280952, ~z~0=~z~0_In-2280952} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:43:03,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-26 23:43:03,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1245734101 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1245734101 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1245734101| ~z$w_buff0_used~0_In1245734101)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1245734101|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1245734101, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1245734101} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1245734101, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1245734101, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1245734101|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:43:03,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1812082760 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1812082760 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1812082760 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1812082760 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1812082760 |P2Thread1of1ForFork2_#t~ite18_Out1812082760|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1812082760|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1812082760, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1812082760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1812082760, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1812082760} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1812082760, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1812082760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1812082760, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1812082760, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1812082760|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:43:03,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1474994344 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1474994344 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1474994344| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1474994344| ~z$r_buff0_thd3~0_In1474994344)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1474994344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1474994344} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1474994344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1474994344, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1474994344|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:43:03,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-233450259 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-233450259 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-233450259 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-233450259 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out-233450259| 0)) (and (= ~z$r_buff1_thd3~0_In-233450259 |P2Thread1of1ForFork2_#t~ite20_Out-233450259|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-233450259, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-233450259, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-233450259, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-233450259} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-233450259, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-233450259|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-233450259, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-233450259, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-233450259} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:43:03,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:43:03,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-434310779 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-434310779 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-434310779| ~z$w_buff0_used~0_In-434310779) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-434310779| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-434310779, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-434310779} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-434310779, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-434310779|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-434310779} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:43:03,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-806112104 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-806112104 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-806112104 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-806112104 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-806112104| ~z$w_buff1_used~0_In-806112104) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-806112104| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-806112104, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-806112104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-806112104, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-806112104} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-806112104, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-806112104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-806112104, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-806112104|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-806112104} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:43:03,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1421194313 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1421194313 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1421194313 |P1Thread1of1ForFork1_#t~ite13_Out-1421194313|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1421194313|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421194313, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1421194313} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421194313, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1421194313|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1421194313} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:43:03,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-1530805698 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1530805698 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1530805698 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1530805698 256)))) (or (and (= ~z$r_buff1_thd2~0_In-1530805698 |P1Thread1of1ForFork1_#t~ite14_Out-1530805698|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1530805698|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530805698, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1530805698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1530805698, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1530805698} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530805698, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1530805698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1530805698, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1530805698|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1530805698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:43:03,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:43:03,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:43:03,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1636640245 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-1636640245| |ULTIMATE.start_main_#t~ite24_Out-1636640245|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1636640245 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1636640245 |ULTIMATE.start_main_#t~ite24_Out-1636640245|)) (and (not .cse2) .cse0 (not .cse1) (= ~z$w_buff1~0_In-1636640245 |ULTIMATE.start_main_#t~ite24_Out-1636640245|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1636640245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1636640245, ~z$w_buff1~0=~z$w_buff1~0_In-1636640245, ~z~0=~z~0_In-1636640245} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1636640245, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1636640245|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1636640245, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1636640245|, ~z$w_buff1~0=~z$w_buff1~0_In-1636640245, ~z~0=~z~0_In-1636640245} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:43:03,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1004396826 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1004396826 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1004396826| ~z$w_buff0_used~0_In1004396826)) (and (= |ULTIMATE.start_main_#t~ite26_Out1004396826| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1004396826, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1004396826} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1004396826, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1004396826, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1004396826|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:43:03,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1437248763 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1437248763 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1437248763 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1437248763 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out1437248763|)) (and (= ~z$w_buff1_used~0_In1437248763 |ULTIMATE.start_main_#t~ite27_Out1437248763|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1437248763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1437248763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1437248763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437248763} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1437248763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1437248763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1437248763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1437248763, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1437248763|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:43:03,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-872920229 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-872920229 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-872920229| ~z$r_buff0_thd0~0_In-872920229)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-872920229| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-872920229, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-872920229} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-872920229, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-872920229|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-872920229} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:43:03,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-471442849 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-471442849 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-471442849 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-471442849 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-471442849| ~z$r_buff1_thd0~0_In-471442849) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-471442849| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-471442849, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-471442849, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-471442849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-471442849} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-471442849, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-471442849|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-471442849, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-471442849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-471442849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:43:03,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:43:03,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:43:03,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:43:04,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:43:04 BasicIcfg [2019-12-26 23:43:04,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:43:04,058 INFO L168 Benchmark]: Toolchain (without parser) took 98447.94 ms. Allocated memory was 137.9 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 101.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 23:43:04,058 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:43:04,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.29 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 155.7 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:04,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.31 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 152.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:04,060 INFO L168 Benchmark]: Boogie Preprocessor took 41.15 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 149.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:04,061 INFO L168 Benchmark]: RCFGBuilder took 847.32 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 100.4 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:43:04,061 INFO L168 Benchmark]: TraceAbstraction took 96714.39 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 23:43:04,068 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.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.29 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 155.7 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.31 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 152.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.15 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 149.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.32 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 100.4 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96714.39 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=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] [L742] 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_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] [L807] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L742] 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) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 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 [L809] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __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=2, 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] [L762] EXPR 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=0, __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=2, 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] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=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=2, 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_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 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_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=2, 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_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 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 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 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 [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 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_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=2, 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] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 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 [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, 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] [L826] 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_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=2, 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] [L826] 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) [L827] 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_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=2, 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] [L827] 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)) [L828] 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_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=2, 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$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)) [L829] 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_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=2, 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_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)) [L830] 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_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=2, 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_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)) [L832] 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_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=2, 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$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)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=2, 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, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.3s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4058 SDtfs, 4350 SDslu, 11568 SDs, 0 SdLazy, 7731 SolverSat, 327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 75 SyntacticMatches, 25 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred 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: 41.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 105824 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 317160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...