/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:59:53,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:59:53,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:59:53,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:59:53,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:59:53,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:59:53,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:59:53,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:59:53,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:59:53,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:59:53,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:59:53,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:59:53,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:59:53,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:59:53,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:59:53,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:59:53,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:59:53,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:59:53,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:59:53,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:59:53,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:59:53,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:59:53,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:59:53,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:59:53,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:59:53,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:59:53,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:59:53,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:59:53,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:59:53,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:59:53,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:59:53,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:59:53,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:59:53,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:59:53,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:59:53,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:59:53,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:59:53,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:59:53,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:59:53,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:59:53,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:59:53,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:59:53,389 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:59:53,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:59:53,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:59:53,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:59:53,394 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:59:53,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:59:53,397 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:59:53,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:59:53,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:59:53,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:59:53,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:59:53,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:59:53,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:59:53,398 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:59:53,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:59:53,399 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:59:53,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:59:53,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:59:53,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:59:53,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:59:53,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:59:53,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:59:53,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:59:53,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:59:53,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:59:53,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:59:53,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:59:53,402 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:59:53,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:59:53,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:59:53,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:59:53,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:59:53,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:59:53,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:59:53,708 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:59:53,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_pso.opt.i [2019-12-27 07:59:53,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7121f5960/8f2750d86f9e4060980dce1018ea877b/FLAGb1c9de4bc [2019-12-27 07:59:54,318 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:59:54,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_pso.opt.i [2019-12-27 07:59:54,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7121f5960/8f2750d86f9e4060980dce1018ea877b/FLAGb1c9de4bc [2019-12-27 07:59:54,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7121f5960/8f2750d86f9e4060980dce1018ea877b [2019-12-27 07:59:54,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:59:54,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:59:54,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:59:54,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:59:54,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:59:54,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:59:54" (1/1) ... [2019-12-27 07:59:54,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fc715b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:54, skipping insertion in model container [2019-12-27 07:59:54,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:59:54" (1/1) ... [2019-12-27 07:59:54,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:59:54,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:59:55,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:59:55,253 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:59:55,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:59:55,397 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:59:55,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55 WrapperNode [2019-12-27 07:59:55,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:59:55,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:59:55,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:59:55,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:59:55,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:59:55,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:59:55,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:59:55,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:59:55,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... [2019-12-27 07:59:55,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:59:55,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:59:55,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:59:55,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:59:55,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:59:55,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:59:55,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:59:55,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:59:55,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:59:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:59:55,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:59:55,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:59:55,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:59:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:59:55,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:59:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:59:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:59:55,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:59:55,590 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:59:56,467 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:59:56,468 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:59:56,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:59:56 BoogieIcfgContainer [2019-12-27 07:59:56,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:59:56,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:59:56,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:59:56,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:59:56,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:59:54" (1/3) ... [2019-12-27 07:59:56,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41353d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:59:56, skipping insertion in model container [2019-12-27 07:59:56,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:59:55" (2/3) ... [2019-12-27 07:59:56,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41353d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:59:56, skipping insertion in model container [2019-12-27 07:59:56,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:59:56" (3/3) ... [2019-12-27 07:59:56,477 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_pso.opt.i [2019-12-27 07:59:56,486 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:59:56,486 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:59:56,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:59:56,494 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:59:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,586 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,619 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,622 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,627 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,629 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:59:56,652 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:59:56,671 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:59:56,672 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:59:56,672 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:59:56,672 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:59:56,672 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:59:56,672 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:59:56,672 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:59:56,672 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:59:56,685 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 07:59:56,687 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:59:56,799 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:59:56,799 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:59:56,817 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 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:59:56,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:59:56,927 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:59:56,928 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:59:56,937 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 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:59:56,957 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 07:59:56,958 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:59:57,490 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 08:00:00,638 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 08:00:00,757 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 08:00:00,788 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81281 [2019-12-27 08:00:00,788 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 08:00:00,792 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 08:00:19,653 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 08:00:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 08:00:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:00:19,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:00:19,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:00:19,661 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:00:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:00:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash 907029, now seen corresponding path program 1 times [2019-12-27 08:00:19,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:00:19,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149078846] [2019-12-27 08:00:19,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:00:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:00:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:00:19,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149078846] [2019-12-27 08:00:19,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:00:19,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:00:19,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592353942] [2019-12-27 08:00:19,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:00:19,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:00:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:00:19,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:00:19,913 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 08:00:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:00:23,526 INFO L93 Difference]: Finished difference Result 118789 states and 505722 transitions. [2019-12-27 08:00:23,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:00:23,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:00:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:00:24,134 INFO L225 Difference]: With dead ends: 118789 [2019-12-27 08:00:24,134 INFO L226 Difference]: Without dead ends: 111860 [2019-12-27 08:00:24,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:00:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111860 states. [2019-12-27 08:00:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111860 to 111860. [2019-12-27 08:00:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111860 states. [2019-12-27 08:00:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111860 states to 111860 states and 475614 transitions. [2019-12-27 08:00:36,966 INFO L78 Accepts]: Start accepts. Automaton has 111860 states and 475614 transitions. Word has length 3 [2019-12-27 08:00:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:00:36,966 INFO L462 AbstractCegarLoop]: Abstraction has 111860 states and 475614 transitions. [2019-12-27 08:00:36,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:00:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 111860 states and 475614 transitions. [2019-12-27 08:00:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:00:36,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:00:36,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:00:36,980 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:00:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:00:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash -559239811, now seen corresponding path program 1 times [2019-12-27 08:00:36,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:00:36,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165545780] [2019-12-27 08:00:36,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:00:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:00:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:00:37,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165545780] [2019-12-27 08:00:37,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:00:37,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:00:37,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854935983] [2019-12-27 08:00:37,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:00:37,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:00:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:00:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:00:37,151 INFO L87 Difference]: Start difference. First operand 111860 states and 475614 transitions. Second operand 4 states. [2019-12-27 08:00:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:00:38,398 INFO L93 Difference]: Finished difference Result 177255 states and 718849 transitions. [2019-12-27 08:00:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:00:38,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 08:00:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:00:44,330 INFO L225 Difference]: With dead ends: 177255 [2019-12-27 08:00:44,331 INFO L226 Difference]: Without dead ends: 177206 [2019-12-27 08:00:44,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:00:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177206 states. [2019-12-27 08:00:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177206 to 161396. [2019-12-27 08:00:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161396 states. [2019-12-27 08:00:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161396 states to 161396 states and 663889 transitions. [2019-12-27 08:00:58,774 INFO L78 Accepts]: Start accepts. Automaton has 161396 states and 663889 transitions. Word has length 11 [2019-12-27 08:00:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:00:58,775 INFO L462 AbstractCegarLoop]: Abstraction has 161396 states and 663889 transitions. [2019-12-27 08:00:58,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:00:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 161396 states and 663889 transitions. [2019-12-27 08:00:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:00:58,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:00:58,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:00:58,780 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:00:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:00:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash 66814097, now seen corresponding path program 1 times [2019-12-27 08:00:58,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:00:58,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326108296] [2019-12-27 08:00:58,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:00:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:00:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:00:58,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326108296] [2019-12-27 08:00:58,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:00:58,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:00:58,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214635892] [2019-12-27 08:00:58,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:00:58,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:00:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:00:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:00:58,875 INFO L87 Difference]: Start difference. First operand 161396 states and 663889 transitions. Second operand 4 states. [2019-12-27 08:00:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:00:59,146 INFO L93 Difference]: Finished difference Result 46583 states and 158739 transitions. [2019-12-27 08:00:59,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:00:59,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 08:00:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:00:59,221 INFO L225 Difference]: With dead ends: 46583 [2019-12-27 08:00:59,221 INFO L226 Difference]: Without dead ends: 35656 [2019-12-27 08:00:59,221 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-27 08:00:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35656 states. [2019-12-27 08:00:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35656 to 35560. [2019-12-27 08:00:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35560 states. [2019-12-27 08:00:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35560 states to 35560 states and 115084 transitions. [2019-12-27 08:00:59,996 INFO L78 Accepts]: Start accepts. Automaton has 35560 states and 115084 transitions. Word has length 13 [2019-12-27 08:00:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:00:59,997 INFO L462 AbstractCegarLoop]: Abstraction has 35560 states and 115084 transitions. [2019-12-27 08:00:59,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:00:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 35560 states and 115084 transitions. [2019-12-27 08:01:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 08:01:00,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:00,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:00,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1749760644, now seen corresponding path program 1 times [2019-12-27 08:01:00,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:00,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286975684] [2019-12-27 08:01:00,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:00,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286975684] [2019-12-27 08:01:00,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:00,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:01:00,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709276946] [2019-12-27 08:01:00,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:01:00,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:00,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:01:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:01:00,116 INFO L87 Difference]: Start difference. First operand 35560 states and 115084 transitions. Second operand 5 states. [2019-12-27 08:01:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:01,702 INFO L93 Difference]: Finished difference Result 47008 states and 150195 transitions. [2019-12-27 08:01:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:01:01,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 08:01:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:01,797 INFO L225 Difference]: With dead ends: 47008 [2019-12-27 08:01:01,797 INFO L226 Difference]: Without dead ends: 47008 [2019-12-27 08:01:01,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:01:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47008 states. [2019-12-27 08:01:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47008 to 40103. [2019-12-27 08:01:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40103 states. [2019-12-27 08:01:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40103 states to 40103 states and 129199 transitions. [2019-12-27 08:01:02,729 INFO L78 Accepts]: Start accepts. Automaton has 40103 states and 129199 transitions. Word has length 16 [2019-12-27 08:01:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:02,730 INFO L462 AbstractCegarLoop]: Abstraction has 40103 states and 129199 transitions. [2019-12-27 08:01:02,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:01:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 40103 states and 129199 transitions. [2019-12-27 08:01:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:01:02,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:02,740 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] [2019-12-27 08:01:02,741 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 77153860, now seen corresponding path program 1 times [2019-12-27 08:01:02,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:02,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638718892] [2019-12-27 08:01:02,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:02,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638718892] [2019-12-27 08:01:02,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:02,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:01:02,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011598727] [2019-12-27 08:01:02,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:01:02,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:01:02,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:01:02,855 INFO L87 Difference]: Start difference. First operand 40103 states and 129199 transitions. Second operand 6 states. [2019-12-27 08:01:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:03,879 INFO L93 Difference]: Finished difference Result 60208 states and 188447 transitions. [2019-12-27 08:01:03,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:01:03,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:01:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:03,987 INFO L225 Difference]: With dead ends: 60208 [2019-12-27 08:01:03,988 INFO L226 Difference]: Without dead ends: 60152 [2019-12-27 08:01:03,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:01:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60152 states. [2019-12-27 08:01:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60152 to 40416. [2019-12-27 08:01:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40416 states. [2019-12-27 08:01:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40416 states to 40416 states and 129270 transitions. [2019-12-27 08:01:05,533 INFO L78 Accepts]: Start accepts. Automaton has 40416 states and 129270 transitions. Word has length 22 [2019-12-27 08:01:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:05,534 INFO L462 AbstractCegarLoop]: Abstraction has 40416 states and 129270 transitions. [2019-12-27 08:01:05,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:01:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 40416 states and 129270 transitions. [2019-12-27 08:01:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:01:05,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:05,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:05,550 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:05,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:05,550 INFO L82 PathProgramCache]: Analyzing trace with hash -99865394, now seen corresponding path program 1 times [2019-12-27 08:01:05,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:05,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756678582] [2019-12-27 08:01:05,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:05,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756678582] [2019-12-27 08:01:05,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:05,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:01:05,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518396067] [2019-12-27 08:01:05,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:01:05,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:05,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:01:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:01:05,671 INFO L87 Difference]: Start difference. First operand 40416 states and 129270 transitions. Second operand 5 states. [2019-12-27 08:01:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:06,447 INFO L93 Difference]: Finished difference Result 56120 states and 175692 transitions. [2019-12-27 08:01:06,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:01:06,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 08:01:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:06,596 INFO L225 Difference]: With dead ends: 56120 [2019-12-27 08:01:06,597 INFO L226 Difference]: Without dead ends: 56107 [2019-12-27 08:01:06,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:01:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56107 states. [2019-12-27 08:01:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56107 to 47572. [2019-12-27 08:01:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47572 states. [2019-12-27 08:01:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47572 states to 47572 states and 151573 transitions. [2019-12-27 08:01:08,191 INFO L78 Accepts]: Start accepts. Automaton has 47572 states and 151573 transitions. Word has length 25 [2019-12-27 08:01:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:08,191 INFO L462 AbstractCegarLoop]: Abstraction has 47572 states and 151573 transitions. [2019-12-27 08:01:08,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:01:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 47572 states and 151573 transitions. [2019-12-27 08:01:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 08:01:08,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:08,205 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] [2019-12-27 08:01:08,205 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1405741723, now seen corresponding path program 1 times [2019-12-27 08:01:08,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:08,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493576486] [2019-12-27 08:01:08,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:08,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493576486] [2019-12-27 08:01:08,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:08,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:01:08,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886344745] [2019-12-27 08:01:08,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:01:08,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:01:08,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:01:08,341 INFO L87 Difference]: Start difference. First operand 47572 states and 151573 transitions. Second operand 6 states. [2019-12-27 08:01:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:09,054 INFO L93 Difference]: Finished difference Result 66824 states and 208038 transitions. [2019-12-27 08:01:09,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 08:01:09,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 08:01:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:09,155 INFO L225 Difference]: With dead ends: 66824 [2019-12-27 08:01:09,155 INFO L226 Difference]: Without dead ends: 66476 [2019-12-27 08:01:09,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:01:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66476 states. [2019-12-27 08:01:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66476 to 52195. [2019-12-27 08:01:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52195 states. [2019-12-27 08:01:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52195 states to 52195 states and 165507 transitions. [2019-12-27 08:01:10,736 INFO L78 Accepts]: Start accepts. Automaton has 52195 states and 165507 transitions. Word has length 27 [2019-12-27 08:01:10,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:10,737 INFO L462 AbstractCegarLoop]: Abstraction has 52195 states and 165507 transitions. [2019-12-27 08:01:10,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:01:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 52195 states and 165507 transitions. [2019-12-27 08:01:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 08:01:10,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:10,751 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] [2019-12-27 08:01:10,751 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:10,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash 655140848, now seen corresponding path program 1 times [2019-12-27 08:01:10,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:10,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086925307] [2019-12-27 08:01:10,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:10,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086925307] [2019-12-27 08:01:10,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:10,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:01:10,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040511260] [2019-12-27 08:01:10,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:01:10,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:10,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:01:10,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:10,807 INFO L87 Difference]: Start difference. First operand 52195 states and 165507 transitions. Second operand 3 states. [2019-12-27 08:01:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:11,176 INFO L93 Difference]: Finished difference Result 80841 states and 257666 transitions. [2019-12-27 08:01:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:01:11,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 08:01:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:11,269 INFO L225 Difference]: With dead ends: 80841 [2019-12-27 08:01:11,270 INFO L226 Difference]: Without dead ends: 39577 [2019-12-27 08:01:11,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39577 states. [2019-12-27 08:01:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39577 to 38708. [2019-12-27 08:01:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38708 states. [2019-12-27 08:01:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38708 states to 38708 states and 121201 transitions. [2019-12-27 08:01:12,668 INFO L78 Accepts]: Start accepts. Automaton has 38708 states and 121201 transitions. Word has length 28 [2019-12-27 08:01:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:12,669 INFO L462 AbstractCegarLoop]: Abstraction has 38708 states and 121201 transitions. [2019-12-27 08:01:12,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:01:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 38708 states and 121201 transitions. [2019-12-27 08:01:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 08:01:12,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:12,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:12,682 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash -986421226, now seen corresponding path program 1 times [2019-12-27 08:01:12,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:12,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354316332] [2019-12-27 08:01:12,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:12,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354316332] [2019-12-27 08:01:12,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:12,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:01:12,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222647443] [2019-12-27 08:01:12,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:01:12,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:12,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:01:12,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:12,755 INFO L87 Difference]: Start difference. First operand 38708 states and 121201 transitions. Second operand 3 states. [2019-12-27 08:01:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:12,905 INFO L93 Difference]: Finished difference Result 38678 states and 121115 transitions. [2019-12-27 08:01:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:01:12,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 08:01:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:12,968 INFO L225 Difference]: With dead ends: 38678 [2019-12-27 08:01:12,968 INFO L226 Difference]: Without dead ends: 38678 [2019-12-27 08:01:12,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38678 states. [2019-12-27 08:01:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38678 to 38678. [2019-12-27 08:01:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38678 states. [2019-12-27 08:01:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38678 states to 38678 states and 121115 transitions. [2019-12-27 08:01:13,638 INFO L78 Accepts]: Start accepts. Automaton has 38678 states and 121115 transitions. Word has length 29 [2019-12-27 08:01:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:13,639 INFO L462 AbstractCegarLoop]: Abstraction has 38678 states and 121115 transitions. [2019-12-27 08:01:13,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:01:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 38678 states and 121115 transitions. [2019-12-27 08:01:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:01:13,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:13,654 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] [2019-12-27 08:01:13,654 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:13,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1308765611, now seen corresponding path program 1 times [2019-12-27 08:01:13,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:13,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622758343] [2019-12-27 08:01:13,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:13,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622758343] [2019-12-27 08:01:13,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:13,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:01:13,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322754667] [2019-12-27 08:01:13,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:01:13,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:01:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:01:13,759 INFO L87 Difference]: Start difference. First operand 38678 states and 121115 transitions. Second operand 5 states. [2019-12-27 08:01:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:14,490 INFO L93 Difference]: Finished difference Result 54762 states and 170462 transitions. [2019-12-27 08:01:14,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:01:14,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 08:01:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:15,179 INFO L225 Difference]: With dead ends: 54762 [2019-12-27 08:01:15,179 INFO L226 Difference]: Without dead ends: 54762 [2019-12-27 08:01:15,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:01:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54762 states. [2019-12-27 08:01:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54762 to 47953. [2019-12-27 08:01:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47953 states. [2019-12-27 08:01:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47953 states to 47953 states and 150341 transitions. [2019-12-27 08:01:15,942 INFO L78 Accepts]: Start accepts. Automaton has 47953 states and 150341 transitions. Word has length 30 [2019-12-27 08:01:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:15,942 INFO L462 AbstractCegarLoop]: Abstraction has 47953 states and 150341 transitions. [2019-12-27 08:01:15,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:01:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 47953 states and 150341 transitions. [2019-12-27 08:01:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 08:01:15,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:15,964 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] [2019-12-27 08:01:15,964 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1737014044, now seen corresponding path program 1 times [2019-12-27 08:01:15,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:15,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957131351] [2019-12-27 08:01:15,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:16,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957131351] [2019-12-27 08:01:16,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:16,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:01:16,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371169907] [2019-12-27 08:01:16,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:01:16,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:16,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:01:16,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:01:16,039 INFO L87 Difference]: Start difference. First operand 47953 states and 150341 transitions. Second operand 5 states. [2019-12-27 08:01:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:16,828 INFO L93 Difference]: Finished difference Result 65989 states and 204413 transitions. [2019-12-27 08:01:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:01:16,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 08:01:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:16,930 INFO L225 Difference]: With dead ends: 65989 [2019-12-27 08:01:16,930 INFO L226 Difference]: Without dead ends: 65982 [2019-12-27 08:01:16,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:01:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65982 states. [2019-12-27 08:01:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65982 to 54307. [2019-12-27 08:01:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54307 states. [2019-12-27 08:01:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54307 states to 54307 states and 170354 transitions. [2019-12-27 08:01:18,543 INFO L78 Accepts]: Start accepts. Automaton has 54307 states and 170354 transitions. Word has length 30 [2019-12-27 08:01:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:18,543 INFO L462 AbstractCegarLoop]: Abstraction has 54307 states and 170354 transitions. [2019-12-27 08:01:18,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:01:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 54307 states and 170354 transitions. [2019-12-27 08:01:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 08:01:18,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:18,566 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] [2019-12-27 08:01:18,567 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:18,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2041777254, now seen corresponding path program 1 times [2019-12-27 08:01:18,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:18,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038057679] [2019-12-27 08:01:18,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:18,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038057679] [2019-12-27 08:01:18,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:18,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:01:18,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179503169] [2019-12-27 08:01:18,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:01:18,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:01:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:01:18,626 INFO L87 Difference]: Start difference. First operand 54307 states and 170354 transitions. Second operand 5 states. [2019-12-27 08:01:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:18,789 INFO L93 Difference]: Finished difference Result 27248 states and 80905 transitions. [2019-12-27 08:01:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:01:18,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 08:01:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:18,830 INFO L225 Difference]: With dead ends: 27248 [2019-12-27 08:01:18,830 INFO L226 Difference]: Without dead ends: 23846 [2019-12-27 08:01:18,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:01:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23846 states. [2019-12-27 08:01:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23846 to 22579. [2019-12-27 08:01:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22579 states. [2019-12-27 08:01:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22579 states to 22579 states and 67130 transitions. [2019-12-27 08:01:19,154 INFO L78 Accepts]: Start accepts. Automaton has 22579 states and 67130 transitions. Word has length 31 [2019-12-27 08:01:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:19,154 INFO L462 AbstractCegarLoop]: Abstraction has 22579 states and 67130 transitions. [2019-12-27 08:01:19,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:01:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22579 states and 67130 transitions. [2019-12-27 08:01:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 08:01:19,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:19,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] [2019-12-27 08:01:19,172 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:19,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1695782975, now seen corresponding path program 1 times [2019-12-27 08:01:19,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:19,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016900908] [2019-12-27 08:01:19,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:19,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-27 08:01:19,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016900908] [2019-12-27 08:01:19,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:19,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:01:19,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267171965] [2019-12-27 08:01:19,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:01:19,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:19,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:01:19,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:01:19,273 INFO L87 Difference]: Start difference. First operand 22579 states and 67130 transitions. Second operand 7 states. [2019-12-27 08:01:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:20,939 INFO L93 Difference]: Finished difference Result 31896 states and 91946 transitions. [2019-12-27 08:01:20,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 08:01:20,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 08:01:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:20,978 INFO L225 Difference]: With dead ends: 31896 [2019-12-27 08:01:20,978 INFO L226 Difference]: Without dead ends: 31209 [2019-12-27 08:01:20,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:01:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31209 states. [2019-12-27 08:01:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31209 to 22046. [2019-12-27 08:01:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22046 states. [2019-12-27 08:01:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22046 states to 22046 states and 65408 transitions. [2019-12-27 08:01:21,329 INFO L78 Accepts]: Start accepts. Automaton has 22046 states and 65408 transitions. Word has length 33 [2019-12-27 08:01:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:21,330 INFO L462 AbstractCegarLoop]: Abstraction has 22046 states and 65408 transitions. [2019-12-27 08:01:21,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:01:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22046 states and 65408 transitions. [2019-12-27 08:01:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 08:01:21,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:21,358 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] [2019-12-27 08:01:21,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:21,359 INFO L82 PathProgramCache]: Analyzing trace with hash -569045237, now seen corresponding path program 1 times [2019-12-27 08:01:21,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:21,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033034791] [2019-12-27 08:01:21,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:21,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033034791] [2019-12-27 08:01:21,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:21,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:01:21,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136295234] [2019-12-27 08:01:21,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:01:21,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:01:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:01:21,444 INFO L87 Difference]: Start difference. First operand 22046 states and 65408 transitions. Second operand 6 states. [2019-12-27 08:01:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:22,382 INFO L93 Difference]: Finished difference Result 28229 states and 82359 transitions. [2019-12-27 08:01:22,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:01:22,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 08:01:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:22,422 INFO L225 Difference]: With dead ends: 28229 [2019-12-27 08:01:22,422 INFO L226 Difference]: Without dead ends: 28229 [2019-12-27 08:01:22,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:01:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28229 states. [2019-12-27 08:01:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28229 to 21867. [2019-12-27 08:01:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21867 states. [2019-12-27 08:01:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21867 states to 21867 states and 64930 transitions. [2019-12-27 08:01:22,763 INFO L78 Accepts]: Start accepts. Automaton has 21867 states and 64930 transitions. Word has length 40 [2019-12-27 08:01:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:22,763 INFO L462 AbstractCegarLoop]: Abstraction has 21867 states and 64930 transitions. [2019-12-27 08:01:22,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:01:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 21867 states and 64930 transitions. [2019-12-27 08:01:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 08:01:22,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:22,791 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] [2019-12-27 08:01:22,791 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1250676141, now seen corresponding path program 2 times [2019-12-27 08:01:22,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:22,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278191413] [2019-12-27 08:01:22,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:22,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278191413] [2019-12-27 08:01:22,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:22,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:01:22,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913359785] [2019-12-27 08:01:22,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:01:22,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:01:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:22,834 INFO L87 Difference]: Start difference. First operand 21867 states and 64930 transitions. Second operand 3 states. [2019-12-27 08:01:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:22,914 INFO L93 Difference]: Finished difference Result 18698 states and 54536 transitions. [2019-12-27 08:01:22,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:01:22,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 08:01:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:22,945 INFO L225 Difference]: With dead ends: 18698 [2019-12-27 08:01:22,945 INFO L226 Difference]: Without dead ends: 18698 [2019-12-27 08:01:22,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18698 states. [2019-12-27 08:01:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18698 to 18690. [2019-12-27 08:01:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18690 states. [2019-12-27 08:01:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 54520 transitions. [2019-12-27 08:01:23,338 INFO L78 Accepts]: Start accepts. Automaton has 18690 states and 54520 transitions. Word has length 40 [2019-12-27 08:01:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:23,339 INFO L462 AbstractCegarLoop]: Abstraction has 18690 states and 54520 transitions. [2019-12-27 08:01:23,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:01:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18690 states and 54520 transitions. [2019-12-27 08:01:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:01:23,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:23,369 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] [2019-12-27 08:01:23,369 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:23,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1866373660, now seen corresponding path program 1 times [2019-12-27 08:01:23,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:23,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588184669] [2019-12-27 08:01:23,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:23,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588184669] [2019-12-27 08:01:23,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:23,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:01:23,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515053644] [2019-12-27 08:01:23,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:01:23,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:23,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:01:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:01:23,473 INFO L87 Difference]: Start difference. First operand 18690 states and 54520 transitions. Second operand 6 states. [2019-12-27 08:01:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:24,079 INFO L93 Difference]: Finished difference Result 17644 states and 52106 transitions. [2019-12-27 08:01:24,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:01:24,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 08:01:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:24,106 INFO L225 Difference]: With dead ends: 17644 [2019-12-27 08:01:24,106 INFO L226 Difference]: Without dead ends: 15705 [2019-12-27 08:01:24,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:01:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15705 states. [2019-12-27 08:01:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15705 to 14998. [2019-12-27 08:01:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14998 states. [2019-12-27 08:01:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14998 states to 14998 states and 45615 transitions. [2019-12-27 08:01:24,342 INFO L78 Accepts]: Start accepts. Automaton has 14998 states and 45615 transitions. Word has length 41 [2019-12-27 08:01:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:24,342 INFO L462 AbstractCegarLoop]: Abstraction has 14998 states and 45615 transitions. [2019-12-27 08:01:24,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:01:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 14998 states and 45615 transitions. [2019-12-27 08:01:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 08:01:24,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:24,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:24,357 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:24,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:24,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1793843893, now seen corresponding path program 1 times [2019-12-27 08:01:24,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:24,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263258536] [2019-12-27 08:01:24,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:24,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263258536] [2019-12-27 08:01:24,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:24,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:01:24,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248809076] [2019-12-27 08:01:24,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:01:24,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:24,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:01:24,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:24,410 INFO L87 Difference]: Start difference. First operand 14998 states and 45615 transitions. Second operand 3 states. [2019-12-27 08:01:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:24,518 INFO L93 Difference]: Finished difference Result 23444 states and 71138 transitions. [2019-12-27 08:01:24,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:01:24,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 08:01:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:24,548 INFO L225 Difference]: With dead ends: 23444 [2019-12-27 08:01:24,548 INFO L226 Difference]: Without dead ends: 23444 [2019-12-27 08:01:24,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-27 08:01:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 17860. [2019-12-27 08:01:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17860 states. [2019-12-27 08:01:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17860 states to 17860 states and 54782 transitions. [2019-12-27 08:01:24,849 INFO L78 Accepts]: Start accepts. Automaton has 17860 states and 54782 transitions. Word has length 65 [2019-12-27 08:01:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:24,849 INFO L462 AbstractCegarLoop]: Abstraction has 17860 states and 54782 transitions. [2019-12-27 08:01:24,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:01:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17860 states and 54782 transitions. [2019-12-27 08:01:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 08:01:24,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:24,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:24,866 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2082486832, now seen corresponding path program 1 times [2019-12-27 08:01:24,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:24,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140374161] [2019-12-27 08:01:24,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:24,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140374161] [2019-12-27 08:01:24,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:24,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:01:24,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474016123] [2019-12-27 08:01:24,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:01:24,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:24,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:01:24,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:01:24,971 INFO L87 Difference]: Start difference. First operand 17860 states and 54782 transitions. Second operand 7 states. [2019-12-27 08:01:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:25,425 INFO L93 Difference]: Finished difference Result 54590 states and 165754 transitions. [2019-12-27 08:01:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:01:25,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 08:01:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:25,475 INFO L225 Difference]: With dead ends: 54590 [2019-12-27 08:01:25,475 INFO L226 Difference]: Without dead ends: 37436 [2019-12-27 08:01:25,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:01:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37436 states. [2019-12-27 08:01:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37436 to 20975. [2019-12-27 08:01:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20975 states. [2019-12-27 08:01:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20975 states to 20975 states and 64194 transitions. [2019-12-27 08:01:25,892 INFO L78 Accepts]: Start accepts. Automaton has 20975 states and 64194 transitions. Word has length 65 [2019-12-27 08:01:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:25,892 INFO L462 AbstractCegarLoop]: Abstraction has 20975 states and 64194 transitions. [2019-12-27 08:01:25,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:01:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 20975 states and 64194 transitions. [2019-12-27 08:01:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 08:01:25,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:25,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:25,915 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:25,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1961212410, now seen corresponding path program 2 times [2019-12-27 08:01:25,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:25,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217336240] [2019-12-27 08:01:25,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:25,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-27 08:01:25,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217336240] [2019-12-27 08:01:25,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:25,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:01:26,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878214306] [2019-12-27 08:01:26,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:01:26,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:26,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:01:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:01:26,001 INFO L87 Difference]: Start difference. First operand 20975 states and 64194 transitions. Second operand 5 states. [2019-12-27 08:01:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:26,767 INFO L93 Difference]: Finished difference Result 22815 states and 69273 transitions. [2019-12-27 08:01:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:01:26,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 08:01:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:26,799 INFO L225 Difference]: With dead ends: 22815 [2019-12-27 08:01:26,799 INFO L226 Difference]: Without dead ends: 22815 [2019-12-27 08:01:26,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:01:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22815 states. [2019-12-27 08:01:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22815 to 21311. [2019-12-27 08:01:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21311 states. [2019-12-27 08:01:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21311 states to 21311 states and 65179 transitions. [2019-12-27 08:01:27,137 INFO L78 Accepts]: Start accepts. Automaton has 21311 states and 65179 transitions. Word has length 65 [2019-12-27 08:01:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:27,138 INFO L462 AbstractCegarLoop]: Abstraction has 21311 states and 65179 transitions. [2019-12-27 08:01:27,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:01:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 21311 states and 65179 transitions. [2019-12-27 08:01:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 08:01:27,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:27,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:27,162 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1524127272, now seen corresponding path program 3 times [2019-12-27 08:01:27,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:27,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930164618] [2019-12-27 08:01:27,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:27,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930164618] [2019-12-27 08:01:27,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:27,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:01:27,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360323984] [2019-12-27 08:01:27,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:01:27,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:01:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:01:27,278 INFO L87 Difference]: Start difference. First operand 21311 states and 65179 transitions. Second operand 7 states. [2019-12-27 08:01:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:28,373 INFO L93 Difference]: Finished difference Result 33097 states and 98781 transitions. [2019-12-27 08:01:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:01:28,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 08:01:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:28,428 INFO L225 Difference]: With dead ends: 33097 [2019-12-27 08:01:28,428 INFO L226 Difference]: Without dead ends: 33097 [2019-12-27 08:01:28,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:01:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33097 states. [2019-12-27 08:01:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33097 to 24821. [2019-12-27 08:01:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24821 states. [2019-12-27 08:01:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24821 states to 24821 states and 75073 transitions. [2019-12-27 08:01:28,874 INFO L78 Accepts]: Start accepts. Automaton has 24821 states and 75073 transitions. Word has length 65 [2019-12-27 08:01:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:28,874 INFO L462 AbstractCegarLoop]: Abstraction has 24821 states and 75073 transitions. [2019-12-27 08:01:28,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:01:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 24821 states and 75073 transitions. [2019-12-27 08:01:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 08:01:28,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:28,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:28,902 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1989671644, now seen corresponding path program 4 times [2019-12-27 08:01:28,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:28,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378913033] [2019-12-27 08:01:28,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:28,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378913033] [2019-12-27 08:01:28,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:28,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:01:28,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802736050] [2019-12-27 08:01:28,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:01:28,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:28,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:01:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:28,971 INFO L87 Difference]: Start difference. First operand 24821 states and 75073 transitions. Second operand 3 states. [2019-12-27 08:01:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:29,086 INFO L93 Difference]: Finished difference Result 24820 states and 75071 transitions. [2019-12-27 08:01:29,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:01:29,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 08:01:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:29,132 INFO L225 Difference]: With dead ends: 24820 [2019-12-27 08:01:29,133 INFO L226 Difference]: Without dead ends: 24820 [2019-12-27 08:01:29,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24820 states. [2019-12-27 08:01:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24820 to 20484. [2019-12-27 08:01:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-12-27 08:01:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 62818 transitions. [2019-12-27 08:01:30,002 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 62818 transitions. Word has length 65 [2019-12-27 08:01:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:30,003 INFO L462 AbstractCegarLoop]: Abstraction has 20484 states and 62818 transitions. [2019-12-27 08:01:30,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:01:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 62818 transitions. [2019-12-27 08:01:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:01:30,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:30,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:30,035 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:30,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1004204331, now seen corresponding path program 1 times [2019-12-27 08:01:30,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:30,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718909336] [2019-12-27 08:01:30,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:30,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718909336] [2019-12-27 08:01:30,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:30,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 08:01:30,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831943871] [2019-12-27 08:01:30,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 08:01:30,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 08:01:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:01:30,142 INFO L87 Difference]: Start difference. First operand 20484 states and 62818 transitions. Second operand 8 states. [2019-12-27 08:01:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:32,163 INFO L93 Difference]: Finished difference Result 26780 states and 80750 transitions. [2019-12-27 08:01:32,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 08:01:32,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 08:01:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:32,200 INFO L225 Difference]: With dead ends: 26780 [2019-12-27 08:01:32,201 INFO L226 Difference]: Without dead ends: 26780 [2019-12-27 08:01:32,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2019-12-27 08:01:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26780 states. [2019-12-27 08:01:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26780 to 18027. [2019-12-27 08:01:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18027 states. [2019-12-27 08:01:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18027 states to 18027 states and 55766 transitions. [2019-12-27 08:01:32,517 INFO L78 Accepts]: Start accepts. Automaton has 18027 states and 55766 transitions. Word has length 66 [2019-12-27 08:01:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:32,517 INFO L462 AbstractCegarLoop]: Abstraction has 18027 states and 55766 transitions. [2019-12-27 08:01:32,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 08:01:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 18027 states and 55766 transitions. [2019-12-27 08:01:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:01:32,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:32,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:32,536 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-27 08:01:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:32,536 INFO L82 PathProgramCache]: Analyzing trace with hash -542769313, now seen corresponding path program 2 times [2019-12-27 08:01:32,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:32,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060400249] [2019-12-27 08:01:32,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:32,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060400249] [2019-12-27 08:01:32,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:32,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 08:01:32,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834505658] [2019-12-27 08:01:32,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 08:01:32,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 08:01:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:01:32,819 INFO L87 Difference]: Start difference. First operand 18027 states and 55766 transitions. Second operand 11 states. [2019-12-27 08:01:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:33,955 INFO L93 Difference]: Finished difference Result 43770 states and 135392 transitions. [2019-12-27 08:01:33,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 08:01:33,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 08:01:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:34,010 INFO L225 Difference]: With dead ends: 43770 [2019-12-27 08:01:34,011 INFO L226 Difference]: Without dead ends: 41203 [2019-12-27 08:01:34,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:01:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41203 states. [2019-12-27 08:01:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41203 to 23866. [2019-12-27 08:01:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23866 states. [2019-12-27 08:01:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23866 states to 23866 states and 73645 transitions. [2019-12-27 08:01:34,978 INFO L78 Accepts]: Start accepts. Automaton has 23866 states and 73645 transitions. Word has length 66 [2019-12-27 08:01:34,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:34,978 INFO L462 AbstractCegarLoop]: Abstraction has 23866 states and 73645 transitions. [2019-12-27 08:01:34,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 08:01:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 23866 states and 73645 transitions. [2019-12-27 08:01:35,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:01:35,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:35,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:35,004 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-27 08:01:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1512466799, now seen corresponding path program 3 times [2019-12-27 08:01:35,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:35,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174104962] [2019-12-27 08:01:35,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:35,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174104962] [2019-12-27 08:01:35,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:35,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 08:01:35,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010230533] [2019-12-27 08:01:35,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 08:01:35,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 08:01:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:01:35,433 INFO L87 Difference]: Start difference. First operand 23866 states and 73645 transitions. Second operand 17 states. [2019-12-27 08:01:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:41,495 INFO L93 Difference]: Finished difference Result 36018 states and 110757 transitions. [2019-12-27 08:01:41,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-27 08:01:41,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 08:01:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:41,545 INFO L225 Difference]: With dead ends: 36018 [2019-12-27 08:01:41,545 INFO L226 Difference]: Without dead ends: 35909 [2019-12-27 08:01:41,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=766, Invalid=4204, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 08:01:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35909 states. [2019-12-27 08:01:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35909 to 27057. [2019-12-27 08:01:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27057 states. [2019-12-27 08:01:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27057 states to 27057 states and 84331 transitions. [2019-12-27 08:01:42,525 INFO L78 Accepts]: Start accepts. Automaton has 27057 states and 84331 transitions. Word has length 66 [2019-12-27 08:01:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:42,525 INFO L462 AbstractCegarLoop]: Abstraction has 27057 states and 84331 transitions. [2019-12-27 08:01:42,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 08:01:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 27057 states and 84331 transitions. [2019-12-27 08:01:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:01:42,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:42,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:42,556 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-27 08:01:42,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash -902552407, now seen corresponding path program 4 times [2019-12-27 08:01:42,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:42,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132651943] [2019-12-27 08:01:42,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:42,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132651943] [2019-12-27 08:01:42,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:42,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 08:01:42,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904456644] [2019-12-27 08:01:42,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 08:01:42,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 08:01:42,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:01:42,727 INFO L87 Difference]: Start difference. First operand 27057 states and 84331 transitions. Second operand 11 states. [2019-12-27 08:01:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:43,772 INFO L93 Difference]: Finished difference Result 47572 states and 147453 transitions. [2019-12-27 08:01:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 08:01:43,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 08:01:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:43,821 INFO L225 Difference]: With dead ends: 47572 [2019-12-27 08:01:43,821 INFO L226 Difference]: Without dead ends: 31028 [2019-12-27 08:01:43,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 08:01:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31028 states. [2019-12-27 08:01:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31028 to 17784. [2019-12-27 08:01:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17784 states. [2019-12-27 08:01:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17784 states to 17784 states and 54336 transitions. [2019-12-27 08:01:44,171 INFO L78 Accepts]: Start accepts. Automaton has 17784 states and 54336 transitions. Word has length 66 [2019-12-27 08:01:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:44,172 INFO L462 AbstractCegarLoop]: Abstraction has 17784 states and 54336 transitions. [2019-12-27 08:01:44,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 08:01:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 17784 states and 54336 transitions. [2019-12-27 08:01:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:01:44,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:44,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:44,190 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-27 08:01:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash 786177069, now seen corresponding path program 5 times [2019-12-27 08:01:44,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:44,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4328321] [2019-12-27 08:01:44,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:44,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4328321] [2019-12-27 08:01:44,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:44,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 08:01:44,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128311220] [2019-12-27 08:01:44,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:01:44,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:44,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:01:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:01:44,300 INFO L87 Difference]: Start difference. First operand 17784 states and 54336 transitions. Second operand 9 states. [2019-12-27 08:01:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:45,523 INFO L93 Difference]: Finished difference Result 25188 states and 76290 transitions. [2019-12-27 08:01:45,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:01:45,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 08:01:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:45,554 INFO L225 Difference]: With dead ends: 25188 [2019-12-27 08:01:45,555 INFO L226 Difference]: Without dead ends: 24180 [2019-12-27 08:01:45,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:01:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24180 states. [2019-12-27 08:01:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24180 to 17376. [2019-12-27 08:01:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17376 states. [2019-12-27 08:01:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17376 states to 17376 states and 53159 transitions. [2019-12-27 08:01:45,847 INFO L78 Accepts]: Start accepts. Automaton has 17376 states and 53159 transitions. Word has length 66 [2019-12-27 08:01:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:45,847 INFO L462 AbstractCegarLoop]: Abstraction has 17376 states and 53159 transitions. [2019-12-27 08:01:45,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:01:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 17376 states and 53159 transitions. [2019-12-27 08:01:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 08:01:45,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:45,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:45,865 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash 643280457, now seen corresponding path program 6 times [2019-12-27 08:01:45,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:45,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592752792] [2019-12-27 08:01:45,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:45,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592752792] [2019-12-27 08:01:45,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:45,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:01:45,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90097505] [2019-12-27 08:01:45,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:01:45,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:01:45,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:01:45,941 INFO L87 Difference]: Start difference. First operand 17376 states and 53159 transitions. Second operand 4 states. [2019-12-27 08:01:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:46,042 INFO L93 Difference]: Finished difference Result 20435 states and 62298 transitions. [2019-12-27 08:01:46,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:01:46,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 08:01:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:46,068 INFO L225 Difference]: With dead ends: 20435 [2019-12-27 08:01:46,068 INFO L226 Difference]: Without dead ends: 20435 [2019-12-27 08:01:46,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:01:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20435 states. [2019-12-27 08:01:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20435 to 17299. [2019-12-27 08:01:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17299 states. [2019-12-27 08:01:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17299 states to 17299 states and 53064 transitions. [2019-12-27 08:01:46,775 INFO L78 Accepts]: Start accepts. Automaton has 17299 states and 53064 transitions. Word has length 66 [2019-12-27 08:01:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:46,775 INFO L462 AbstractCegarLoop]: Abstraction has 17299 states and 53064 transitions. [2019-12-27 08:01:46,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:01:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 17299 states and 53064 transitions. [2019-12-27 08:01:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 08:01:46,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:46,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:46,794 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1565034440, now seen corresponding path program 1 times [2019-12-27 08:01:46,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:46,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721014905] [2019-12-27 08:01:46,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:47,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721014905] [2019-12-27 08:01:47,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:47,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 08:01:47,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83763511] [2019-12-27 08:01:47,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 08:01:47,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:47,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 08:01:47,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:01:47,284 INFO L87 Difference]: Start difference. First operand 17299 states and 53064 transitions. Second operand 17 states. [2019-12-27 08:01:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:50,221 INFO L93 Difference]: Finished difference Result 19682 states and 59449 transitions. [2019-12-27 08:01:50,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 08:01:50,222 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 08:01:50,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:50,249 INFO L225 Difference]: With dead ends: 19682 [2019-12-27 08:01:50,250 INFO L226 Difference]: Without dead ends: 19139 [2019-12-27 08:01:50,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=317, Invalid=1663, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 08:01:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19139 states. [2019-12-27 08:01:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19139 to 17039. [2019-12-27 08:01:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17039 states. [2019-12-27 08:01:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17039 states to 17039 states and 52402 transitions. [2019-12-27 08:01:50,510 INFO L78 Accepts]: Start accepts. Automaton has 17039 states and 52402 transitions. Word has length 67 [2019-12-27 08:01:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:50,510 INFO L462 AbstractCegarLoop]: Abstraction has 17039 states and 52402 transitions. [2019-12-27 08:01:50,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 08:01:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 17039 states and 52402 transitions. [2019-12-27 08:01:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 08:01:50,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:50,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:50,529 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:50,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:50,530 INFO L82 PathProgramCache]: Analyzing trace with hash 516920465, now seen corresponding path program 1 times [2019-12-27 08:01:50,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:50,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820946989] [2019-12-27 08:01:50,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:50,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820946989] [2019-12-27 08:01:50,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:50,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:01:50,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795691722] [2019-12-27 08:01:50,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:01:50,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:50,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:01:50,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:50,584 INFO L87 Difference]: Start difference. First operand 17039 states and 52402 transitions. Second operand 3 states. [2019-12-27 08:01:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:50,834 INFO L93 Difference]: Finished difference Result 23465 states and 72264 transitions. [2019-12-27 08:01:50,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:01:50,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 08:01:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:50,890 INFO L225 Difference]: With dead ends: 23465 [2019-12-27 08:01:50,890 INFO L226 Difference]: Without dead ends: 23465 [2019-12-27 08:01:50,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:01:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23465 states. [2019-12-27 08:01:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23465 to 17502. [2019-12-27 08:01:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17502 states. [2019-12-27 08:01:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17502 states to 17502 states and 53879 transitions. [2019-12-27 08:01:51,319 INFO L78 Accepts]: Start accepts. Automaton has 17502 states and 53879 transitions. Word has length 67 [2019-12-27 08:01:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:51,319 INFO L462 AbstractCegarLoop]: Abstraction has 17502 states and 53879 transitions. [2019-12-27 08:01:51,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:01:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17502 states and 53879 transitions. [2019-12-27 08:01:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 08:01:51,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:51,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:51,339 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:51,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1257841567, now seen corresponding path program 2 times [2019-12-27 08:01:51,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:51,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171226544] [2019-12-27 08:01:51,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:51,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171226544] [2019-12-27 08:01:51,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:51,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:01:51,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109086583] [2019-12-27 08:01:51,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 08:01:51,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 08:01:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:01:51,610 INFO L87 Difference]: Start difference. First operand 17502 states and 53879 transitions. Second operand 11 states. [2019-12-27 08:01:52,730 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2019-12-27 08:01:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:55,951 INFO L93 Difference]: Finished difference Result 81129 states and 249150 transitions. [2019-12-27 08:01:55,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 08:01:55,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 08:01:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:56,071 INFO L225 Difference]: With dead ends: 81129 [2019-12-27 08:01:56,072 INFO L226 Difference]: Without dead ends: 81129 [2019-12-27 08:01:56,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=609, Invalid=2147, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 08:01:56,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81129 states. [2019-12-27 08:01:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81129 to 21770. [2019-12-27 08:01:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21770 states. [2019-12-27 08:01:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21770 states to 21770 states and 68176 transitions. [2019-12-27 08:01:56,868 INFO L78 Accepts]: Start accepts. Automaton has 21770 states and 68176 transitions. Word has length 67 [2019-12-27 08:01:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:56,868 INFO L462 AbstractCegarLoop]: Abstraction has 21770 states and 68176 transitions. [2019-12-27 08:01:56,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 08:01:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 21770 states and 68176 transitions. [2019-12-27 08:01:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 08:01:56,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:56,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:56,892 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1161277663, now seen corresponding path program 3 times [2019-12-27 08:01:56,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:56,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701573059] [2019-12-27 08:01:56,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:01:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:01:57,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701573059] [2019-12-27 08:01:57,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:01:57,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:01:57,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329760266] [2019-12-27 08:01:57,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:01:57,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:01:57,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:01:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:01:57,018 INFO L87 Difference]: Start difference. First operand 21770 states and 68176 transitions. Second operand 6 states. [2019-12-27 08:01:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:01:57,182 INFO L93 Difference]: Finished difference Result 21557 states and 67352 transitions. [2019-12-27 08:01:57,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:01:57,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 08:01:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:01:57,214 INFO L225 Difference]: With dead ends: 21557 [2019-12-27 08:01:57,214 INFO L226 Difference]: Without dead ends: 21557 [2019-12-27 08:01:57,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:01:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21557 states. [2019-12-27 08:01:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21557 to 15555. [2019-12-27 08:01:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15555 states. [2019-12-27 08:01:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15555 states to 15555 states and 47761 transitions. [2019-12-27 08:01:57,843 INFO L78 Accepts]: Start accepts. Automaton has 15555 states and 47761 transitions. Word has length 67 [2019-12-27 08:01:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:01:57,843 INFO L462 AbstractCegarLoop]: Abstraction has 15555 states and 47761 transitions. [2019-12-27 08:01:57,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:01:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15555 states and 47761 transitions. [2019-12-27 08:01:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 08:01:57,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:01:57,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:01:57,857 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:01:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:01:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1753967852, now seen corresponding path program 2 times [2019-12-27 08:01:57,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:01:57,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126695354] [2019-12-27 08:01:57,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:01:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:01:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:01:57,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:01:57,981 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:01:57,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_23) (= 0 v_~y$w_buff1~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_75 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2402~0.base_27|) (= v_~__unbuffered_p2_EBX~0_16 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2402~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2402~0.base_27|) |v_ULTIMATE.start_main_~#t2402~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_34) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd0~0_22 0) (= 0 v_~y$r_buff1_thd2~0_19) (= 0 v_~y$w_buff0~0_29) (= 0 v_~y$flush_delayed~0_13) (= v_~y~0_28 0) (= 0 v_~y$r_buff1_thd3~0_49) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_4|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2402~0.base_27| 4)) (= v_~x~0_18 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t2402~0.base_27| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t2402~0.base_27|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd1~0_19) (= v_~y$w_buff0_used~0_118 0) (= v_~y$r_buff0_thd3~0_78 0) (= 0 |v_ULTIMATE.start_main_~#t2402~0.offset_20|) (= |v_#NULL.offset_4| 0) (= v_~y$mem_tmp~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y$r_buff0_thd1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ULTIMATE.start_main_~#t2403~0.offset=|v_ULTIMATE.start_main_~#t2403~0.offset_19|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_24|, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_49, ULTIMATE.start_main_~#t2402~0.offset=|v_ULTIMATE.start_main_~#t2402~0.offset_20|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t2403~0.base=|v_ULTIMATE.start_main_~#t2403~0.base_25|, ~y~0=v_~y~0_28, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t2402~0.base=|v_ULTIMATE.start_main_~#t2402~0.base_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t2404~0.offset=|v_ULTIMATE.start_main_~#t2404~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2404~0.base=|v_ULTIMATE.start_main_~#t2404~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_60|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_23, ~x~0=v_~x~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2403~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2402~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2403~0.base, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t2402~0.base, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t2404~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2404~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:01:57,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L815-1-->L817: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2403~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2403~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2403~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2403~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2403~0.base_11|) |v_ULTIMATE.start_main_~#t2403~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2403~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2403~0.base_11|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2403~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2403~0.offset=|v_ULTIMATE.start_main_~#t2403~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2403~0.base=|v_ULTIMATE.start_main_~#t2403~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2403~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2403~0.base] because there is no mapped edge [2019-12-27 08:01:57,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_18 v_~y$w_buff1~0_15) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~y$w_buff1_used~0_53 v_~y$w_buff0_used~0_85) (= 1 v_~y$w_buff0_used~0_84) (= 1 v_~y$w_buff0~0_17) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= (mod v_~y$w_buff1_used~0_53 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_53} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:01:57,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2404~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t2404~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2404~0.base_11|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2404~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2404~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2404~0.base_11|) |v_ULTIMATE.start_main_~#t2404~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2404~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2404~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2404~0.base=|v_ULTIMATE.start_main_~#t2404~0.base_11|, ULTIMATE.start_main_~#t2404~0.offset=|v_ULTIMATE.start_main_~#t2404~0.offset_10|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2404~0.base, ULTIMATE.start_main_~#t2404~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 08:01:57,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L782-->L782-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1909966549 256)))) (or (and (= ~y$w_buff1~0_In1909966549 |P2Thread1of1ForFork2_#t~ite24_Out1909966549|) (= |P2Thread1of1ForFork2_#t~ite23_In1909966549| |P2Thread1of1ForFork2_#t~ite23_Out1909966549|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite23_Out1909966549| |P2Thread1of1ForFork2_#t~ite24_Out1909966549|) (= ~y$w_buff1~0_In1909966549 |P2Thread1of1ForFork2_#t~ite23_Out1909966549|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1909966549 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In1909966549 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1909966549 256))) (= 0 (mod ~y$w_buff0_used~0_In1909966549 256)))) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1909966549|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1909966549, ~y$w_buff1~0=~y$w_buff1~0_In1909966549, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1909966549, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1909966549, ~weak$$choice2~0=~weak$$choice2~0_In1909966549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909966549} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1909966549|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1909966549|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1909966549, ~y$w_buff1~0=~y$w_buff1~0_In1909966549, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1909966549, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1909966549, ~weak$$choice2~0=~weak$$choice2~0_In1909966549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909966549} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 08:01:57,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1605034639 256) 0))) (or (and (= ~y$w_buff0_used~0_In1605034639 |P2Thread1of1ForFork2_#t~ite27_Out1605034639|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In1605034639| |P2Thread1of1ForFork2_#t~ite26_Out1605034639|)) (and (= |P2Thread1of1ForFork2_#t~ite27_Out1605034639| |P2Thread1of1ForFork2_#t~ite26_Out1605034639|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1605034639 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1605034639 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1605034639 256))) (= (mod ~y$w_buff0_used~0_In1605034639 256) 0))) (= ~y$w_buff0_used~0_In1605034639 |P2Thread1of1ForFork2_#t~ite26_Out1605034639|) .cse0))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1605034639, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1605034639|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1605034639, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1605034639, ~weak$$choice2~0=~weak$$choice2~0_In1605034639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1605034639} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1605034639|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1605034639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1605034639, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1605034639, ~weak$$choice2~0=~weak$$choice2~0_In1605034639, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1605034639|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1605034639} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 08:01:57,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L784-->L784-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-792519475 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-792519475 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-792519475 256))) (= (mod ~y$w_buff0_used~0_In-792519475 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-792519475 256))))) .cse1 (= |P2Thread1of1ForFork2_#t~ite30_Out-792519475| |P2Thread1of1ForFork2_#t~ite29_Out-792519475|) (= |P2Thread1of1ForFork2_#t~ite29_Out-792519475| ~y$w_buff1_used~0_In-792519475)) (and (= |P2Thread1of1ForFork2_#t~ite30_Out-792519475| ~y$w_buff1_used~0_In-792519475) (= |P2Thread1of1ForFork2_#t~ite29_In-792519475| |P2Thread1of1ForFork2_#t~ite29_Out-792519475|) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-792519475, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-792519475, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-792519475, ~weak$$choice2~0=~weak$$choice2~0_In-792519475, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-792519475|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-792519475} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-792519475, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-792519475, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-792519475|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-792519475, ~weak$$choice2~0=~weak$$choice2~0_In-792519475, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-792519475|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-792519475} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 08:01:57,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd3~0_57 v_~y$r_buff0_thd3~0_56)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_56, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 08:01:57,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_22 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 08:01:57,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-426298473 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-426298473 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-426298473| ~y~0_In-426298473)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-426298473| ~y$w_buff1~0_In-426298473) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-426298473, ~y$w_buff1~0=~y$w_buff1~0_In-426298473, ~y~0=~y~0_In-426298473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-426298473} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-426298473, ~y$w_buff1~0=~y$w_buff1~0_In-426298473, ~y~0=~y~0_In-426298473, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-426298473|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-426298473} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 08:01:57,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-579357199 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-579357199 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-579357199| ~y$w_buff0_used~0_In-579357199)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-579357199| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-579357199, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-579357199} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-579357199|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-579357199, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-579357199} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 08:01:57,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-990401802 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-990401802 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-990401802 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-990401802 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-990401802 |P0Thread1of1ForFork0_#t~ite6_Out-990401802|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-990401802|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-990401802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-990401802, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-990401802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-990401802} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-990401802|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-990401802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-990401802, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-990401802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-990401802} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 08:01:57,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-998331752 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-998331752| |P1Thread1of1ForFork1_#t~ite10_Out-998331752|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-998331752 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-998331752 |P1Thread1of1ForFork1_#t~ite9_Out-998331752|) .cse2) (and (not .cse0) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-998331752| ~y$w_buff1~0_In-998331752) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-998331752, ~y$w_buff1~0=~y$w_buff1~0_In-998331752, ~y~0=~y~0_In-998331752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-998331752} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-998331752, ~y$w_buff1~0=~y$w_buff1~0_In-998331752, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-998331752|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-998331752|, ~y~0=~y~0_In-998331752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-998331752} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 08:01:57,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= |v_P2Thread1of1ForFork2_#t~ite38_8| v_~y~0_19) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_8|} OutVars{~y~0=v_~y~0_19, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_7|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 08:01:57,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In204291476 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In204291476 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out204291476|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In204291476 |P2Thread1of1ForFork2_#t~ite40_Out204291476|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In204291476, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In204291476} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In204291476, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In204291476, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out204291476|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 08:01:57,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In85117382 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In85117382 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In85117382 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In85117382 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In85117382 |P2Thread1of1ForFork2_#t~ite41_Out85117382|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out85117382|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In85117382, ~y$w_buff0_used~0=~y$w_buff0_used~0_In85117382, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In85117382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In85117382} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In85117382, ~y$w_buff0_used~0=~y$w_buff0_used~0_In85117382, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out85117382|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In85117382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In85117382} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 08:01:57,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1495880252 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1495880252 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1495880252| ~y$r_buff0_thd3~0_In-1495880252)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-1495880252| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1495880252, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1495880252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1495880252, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1495880252|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1495880252} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 08:01:58,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1025829698 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1025829698 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1025829698 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1025829698 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-1025829698 |P2Thread1of1ForFork2_#t~ite43_Out-1025829698|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-1025829698|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1025829698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1025829698, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1025829698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1025829698} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1025829698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1025829698, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1025829698, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1025829698|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1025829698} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 08:01:58,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~y$r_buff1_thd3~0_45) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 08:01:58,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In242572667 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In242572667 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out242572667 ~y$r_buff0_thd1~0_In242572667) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out242572667 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In242572667, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In242572667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In242572667, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out242572667|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out242572667} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 08:01:58,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1619417972 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1619417972 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1619417972 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1619417972 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1619417972|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1619417972| ~y$r_buff1_thd1~0_In-1619417972) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1619417972, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1619417972, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1619417972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1619417972} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1619417972, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1619417972, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1619417972|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1619417972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1619417972} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 08:01:58,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_15) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 08:01:58,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1496615929 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1496615929 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1496615929|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1496615929 |P1Thread1of1ForFork1_#t~ite11_Out1496615929|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1496615929, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1496615929} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1496615929, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1496615929, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1496615929|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 08:01:58,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1306175345 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1306175345 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1306175345 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1306175345 256) 0))) (or (and (= ~y$w_buff1_used~0_In1306175345 |P1Thread1of1ForFork1_#t~ite12_Out1306175345|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1306175345|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1306175345, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1306175345, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1306175345, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1306175345} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1306175345, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1306175345, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1306175345, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1306175345|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1306175345} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 08:01:58,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2007942353 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In2007942353 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In2007942353 |P1Thread1of1ForFork1_#t~ite13_Out2007942353|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out2007942353|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2007942353, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2007942353} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2007942353, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2007942353, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2007942353|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 08:01:58,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2092395567 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2092395567 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-2092395567 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-2092395567 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-2092395567 |P1Thread1of1ForFork1_#t~ite14_Out-2092395567|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2092395567|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2092395567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2092395567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2092395567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2092395567} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2092395567, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2092395567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2092395567, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2092395567|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2092395567} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 08:01:58,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L763-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 08:01:58,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$r_buff0_thd0~0_14 256) 0) (= 0 (mod v_~y$w_buff0_used~0_86 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 08:01:58,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1801455575 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1801455575 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1801455575| ~y~0_In-1801455575)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1801455575| ~y$w_buff1~0_In-1801455575) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1801455575, ~y~0=~y~0_In-1801455575, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1801455575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1801455575} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1801455575, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1801455575|, ~y~0=~y~0_In-1801455575, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1801455575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1801455575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 08:01:58,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-27 08:01:58,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-320684106 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-320684106 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-320684106| ~y$w_buff0_used~0_In-320684106)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-320684106| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-320684106, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-320684106} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-320684106, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-320684106, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-320684106|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 08:01:58,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1806048821 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1806048821 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1806048821 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1806048821 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1806048821|)) (and (= ~y$w_buff1_used~0_In1806048821 |ULTIMATE.start_main_#t~ite50_Out1806048821|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1806048821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1806048821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1806048821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1806048821} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1806048821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1806048821, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1806048821, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1806048821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1806048821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 08:01:58,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1082373837 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1082373837 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1082373837| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1082373837| ~y$r_buff0_thd0~0_In-1082373837) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082373837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1082373837} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1082373837|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082373837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1082373837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 08:01:58,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-435756992 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-435756992 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-435756992 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-435756992 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-435756992|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-435756992| ~y$r_buff1_thd0~0_In-435756992) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-435756992, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-435756992, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-435756992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-435756992} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-435756992|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-435756992, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-435756992, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-435756992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-435756992} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 08:01:58,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_10 256)) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~y$r_buff1_thd0~0_15) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~__unbuffered_p2_EAX~0_9 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~x~0_12 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~x~0=v_~x~0_12, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:01:58,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:01:58 BasicIcfg [2019-12-27 08:01:58,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:01:58,109 INFO L168 Benchmark]: Toolchain (without parser) took 123522.90 ms. Allocated memory was 139.5 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 103.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 08:01:58,110 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 08:01:58,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.16 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 102.8 MB in the beginning and 155.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:01:58,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.83 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:01:58,111 INFO L168 Benchmark]: Boogie Preprocessor took 40.03 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:01:58,111 INFO L168 Benchmark]: RCFGBuilder took 969.51 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 100.7 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 08:01:58,115 INFO L168 Benchmark]: TraceAbstraction took 121637.96 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 100.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 08:01:58,117 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.16 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 102.8 MB in the beginning and 155.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.83 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.03 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 969.51 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 100.7 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121637.96 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 100.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 174 ProgramPointsBefore, 95 ProgramPointsAfterwards, 211 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 31 ChoiceCompositions, 6393 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81281 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2402, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2403, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2404, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 121.3s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 45.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7055 SDtfs, 10414 SDslu, 23908 SDs, 0 SdLazy, 19198 SolverSat, 635 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 60 SyntacticMatches, 30 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3411 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161396occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 269934 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1475 NumberOfCodeBlocks, 1475 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1377 ConstructedInterpolants, 0 QuantifiedInterpolants, 308514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...