/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/mix024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:51:50,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:51:50,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:51:50,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:51:50,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:51:50,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:51:50,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:51:50,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:51:50,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:51:50,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:51:50,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:51:50,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:51:50,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:51:50,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:51:50,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:51:50,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:51:50,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:51:50,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:51:50,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:51:50,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:51:50,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:51:50,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:51:50,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:51:50,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:51:50,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:51:50,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:51:50,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:51:50,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:51:50,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:51:50,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:51:50,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:51:50,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:51:50,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:51:50,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:51:50,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:51:50,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:51:50,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:51:50,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:51:50,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:51:50,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:51:50,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:51:50,392 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 05:51:50,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:51:50,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:51:50,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:51:50,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:51:50,429 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:51:50,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:51:50,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:51:50,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:51:50,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:51:50,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:51:50,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:51:50,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:51:50,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:51:50,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:51:50,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:51:50,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:51:50,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:51:50,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:51:50,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:51:50,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:51:50,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:51:50,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:51:50,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:51:50,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:51:50,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:51:50,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:51:50,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:51:50,437 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:51:50,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:51:50,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:51:50,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:51:50,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:51:50,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:51:50,732 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:51:50,733 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:51:50,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-27 05:51:50,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc35a22f/9235fed4b8e74f86977507938c2ced27/FLAGc31e2d3d8 [2019-12-27 05:51:51,381 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:51:51,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-27 05:51:51,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc35a22f/9235fed4b8e74f86977507938c2ced27/FLAGc31e2d3d8 [2019-12-27 05:51:51,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dc35a22f/9235fed4b8e74f86977507938c2ced27 [2019-12-27 05:51:51,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:51:51,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:51:51,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:51:51,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:51:51,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:51:51,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:51:51" (1/1) ... [2019-12-27 05:51:51,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:51, skipping insertion in model container [2019-12-27 05:51:51,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:51:51" (1/1) ... [2019-12-27 05:51:51,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:51:51,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:51:52,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:51:52,374 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:51:52,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:51:52,538 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:51:52,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52 WrapperNode [2019-12-27 05:51:52,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:51:52,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:51:52,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:51:52,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:51:52,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:51:52,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:51:52,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:51:52,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:51:52,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (1/1) ... [2019-12-27 05:51:52,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:51:52,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:51:52,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:51:52,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:51:52,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (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 05:51:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:51:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:51:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:51:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:51:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:51:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:51:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:51:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:51:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:51:52,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:51:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:51:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:51:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:51:52,745 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 05:51:53,479 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:51:53,479 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:51:53,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:51:53 BoogieIcfgContainer [2019-12-27 05:51:53,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:51:53,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:51:53,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:51:53,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:51:53,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:51:51" (1/3) ... [2019-12-27 05:51:53,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f3aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:51:53, skipping insertion in model container [2019-12-27 05:51:53,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:51:52" (2/3) ... [2019-12-27 05:51:53,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f3aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:51:53, skipping insertion in model container [2019-12-27 05:51:53,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:51:53" (3/3) ... [2019-12-27 05:51:53,489 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.opt.i [2019-12-27 05:51:53,497 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:51:53,497 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:51:53,506 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:51:53,507 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:51:53,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,587 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,587 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,622 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,630 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,630 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:51:53,645 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:51:53,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:51:53,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:51:53,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:51:53,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:51:53,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:51:53,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:51:53,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:51:53,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:51:53,689 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 05:51:53,691 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 05:51:53,813 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 05:51:53,814 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:51:53,829 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 05:51:53,852 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 05:51:53,905 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 05:51:53,905 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:51:53,913 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 05:51:53,933 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 05:51:53,935 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:51:57,730 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 05:51:57,894 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 05:51:57,923 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-27 05:51:57,926 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 05:51:57,929 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 05:52:07,595 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 05:52:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 05:52:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 05:52:07,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:07,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 05:52:07,605 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:07,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-27 05:52:07,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:07,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299119998] [2019-12-27 05:52:07,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:07,837 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 05:52:07,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299119998] [2019-12-27 05:52:07,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:07,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:52:07,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518158093] [2019-12-27 05:52:07,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:07,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:07,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:07,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:07,856 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 05:52:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:10,983 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 05:52:10,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:10,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 05:52:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:11,537 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 05:52:11,537 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 05:52:11,538 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 05:52:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 05:52:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 05:52:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 05:52:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 05:52:21,111 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 05:52:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:21,111 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 05:52:21,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 05:52:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:52:21,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:21,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:21,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-27 05:52:21,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:21,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676135803] [2019-12-27 05:52:21,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:21,212 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 05:52:21,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676135803] [2019-12-27 05:52:21,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:21,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:21,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176531386] [2019-12-27 05:52:21,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:21,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:21,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:21,216 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 05:52:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:21,447 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 05:52:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:21,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:52:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:21,533 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 05:52:21,533 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 05:52:21,534 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 05:52:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 05:52:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 05:52:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 05:52:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 05:52:22,024 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 05:52:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:22,024 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 05:52:22,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 05:52:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:52:22,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:22,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:22,026 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-27 05:52:22,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:22,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995061707] [2019-12-27 05:52:22,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:22,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 05:52:22,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995061707] [2019-12-27 05:52:22,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:22,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:22,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467286733] [2019-12-27 05:52:22,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:52:22,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:22,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:52:22,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:22,139 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 05:52:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:22,509 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 05:52:22,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:52:22,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 05:52:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:22,595 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 05:52:22,596 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 05:52:22,596 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 05:52:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 05:52:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 05:52:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 05:52:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 05:52:23,925 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 05:52:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:23,926 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 05:52:23,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:52:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 05:52:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:52:23,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:23,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:23,929 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:23,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-27 05:52:23,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:23,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255853435] [2019-12-27 05:52:23,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:23,990 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 05:52:23,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255853435] [2019-12-27 05:52:23,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:23,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:23,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146917549] [2019-12-27 05:52:23,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:52:23,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:52:23,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:23,996 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-27 05:52:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:24,318 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 05:52:24,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:52:24,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:52:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:24,403 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 05:52:24,403 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 05:52:24,404 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 05:52:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 05:52:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 05:52:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 05:52:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 05:52:25,512 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 05:52:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:25,512 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 05:52:25,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:52:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 05:52:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:52:25,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:25,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:25,514 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-27 05:52:25,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:25,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949411760] [2019-12-27 05:52:25,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:25,575 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 05:52:25,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949411760] [2019-12-27 05:52:25,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:25,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:25,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334546094] [2019-12-27 05:52:25,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:52:25,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:52:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:25,578 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-27 05:52:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:25,892 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 05:52:25,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:52:25,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:52:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:25,983 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 05:52:25,983 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 05:52:25,984 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 05:52:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 05:52:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 05:52:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 05:52:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 05:52:26,932 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 05:52:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:26,933 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 05:52:26,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:52:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 05:52:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:52:26,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:26,944 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 05:52:26,944 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-27 05:52:26,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:26,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139061524] [2019-12-27 05:52:26,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:27,067 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 05:52:27,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139061524] [2019-12-27 05:52:27,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:27,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:52:27,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030652753] [2019-12-27 05:52:27,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:52:27,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:52:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:27,069 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 05:52:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:27,666 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 05:52:27,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:52:27,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:52:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:27,743 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 05:52:27,744 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 05:52:27,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 05:52:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 05:52:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 05:52:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 05:52:28,716 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 05:52:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:28,716 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 05:52:28,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:52:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 05:52:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:52:28,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:28,726 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 05:52:28,726 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-27 05:52:28,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:28,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476429680] [2019-12-27 05:52:28,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:28,799 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 05:52:28,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476429680] [2019-12-27 05:52:28,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:28,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:52:28,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452943426] [2019-12-27 05:52:28,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:52:28,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:28,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:52:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:28,802 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 05:52:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:29,368 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 05:52:29,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:52:29,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:52:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:29,451 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 05:52:29,451 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 05:52:29,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 05:52:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 05:52:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 05:52:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 05:52:30,368 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 05:52:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:30,368 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 05:52:30,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:52:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 05:52:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:52:30,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:30,379 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 05:52:30,379 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-27 05:52:30,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:30,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474585117] [2019-12-27 05:52:30,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:30,432 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 05:52:30,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474585117] [2019-12-27 05:52:30,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:30,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:52:30,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850711380] [2019-12-27 05:52:30,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:52:30,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:30,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:52:30,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:30,434 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 05:52:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:30,507 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 05:52:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:52:30,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:52:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:30,531 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 05:52:30,532 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 05:52:30,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:52:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 05:52:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 05:52:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 05:52:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 05:52:30,777 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 05:52:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:30,777 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 05:52:30,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:52:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 05:52:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:52:30,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:30,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:30,799 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-27 05:52:30,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:30,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079563206] [2019-12-27 05:52:30,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:30,877 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 05:52:30,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079563206] [2019-12-27 05:52:30,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:30,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:52:30,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344913102] [2019-12-27 05:52:30,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:30,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:30,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:30,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:30,879 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 05:52:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:30,918 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-27 05:52:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:30,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:52:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:30,936 INFO L225 Difference]: With dead ends: 11488 [2019-12-27 05:52:30,936 INFO L226 Difference]: Without dead ends: 11488 [2019-12-27 05:52:30,937 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 05:52:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-27 05:52:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-27 05:52:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-27 05:52:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-27 05:52:31,094 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-27 05:52:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:31,095 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-27 05:52:31,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-27 05:52:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:52:31,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:31,111 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 05:52:31,112 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-27 05:52:31,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:31,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340983081] [2019-12-27 05:52:31,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:31,201 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 05:52:31,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340983081] [2019-12-27 05:52:31,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:31,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:52:31,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146218912] [2019-12-27 05:52:31,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:52:31,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:31,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:52:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:31,203 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-27 05:52:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:31,727 INFO L93 Difference]: Finished difference Result 17261 states and 52536 transitions. [2019-12-27 05:52:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:52:31,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:52:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:31,752 INFO L225 Difference]: With dead ends: 17261 [2019-12-27 05:52:31,752 INFO L226 Difference]: Without dead ends: 17261 [2019-12-27 05:52:31,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 05:52:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17261 states. [2019-12-27 05:52:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17261 to 15423. [2019-12-27 05:52:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15423 states. [2019-12-27 05:52:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15423 states to 15423 states and 47364 transitions. [2019-12-27 05:52:32,069 INFO L78 Accepts]: Start accepts. Automaton has 15423 states and 47364 transitions. Word has length 40 [2019-12-27 05:52:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:32,069 INFO L462 AbstractCegarLoop]: Abstraction has 15423 states and 47364 transitions. [2019-12-27 05:52:32,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:52:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15423 states and 47364 transitions. [2019-12-27 05:52:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:52:32,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:32,091 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 05:52:32,091 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1253428480, now seen corresponding path program 2 times [2019-12-27 05:52:32,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:32,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419668801] [2019-12-27 05:52:32,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:32,230 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 05:52:32,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419668801] [2019-12-27 05:52:32,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:32,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:52:32,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378183310] [2019-12-27 05:52:32,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:52:32,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:32,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:52:32,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:52:32,232 INFO L87 Difference]: Start difference. First operand 15423 states and 47364 transitions. Second operand 6 states. [2019-12-27 05:52:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:33,043 INFO L93 Difference]: Finished difference Result 28477 states and 87094 transitions. [2019-12-27 05:52:33,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:52:33,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 05:52:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:33,089 INFO L225 Difference]: With dead ends: 28477 [2019-12-27 05:52:33,089 INFO L226 Difference]: Without dead ends: 28477 [2019-12-27 05:52:33,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28477 states. [2019-12-27 05:52:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28477 to 17256. [2019-12-27 05:52:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17256 states. [2019-12-27 05:52:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17256 states to 17256 states and 53163 transitions. [2019-12-27 05:52:33,426 INFO L78 Accepts]: Start accepts. Automaton has 17256 states and 53163 transitions. Word has length 40 [2019-12-27 05:52:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:33,426 INFO L462 AbstractCegarLoop]: Abstraction has 17256 states and 53163 transitions. [2019-12-27 05:52:33,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:52:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17256 states and 53163 transitions. [2019-12-27 05:52:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:52:33,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:33,452 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 05:52:33,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1511982952, now seen corresponding path program 3 times [2019-12-27 05:52:33,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:33,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185234356] [2019-12-27 05:52:33,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:33,509 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 05:52:33,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185234356] [2019-12-27 05:52:33,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:33,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:52:33,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616972630] [2019-12-27 05:52:33,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:52:33,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:52:33,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:33,511 INFO L87 Difference]: Start difference. First operand 17256 states and 53163 transitions. Second operand 5 states. [2019-12-27 05:52:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:33,598 INFO L93 Difference]: Finished difference Result 15919 states and 49702 transitions. [2019-12-27 05:52:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:52:33,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:52:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:33,630 INFO L225 Difference]: With dead ends: 15919 [2019-12-27 05:52:33,630 INFO L226 Difference]: Without dead ends: 15919 [2019-12-27 05:52:33,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:52:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15919 states. [2019-12-27 05:52:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15919 to 15040. [2019-12-27 05:52:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15040 states. [2019-12-27 05:52:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15040 states to 15040 states and 47234 transitions. [2019-12-27 05:52:34,012 INFO L78 Accepts]: Start accepts. Automaton has 15040 states and 47234 transitions. Word has length 40 [2019-12-27 05:52:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:34,012 INFO L462 AbstractCegarLoop]: Abstraction has 15040 states and 47234 transitions. [2019-12-27 05:52:34,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:52:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15040 states and 47234 transitions. [2019-12-27 05:52:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:34,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:34,043 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] [2019-12-27 05:52:34,043 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-27 05:52:34,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:34,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725836136] [2019-12-27 05:52:34,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:34,096 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 05:52:34,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725836136] [2019-12-27 05:52:34,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:34,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:52:34,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074031077] [2019-12-27 05:52:34,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:34,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:34,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:34,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:34,098 INFO L87 Difference]: Start difference. First operand 15040 states and 47234 transitions. Second operand 3 states. [2019-12-27 05:52:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:34,352 INFO L93 Difference]: Finished difference Result 18782 states and 58182 transitions. [2019-12-27 05:52:34,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:34,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 05:52:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:34,390 INFO L225 Difference]: With dead ends: 18782 [2019-12-27 05:52:34,390 INFO L226 Difference]: Without dead ends: 18782 [2019-12-27 05:52:34,390 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 05:52:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18782 states. [2019-12-27 05:52:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18782 to 15823. [2019-12-27 05:52:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15823 states. [2019-12-27 05:52:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15823 states to 15823 states and 49541 transitions. [2019-12-27 05:52:34,729 INFO L78 Accepts]: Start accepts. Automaton has 15823 states and 49541 transitions. Word has length 54 [2019-12-27 05:52:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:34,730 INFO L462 AbstractCegarLoop]: Abstraction has 15823 states and 49541 transitions. [2019-12-27 05:52:34,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 15823 states and 49541 transitions. [2019-12-27 05:52:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:34,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:34,749 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] [2019-12-27 05:52:34,750 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-27 05:52:34,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:34,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7750170] [2019-12-27 05:52:34,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:52:34,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7750170] [2019-12-27 05:52:34,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:34,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:52:34,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408890192] [2019-12-27 05:52:34,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:52:34,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:34,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:52:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:52:34,838 INFO L87 Difference]: Start difference. First operand 15823 states and 49541 transitions. Second operand 7 states. [2019-12-27 05:52:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:35,394 INFO L93 Difference]: Finished difference Result 39558 states and 123147 transitions. [2019-12-27 05:52:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:52:35,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 05:52:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:35,465 INFO L225 Difference]: With dead ends: 39558 [2019-12-27 05:52:35,466 INFO L226 Difference]: Without dead ends: 30506 [2019-12-27 05:52:35,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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 05:52:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30506 states. [2019-12-27 05:52:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30506 to 19409. [2019-12-27 05:52:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19409 states. [2019-12-27 05:52:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19409 states to 19409 states and 60921 transitions. [2019-12-27 05:52:36,031 INFO L78 Accepts]: Start accepts. Automaton has 19409 states and 60921 transitions. Word has length 54 [2019-12-27 05:52:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:36,031 INFO L462 AbstractCegarLoop]: Abstraction has 19409 states and 60921 transitions. [2019-12-27 05:52:36,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:52:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 19409 states and 60921 transitions. [2019-12-27 05:52:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:36,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:36,063 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] [2019-12-27 05:52:36,063 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:36,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:36,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-27 05:52:36,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:36,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684865640] [2019-12-27 05:52:36,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:36,143 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 05:52:36,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684865640] [2019-12-27 05:52:36,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:36,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:52:36,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705251136] [2019-12-27 05:52:36,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:52:36,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:36,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:52:36,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:52:36,145 INFO L87 Difference]: Start difference. First operand 19409 states and 60921 transitions. Second operand 7 states. [2019-12-27 05:52:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:36,744 INFO L93 Difference]: Finished difference Result 46087 states and 141926 transitions. [2019-12-27 05:52:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:52:36,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 05:52:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:36,818 INFO L225 Difference]: With dead ends: 46087 [2019-12-27 05:52:36,819 INFO L226 Difference]: Without dead ends: 34024 [2019-12-27 05:52:36,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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 05:52:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34024 states. [2019-12-27 05:52:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34024 to 23243. [2019-12-27 05:52:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23243 states. [2019-12-27 05:52:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23243 states to 23243 states and 72679 transitions. [2019-12-27 05:52:37,290 INFO L78 Accepts]: Start accepts. Automaton has 23243 states and 72679 transitions. Word has length 54 [2019-12-27 05:52:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:37,290 INFO L462 AbstractCegarLoop]: Abstraction has 23243 states and 72679 transitions. [2019-12-27 05:52:37,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:52:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 23243 states and 72679 transitions. [2019-12-27 05:52:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:37,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:37,329 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] [2019-12-27 05:52:37,329 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -229272590, now seen corresponding path program 3 times [2019-12-27 05:52:37,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:37,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353964375] [2019-12-27 05:52:37,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:37,460 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 05:52:37,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353964375] [2019-12-27 05:52:37,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:37,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:52:37,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116874670] [2019-12-27 05:52:37,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:52:37,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:52:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:37,464 INFO L87 Difference]: Start difference. First operand 23243 states and 72679 transitions. Second operand 9 states. [2019-12-27 05:52:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:39,193 INFO L93 Difference]: Finished difference Result 122841 states and 378489 transitions. [2019-12-27 05:52:39,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 05:52:39,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 05:52:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:39,708 INFO L225 Difference]: With dead ends: 122841 [2019-12-27 05:52:39,708 INFO L226 Difference]: Without dead ends: 106010 [2019-12-27 05:52:39,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 05:52:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106010 states. [2019-12-27 05:52:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106010 to 32021. [2019-12-27 05:52:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32021 states. [2019-12-27 05:52:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32021 states to 32021 states and 101115 transitions. [2019-12-27 05:52:40,755 INFO L78 Accepts]: Start accepts. Automaton has 32021 states and 101115 transitions. Word has length 54 [2019-12-27 05:52:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:40,755 INFO L462 AbstractCegarLoop]: Abstraction has 32021 states and 101115 transitions. [2019-12-27 05:52:40,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:52:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 32021 states and 101115 transitions. [2019-12-27 05:52:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:40,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:40,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:52:40,792 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1063097586, now seen corresponding path program 4 times [2019-12-27 05:52:40,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:40,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477439436] [2019-12-27 05:52:40,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:40,905 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 05:52:40,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477439436] [2019-12-27 05:52:40,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:40,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:52:40,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753764389] [2019-12-27 05:52:40,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:52:40,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:40,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:52:40,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:40,909 INFO L87 Difference]: Start difference. First operand 32021 states and 101115 transitions. Second operand 9 states. [2019-12-27 05:52:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:42,620 INFO L93 Difference]: Finished difference Result 96459 states and 297039 transitions. [2019-12-27 05:52:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 05:52:42,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 05:52:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:42,763 INFO L225 Difference]: With dead ends: 96459 [2019-12-27 05:52:42,763 INFO L226 Difference]: Without dead ends: 91853 [2019-12-27 05:52:42,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 05:52:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91853 states. [2019-12-27 05:52:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91853 to 31487. [2019-12-27 05:52:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31487 states. [2019-12-27 05:52:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31487 states to 31487 states and 99453 transitions. [2019-12-27 05:52:43,841 INFO L78 Accepts]: Start accepts. Automaton has 31487 states and 99453 transitions. Word has length 54 [2019-12-27 05:52:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:43,841 INFO L462 AbstractCegarLoop]: Abstraction has 31487 states and 99453 transitions. [2019-12-27 05:52:43,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:52:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 31487 states and 99453 transitions. [2019-12-27 05:52:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:43,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:43,878 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] [2019-12-27 05:52:43,878 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-27 05:52:43,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:43,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151888614] [2019-12-27 05:52:43,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:44,307 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 05:52:44,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151888614] [2019-12-27 05:52:44,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:44,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:52:44,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107093718] [2019-12-27 05:52:44,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:52:44,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:52:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:44,309 INFO L87 Difference]: Start difference. First operand 31487 states and 99453 transitions. Second operand 9 states. [2019-12-27 05:52:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:45,375 INFO L93 Difference]: Finished difference Result 38941 states and 118457 transitions. [2019-12-27 05:52:45,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:52:45,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 05:52:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:45,433 INFO L225 Difference]: With dead ends: 38941 [2019-12-27 05:52:45,433 INFO L226 Difference]: Without dead ends: 38843 [2019-12-27 05:52:45,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:52:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38843 states. [2019-12-27 05:52:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38843 to 28878. [2019-12-27 05:52:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28878 states. [2019-12-27 05:52:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28878 states to 28878 states and 89996 transitions. [2019-12-27 05:52:45,959 INFO L78 Accepts]: Start accepts. Automaton has 28878 states and 89996 transitions. Word has length 54 [2019-12-27 05:52:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:45,959 INFO L462 AbstractCegarLoop]: Abstraction has 28878 states and 89996 transitions. [2019-12-27 05:52:45,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:52:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 28878 states and 89996 transitions. [2019-12-27 05:52:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:45,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:45,992 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] [2019-12-27 05:52:45,992 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -623567340, now seen corresponding path program 6 times [2019-12-27 05:52:45,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:45,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961866525] [2019-12-27 05:52:45,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:46,138 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 05:52:46,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961866525] [2019-12-27 05:52:46,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:46,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:52:46,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760614966] [2019-12-27 05:52:46,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:52:46,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:46,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:52:46,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:52:46,140 INFO L87 Difference]: Start difference. First operand 28878 states and 89996 transitions. Second operand 8 states. [2019-12-27 05:52:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:47,149 INFO L93 Difference]: Finished difference Result 37249 states and 113806 transitions. [2019-12-27 05:52:47,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:52:47,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 05:52:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:47,210 INFO L225 Difference]: With dead ends: 37249 [2019-12-27 05:52:47,210 INFO L226 Difference]: Without dead ends: 37249 [2019-12-27 05:52:47,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:52:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37249 states. [2019-12-27 05:52:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37249 to 28954. [2019-12-27 05:52:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28954 states. [2019-12-27 05:52:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28954 states to 28954 states and 90206 transitions. [2019-12-27 05:52:47,894 INFO L78 Accepts]: Start accepts. Automaton has 28954 states and 90206 transitions. Word has length 54 [2019-12-27 05:52:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:47,894 INFO L462 AbstractCegarLoop]: Abstraction has 28954 states and 90206 transitions. [2019-12-27 05:52:47,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:52:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28954 states and 90206 transitions. [2019-12-27 05:52:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:52:47,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:47,927 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] [2019-12-27 05:52:47,927 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:47,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash -365012868, now seen corresponding path program 7 times [2019-12-27 05:52:47,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:47,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378730907] [2019-12-27 05:52:47,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:47,983 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 05:52:47,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378730907] [2019-12-27 05:52:47,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:47,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:47,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559241764] [2019-12-27 05:52:47,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:47,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:47,985 INFO L87 Difference]: Start difference. First operand 28954 states and 90206 transitions. Second operand 3 states. [2019-12-27 05:52:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:48,107 INFO L93 Difference]: Finished difference Result 28952 states and 90201 transitions. [2019-12-27 05:52:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:48,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 05:52:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:48,150 INFO L225 Difference]: With dead ends: 28952 [2019-12-27 05:52:48,150 INFO L226 Difference]: Without dead ends: 28952 [2019-12-27 05:52:48,150 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 05:52:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28952 states. [2019-12-27 05:52:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28952 to 25714. [2019-12-27 05:52:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25714 states. [2019-12-27 05:52:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25714 states to 25714 states and 81262 transitions. [2019-12-27 05:52:48,555 INFO L78 Accepts]: Start accepts. Automaton has 25714 states and 81262 transitions. Word has length 54 [2019-12-27 05:52:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:48,555 INFO L462 AbstractCegarLoop]: Abstraction has 25714 states and 81262 transitions. [2019-12-27 05:52:48,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 25714 states and 81262 transitions. [2019-12-27 05:52:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 05:52:48,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:48,586 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] [2019-12-27 05:52:48,586 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1896131244, now seen corresponding path program 1 times [2019-12-27 05:52:48,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:48,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787971339] [2019-12-27 05:52:48,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:48,637 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 05:52:48,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787971339] [2019-12-27 05:52:48,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:48,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:52:48,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187020854] [2019-12-27 05:52:48,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:52:48,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:52:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:52:48,639 INFO L87 Difference]: Start difference. First operand 25714 states and 81262 transitions. Second operand 3 states. [2019-12-27 05:52:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:48,734 INFO L93 Difference]: Finished difference Result 22231 states and 69489 transitions. [2019-12-27 05:52:48,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:52:48,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 05:52:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:48,766 INFO L225 Difference]: With dead ends: 22231 [2019-12-27 05:52:48,766 INFO L226 Difference]: Without dead ends: 22231 [2019-12-27 05:52:48,767 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 05:52:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22231 states. [2019-12-27 05:52:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22231 to 19471. [2019-12-27 05:52:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19471 states. [2019-12-27 05:52:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19471 states to 19471 states and 60805 transitions. [2019-12-27 05:52:49,074 INFO L78 Accepts]: Start accepts. Automaton has 19471 states and 60805 transitions. Word has length 55 [2019-12-27 05:52:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:49,075 INFO L462 AbstractCegarLoop]: Abstraction has 19471 states and 60805 transitions. [2019-12-27 05:52:49,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:52:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 19471 states and 60805 transitions. [2019-12-27 05:52:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:52:49,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:49,100 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] [2019-12-27 05:52:49,100 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1578077188, now seen corresponding path program 1 times [2019-12-27 05:52:49,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:49,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313400770] [2019-12-27 05:52:49,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:49,453 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 05:52:49,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313400770] [2019-12-27 05:52:49,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:49,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:52:49,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898328663] [2019-12-27 05:52:49,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:52:49,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:49,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:52:49,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:52:49,457 INFO L87 Difference]: Start difference. First operand 19471 states and 60805 transitions. Second operand 9 states. [2019-12-27 05:52:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:50,786 INFO L93 Difference]: Finished difference Result 31793 states and 98353 transitions. [2019-12-27 05:52:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:52:50,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 05:52:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:50,825 INFO L225 Difference]: With dead ends: 31793 [2019-12-27 05:52:50,825 INFO L226 Difference]: Without dead ends: 25731 [2019-12-27 05:52:50,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:52:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25731 states. [2019-12-27 05:52:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25731 to 20042. [2019-12-27 05:52:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20042 states. [2019-12-27 05:52:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20042 states to 20042 states and 62234 transitions. [2019-12-27 05:52:51,176 INFO L78 Accepts]: Start accepts. Automaton has 20042 states and 62234 transitions. Word has length 56 [2019-12-27 05:52:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:51,177 INFO L462 AbstractCegarLoop]: Abstraction has 20042 states and 62234 transitions. [2019-12-27 05:52:51,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:52:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 20042 states and 62234 transitions. [2019-12-27 05:52:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:52:51,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:51,204 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] [2019-12-27 05:52:51,204 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:51,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 2 times [2019-12-27 05:52:51,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:51,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713078414] [2019-12-27 05:52:51,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:51,531 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 05:52:51,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713078414] [2019-12-27 05:52:51,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:51,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:52:51,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790668315] [2019-12-27 05:52:51,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 05:52:51,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 05:52:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:52:51,533 INFO L87 Difference]: Start difference. First operand 20042 states and 62234 transitions. Second operand 14 states. [2019-12-27 05:52:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:52:54,768 INFO L93 Difference]: Finished difference Result 29560 states and 90492 transitions. [2019-12-27 05:52:54,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 05:52:54,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 05:52:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:52:54,814 INFO L225 Difference]: With dead ends: 29560 [2019-12-27 05:52:54,814 INFO L226 Difference]: Without dead ends: 27326 [2019-12-27 05:52:54,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 05:52:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27326 states. [2019-12-27 05:52:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27326 to 20465. [2019-12-27 05:52:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20465 states. [2019-12-27 05:52:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20465 states to 20465 states and 63360 transitions. [2019-12-27 05:52:55,353 INFO L78 Accepts]: Start accepts. Automaton has 20465 states and 63360 transitions. Word has length 56 [2019-12-27 05:52:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:52:55,354 INFO L462 AbstractCegarLoop]: Abstraction has 20465 states and 63360 transitions. [2019-12-27 05:52:55,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 05:52:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 20465 states and 63360 transitions. [2019-12-27 05:52:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:52:55,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:52:55,379 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] [2019-12-27 05:52:55,379 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:52:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:52:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1830147234, now seen corresponding path program 3 times [2019-12-27 05:52:55,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:52:55,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874528555] [2019-12-27 05:52:55,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:52:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:52:55,815 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 05:52:55,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874528555] [2019-12-27 05:52:55,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:52:55,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:52:55,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317751981] [2019-12-27 05:52:55,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:52:55,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:52:55,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:52:55,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:52:55,818 INFO L87 Difference]: Start difference. First operand 20465 states and 63360 transitions. Second operand 15 states. [2019-12-27 05:53:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:00,707 INFO L93 Difference]: Finished difference Result 39045 states and 119328 transitions. [2019-12-27 05:53:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 05:53:00,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 05:53:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:00,764 INFO L225 Difference]: With dead ends: 39045 [2019-12-27 05:53:00,764 INFO L226 Difference]: Without dead ends: 38359 [2019-12-27 05:53:00,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=603, Invalid=3557, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 05:53:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38359 states. [2019-12-27 05:53:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38359 to 22956. [2019-12-27 05:53:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22956 states. [2019-12-27 05:53:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22956 states to 22956 states and 70959 transitions. [2019-12-27 05:53:01,401 INFO L78 Accepts]: Start accepts. Automaton has 22956 states and 70959 transitions. Word has length 56 [2019-12-27 05:53:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:53:01,401 INFO L462 AbstractCegarLoop]: Abstraction has 22956 states and 70959 transitions. [2019-12-27 05:53:01,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:53:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 22956 states and 70959 transitions. [2019-12-27 05:53:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:53:01,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:01,427 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] [2019-12-27 05:53:01,427 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:53:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash 457193928, now seen corresponding path program 4 times [2019-12-27 05:53:01,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:01,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898431489] [2019-12-27 05:53:01,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:53:01,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 05:53:01,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898431489] [2019-12-27 05:53:01,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:53:01,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:53:01,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387346480] [2019-12-27 05:53:01,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:53:01,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:53:01,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:53:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:53:01,941 INFO L87 Difference]: Start difference. First operand 22956 states and 70959 transitions. Second operand 16 states. [2019-12-27 05:53:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:05,578 INFO L93 Difference]: Finished difference Result 32278 states and 98192 transitions. [2019-12-27 05:53:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 05:53:05,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 05:53:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:05,624 INFO L225 Difference]: With dead ends: 32278 [2019-12-27 05:53:05,624 INFO L226 Difference]: Without dead ends: 30831 [2019-12-27 05:53:05,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=391, Invalid=1679, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 05:53:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30831 states. [2019-12-27 05:53:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30831 to 23174. [2019-12-27 05:53:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23174 states. [2019-12-27 05:53:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23174 states to 23174 states and 71655 transitions. [2019-12-27 05:53:06,025 INFO L78 Accepts]: Start accepts. Automaton has 23174 states and 71655 transitions. Word has length 56 [2019-12-27 05:53:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:53:06,025 INFO L462 AbstractCegarLoop]: Abstraction has 23174 states and 71655 transitions. [2019-12-27 05:53:06,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:53:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23174 states and 71655 transitions. [2019-12-27 05:53:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:53:06,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:06,300 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] [2019-12-27 05:53:06,300 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:53:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash 943954388, now seen corresponding path program 5 times [2019-12-27 05:53:06,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:06,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232799953] [2019-12-27 05:53:06,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:53:06,866 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 05:53:06,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232799953] [2019-12-27 05:53:06,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:53:06,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 05:53:06,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805746490] [2019-12-27 05:53:06,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 05:53:06,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:53:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 05:53:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:53:06,868 INFO L87 Difference]: Start difference. First operand 23174 states and 71655 transitions. Second operand 17 states. [2019-12-27 05:53:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:10,316 INFO L93 Difference]: Finished difference Result 27921 states and 85003 transitions. [2019-12-27 05:53:10,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 05:53:10,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 05:53:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:10,358 INFO L225 Difference]: With dead ends: 27921 [2019-12-27 05:53:10,358 INFO L226 Difference]: Without dead ends: 27247 [2019-12-27 05:53:10,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 05:53:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27247 states. [2019-12-27 05:53:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27247 to 23284. [2019-12-27 05:53:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23284 states. [2019-12-27 05:53:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 71938 transitions. [2019-12-27 05:53:10,767 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 71938 transitions. Word has length 56 [2019-12-27 05:53:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:53:10,767 INFO L462 AbstractCegarLoop]: Abstraction has 23284 states and 71938 transitions. [2019-12-27 05:53:10,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 05:53:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 71938 transitions. [2019-12-27 05:53:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:53:10,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:10,800 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] [2019-12-27 05:53:10,800 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:53:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash 230149148, now seen corresponding path program 6 times [2019-12-27 05:53:10,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:10,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559670142] [2019-12-27 05:53:10,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:53:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:53:11,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559670142] [2019-12-27 05:53:11,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:53:11,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:53:11,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305450767] [2019-12-27 05:53:11,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:53:11,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:53:11,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:53:11,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:53:11,160 INFO L87 Difference]: Start difference. First operand 23284 states and 71938 transitions. Second operand 15 states. [2019-12-27 05:53:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:15,203 INFO L93 Difference]: Finished difference Result 39432 states and 120507 transitions. [2019-12-27 05:53:15,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 05:53:15,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 05:53:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:15,264 INFO L225 Difference]: With dead ends: 39432 [2019-12-27 05:53:15,264 INFO L226 Difference]: Without dead ends: 39194 [2019-12-27 05:53:15,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=489, Invalid=2591, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 05:53:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39194 states. [2019-12-27 05:53:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39194 to 23562. [2019-12-27 05:53:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23562 states. [2019-12-27 05:53:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23562 states to 23562 states and 72744 transitions. [2019-12-27 05:53:15,742 INFO L78 Accepts]: Start accepts. Automaton has 23562 states and 72744 transitions. Word has length 56 [2019-12-27 05:53:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:53:15,742 INFO L462 AbstractCegarLoop]: Abstraction has 23562 states and 72744 transitions. [2019-12-27 05:53:15,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:53:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 23562 states and 72744 transitions. [2019-12-27 05:53:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:53:15,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:15,771 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] [2019-12-27 05:53:15,772 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:53:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1777476986, now seen corresponding path program 7 times [2019-12-27 05:53:15,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:15,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578360626] [2019-12-27 05:53:15,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:53:16,106 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 05:53:16,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578360626] [2019-12-27 05:53:16,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:53:16,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:53:16,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658353098] [2019-12-27 05:53:16,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:53:16,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:53:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:53:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:53:16,108 INFO L87 Difference]: Start difference. First operand 23562 states and 72744 transitions. Second operand 15 states. [2019-12-27 05:53:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:19,948 INFO L93 Difference]: Finished difference Result 38456 states and 117283 transitions. [2019-12-27 05:53:19,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 05:53:19,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 05:53:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:19,995 INFO L225 Difference]: With dead ends: 38456 [2019-12-27 05:53:19,995 INFO L226 Difference]: Without dead ends: 31793 [2019-12-27 05:53:19,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=509, Invalid=2353, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 05:53:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31793 states. [2019-12-27 05:53:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31793 to 19816. [2019-12-27 05:53:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19816 states. [2019-12-27 05:53:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19816 states to 19816 states and 61159 transitions. [2019-12-27 05:53:20,359 INFO L78 Accepts]: Start accepts. Automaton has 19816 states and 61159 transitions. Word has length 56 [2019-12-27 05:53:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:53:20,359 INFO L462 AbstractCegarLoop]: Abstraction has 19816 states and 61159 transitions. [2019-12-27 05:53:20,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:53:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 19816 states and 61159 transitions. [2019-12-27 05:53:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:53:20,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:20,380 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] [2019-12-27 05:53:20,380 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:53:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash -301888144, now seen corresponding path program 8 times [2019-12-27 05:53:20,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:20,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065668727] [2019-12-27 05:53:20,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:53:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:53:20,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065668727] [2019-12-27 05:53:20,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:53:20,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:53:20,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784018218] [2019-12-27 05:53:20,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:53:20,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:53:20,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:53:20,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:53:20,531 INFO L87 Difference]: Start difference. First operand 19816 states and 61159 transitions. Second operand 11 states. [2019-12-27 05:53:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:21,519 INFO L93 Difference]: Finished difference Result 31563 states and 97266 transitions. [2019-12-27 05:53:21,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:53:21,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 05:53:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:21,570 INFO L225 Difference]: With dead ends: 31563 [2019-12-27 05:53:21,571 INFO L226 Difference]: Without dead ends: 30997 [2019-12-27 05:53:21,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-27 05:53:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30997 states. [2019-12-27 05:53:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30997 to 20903. [2019-12-27 05:53:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20903 states. [2019-12-27 05:53:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20903 states to 20903 states and 64516 transitions. [2019-12-27 05:53:21,949 INFO L78 Accepts]: Start accepts. Automaton has 20903 states and 64516 transitions. Word has length 56 [2019-12-27 05:53:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:53:21,950 INFO L462 AbstractCegarLoop]: Abstraction has 20903 states and 64516 transitions. [2019-12-27 05:53:21,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:53:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 20903 states and 64516 transitions. [2019-12-27 05:53:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:53:21,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:21,972 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] [2019-12-27 05:53:21,972 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:53:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1985453018, now seen corresponding path program 9 times [2019-12-27 05:53:21,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:21,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029925581] [2019-12-27 05:53:21,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:53:22,140 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 05:53:22,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029925581] [2019-12-27 05:53:22,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:53:22,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:53:22,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130934616] [2019-12-27 05:53:22,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:53:22,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:53:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:53:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:53:22,142 INFO L87 Difference]: Start difference. First operand 20903 states and 64516 transitions. Second operand 11 states. [2019-12-27 05:53:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:22,997 INFO L93 Difference]: Finished difference Result 31268 states and 96108 transitions. [2019-12-27 05:53:22,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:53:22,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 05:53:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:23,038 INFO L225 Difference]: With dead ends: 31268 [2019-12-27 05:53:23,038 INFO L226 Difference]: Without dead ends: 27581 [2019-12-27 05:53:23,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:53:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27581 states. [2019-12-27 05:53:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27581 to 18614. [2019-12-27 05:53:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18614 states. [2019-12-27 05:53:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18614 states to 18614 states and 57506 transitions. [2019-12-27 05:53:23,519 INFO L78 Accepts]: Start accepts. Automaton has 18614 states and 57506 transitions. Word has length 56 [2019-12-27 05:53:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:53:23,519 INFO L462 AbstractCegarLoop]: Abstraction has 18614 states and 57506 transitions. [2019-12-27 05:53:23,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:53:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 18614 states and 57506 transitions. [2019-12-27 05:53:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:53:23,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:23,539 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] [2019-12-27 05:53:23,539 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:53:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 10 times [2019-12-27 05:53:23,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:23,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004640962] [2019-12-27 05:53:23,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:53:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:53:23,646 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:53:23,646 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:53:23,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_16|) |v_ULTIMATE.start_main_~#t642~0.offset_13| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t642~0.base_16|) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_ULTIMATE.start_main_~#t642~0.offset_13| 0) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t642~0.base_16| 1)) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t642~0.base_16| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t642~0.base_16|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t642~0.offset=|v_ULTIMATE.start_main_~#t642~0.offset_13|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_19|, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t642~0.base=|v_ULTIMATE.start_main_~#t642~0.base_16|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_15|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t642~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t644~0.base, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t644~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t642~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:53:23,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t643~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t643~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t643~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11|) |v_ULTIMATE.start_main_~#t643~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t643~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_10|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 05:53:23,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out118544973| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out118544973) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out118544973| 1) (= ~y$w_buff1~0_Out118544973 ~y$w_buff0~0_In118544973) (= P1Thread1of1ForFork1_~arg.base_Out118544973 |P1Thread1of1ForFork1_#in~arg.base_In118544973|) (= ~y$w_buff1_used~0_Out118544973 ~y$w_buff0_used~0_In118544973) (= ~y$w_buff0~0_Out118544973 1) (= P1Thread1of1ForFork1_~arg.offset_Out118544973 |P1Thread1of1ForFork1_#in~arg.offset_In118544973|) (= (mod ~y$w_buff1_used~0_Out118544973 256) 0) (= ~y$w_buff0_used~0_Out118544973 1)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In118544973, ~y$w_buff0~0=~y$w_buff0~0_In118544973, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In118544973|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In118544973|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out118544973, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out118544973, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out118544973, ~y$w_buff1~0=~y$w_buff1~0_Out118544973, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out118544973|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out118544973, ~y$w_buff0~0=~y$w_buff0~0_Out118544973, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In118544973|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In118544973|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out118544973} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:53:23,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11|) |v_ULTIMATE.start_main_~#t644~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t644~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t644~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t644~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t644~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t644~0.base, ULTIMATE.start_main_~#t644~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 05:53:23,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite32_Out2142731348| |P2Thread1of1ForFork2_#t~ite33_Out2142731348|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2142731348 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In2142731348 256) 0))) (or (and .cse0 (not .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out2142731348| ~y$w_buff1~0_In2142731348) (not .cse2)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite32_Out2142731348| ~y~0_In2142731348) (or .cse2 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2142731348, ~y$w_buff1~0=~y$w_buff1~0_In2142731348, ~y~0=~y~0_In2142731348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142731348} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2142731348, ~y$w_buff1~0=~y$w_buff1~0_In2142731348, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out2142731348|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out2142731348|, ~y~0=~y~0_In2142731348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142731348} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 05:53:23,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-903400443 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-903400443 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-903400443| ~y$w_buff0_used~0_In-903400443)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-903400443| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-903400443, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-903400443} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-903400443, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-903400443, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-903400443|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:53:23,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1797834993 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1797834993 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out-1797834993|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1797834993 |P2Thread1of1ForFork2_#t~ite34_Out-1797834993|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797834993, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1797834993} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1797834993|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797834993, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1797834993} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 05:53:23,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In659804590 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In659804590 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In659804590 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In659804590 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite35_Out659804590| ~y$w_buff1_used~0_In659804590)) (and (= |P2Thread1of1ForFork2_#t~ite35_Out659804590| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In659804590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In659804590, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In659804590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659804590} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out659804590|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In659804590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In659804590, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In659804590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659804590} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 05:53:23,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In799977259 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In799977259 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite36_Out799977259| ~y$r_buff0_thd3~0_In799977259) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite36_Out799977259| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In799977259, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In799977259} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out799977259|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799977259, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In799977259} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 05:53:23,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In209984160 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In209984160 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In209984160 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In209984160 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out209984160|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite37_Out209984160| ~y$r_buff1_thd3~0_In209984160)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In209984160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In209984160, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In209984160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In209984160} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out209984160|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In209984160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In209984160, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In209984160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In209984160} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 05:53:23,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 05:53:23,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1874210468 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1874210468 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1874210468 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1874210468 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out-1874210468| ~y$w_buff1_used~0_In-1874210468) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1874210468|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1874210468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874210468, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1874210468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1874210468} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1874210468, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1874210468|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874210468, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1874210468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1874210468} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 05:53:23,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1250841883 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1250841883 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out1250841883 0)) (and (= ~y$r_buff0_thd2~0_In1250841883 ~y$r_buff0_thd2~0_Out1250841883) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1250841883, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1250841883} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1250841883|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1250841883, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1250841883} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 05:53:23,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1582493654 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1582493654 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1582493654 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1582493654 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-1582493654 |P1Thread1of1ForFork1_#t~ite31_Out-1582493654|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite31_Out-1582493654| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1582493654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1582493654, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1582493654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582493654} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1582493654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1582493654, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1582493654|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1582493654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582493654} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 05:53:23,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 05:53:23,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In568914544 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite9_Out568914544| ~y$w_buff0~0_In568914544) (= |P0Thread1of1ForFork0_#t~ite8_In568914544| |P0Thread1of1ForFork0_#t~ite8_Out568914544|)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out568914544| ~y$w_buff0~0_In568914544) (= |P0Thread1of1ForFork0_#t~ite9_Out568914544| |P0Thread1of1ForFork0_#t~ite8_Out568914544|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In568914544 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd1~0_In568914544 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In568914544 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In568914544 256)))) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In568914544, ~y$w_buff0_used~0=~y$w_buff0_used~0_In568914544, ~y$w_buff0~0=~y$w_buff0~0_In568914544, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In568914544, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In568914544|, ~weak$$choice2~0=~weak$$choice2~0_In568914544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In568914544} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In568914544, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out568914544|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In568914544, ~y$w_buff0~0=~y$w_buff0~0_In568914544, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out568914544|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In568914544, ~weak$$choice2~0=~weak$$choice2~0_In568914544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In568914544} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:53:23,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In669843499 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out669843499| ~y$w_buff1~0_In669843499) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In669843499 256)))) (or (= (mod ~y$w_buff0_used~0_In669843499 256) 0) (and (= 0 (mod ~y$r_buff1_thd1~0_In669843499 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In669843499 256)) .cse1))) (= |P0Thread1of1ForFork0_#t~ite12_Out669843499| |P0Thread1of1ForFork0_#t~ite11_Out669843499|)) (and (= |P0Thread1of1ForFork0_#t~ite11_In669843499| |P0Thread1of1ForFork0_#t~ite11_Out669843499|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite12_Out669843499| ~y$w_buff1~0_In669843499)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In669843499|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In669843499, ~y$w_buff1~0=~y$w_buff1~0_In669843499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In669843499, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In669843499, ~weak$$choice2~0=~weak$$choice2~0_In669843499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In669843499} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out669843499|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In669843499, ~y$w_buff1~0=~y$w_buff1~0_In669843499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In669843499, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In669843499, ~weak$$choice2~0=~weak$$choice2~0_In669843499, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out669843499|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In669843499} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 05:53:23,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 05:53:23,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1996382760 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1996382760 256) 0)) (.cse4 (= 0 (mod ~y$r_buff1_thd1~0_In-1996382760 256))) (.cse6 (= (mod ~y$r_buff0_thd1~0_In-1996382760 256) 0)) (.cse3 (= |P0Thread1of1ForFork0_#t~ite24_Out-1996382760| |P0Thread1of1ForFork0_#t~ite23_Out-1996382760|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-1996382760 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) .cse3 (or (not .cse4) .cse1) (= |P0Thread1of1ForFork0_#t~ite23_Out-1996382760| |P0Thread1of1ForFork0_#t~ite22_Out-1996382760|) .cse5 (= 0 |P0Thread1of1ForFork0_#t~ite22_Out-1996382760|))) (and (or (and (or (and .cse0 .cse6) .cse2 (and .cse4 .cse6)) .cse3 (= ~y$r_buff1_thd1~0_In-1996382760 |P0Thread1of1ForFork0_#t~ite23_Out-1996382760|) .cse5) (and (= |P0Thread1of1ForFork0_#t~ite23_In-1996382760| |P0Thread1of1ForFork0_#t~ite23_Out-1996382760|) (= ~y$r_buff1_thd1~0_In-1996382760 |P0Thread1of1ForFork0_#t~ite24_Out-1996382760|) (not .cse5))) (= |P0Thread1of1ForFork0_#t~ite22_In-1996382760| |P0Thread1of1ForFork0_#t~ite22_Out-1996382760|)))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In-1996382760|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1996382760, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996382760, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1996382760, ~weak$$choice2~0=~weak$$choice2~0_In-1996382760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996382760, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1996382760|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out-1996382760|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1996382760, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996382760, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1996382760, ~weak$$choice2~0=~weak$$choice2~0_In-1996382760, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1996382760|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1996382760|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996382760} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 05:53:23,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 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, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 05:53:23,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:53:23,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-943892592 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-943892592 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-943892592| ~y$w_buff1~0_In-943892592) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-943892592 |ULTIMATE.start_main_#t~ite41_Out-943892592|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-943892592, ~y~0=~y~0_In-943892592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-943892592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943892592} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-943892592|, ~y$w_buff1~0=~y$w_buff1~0_In-943892592, ~y~0=~y~0_In-943892592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-943892592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943892592} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 05:53:23,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:53:23,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1943775266 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1943775266 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1943775266| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1943775266 |ULTIMATE.start_main_#t~ite43_Out-1943775266|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1943775266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1943775266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1943775266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1943775266, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1943775266|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:53:23,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In38826019 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In38826019 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In38826019 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In38826019 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out38826019| ~y$w_buff1_used~0_In38826019)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out38826019| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In38826019, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In38826019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In38826019, ~y$w_buff1_used~0=~y$w_buff1_used~0_In38826019} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In38826019, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In38826019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In38826019, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out38826019|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In38826019} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:53:23,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1711323007 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1711323007 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1711323007| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1711323007| ~y$r_buff0_thd0~0_In-1711323007) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1711323007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1711323007} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1711323007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1711323007, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1711323007|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:53:23,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1920849776 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1920849776 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1920849776 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1920849776 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1920849776| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In1920849776 |ULTIMATE.start_main_#t~ite46_Out1920849776|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1920849776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1920849776, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1920849776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920849776} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1920849776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1920849776, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1920849776|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1920849776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920849776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 05:53:23,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:53:23,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:53:23 BasicIcfg [2019-12-27 05:53:23,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:53:23,795 INFO L168 Benchmark]: Toolchain (without parser) took 92147.73 ms. Allocated memory was 136.8 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 99.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 05:53:23,795 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 05:53:23,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 890.00 ms. Allocated memory was 136.8 MB in the beginning and 204.5 MB in the end (delta: 67.6 MB). Free memory was 99.2 MB in the beginning and 157.4 MB in the end (delta: -58.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:53:23,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.45 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 155.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:53:23,797 INFO L168 Benchmark]: Boogie Preprocessor took 56.66 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:53:23,797 INFO L168 Benchmark]: RCFGBuilder took 795.34 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 105.6 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:53:23,798 INFO L168 Benchmark]: TraceAbstraction took 90311.25 ms. Allocated memory was 204.5 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 104.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 05:53:23,800 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 890.00 ms. Allocated memory was 136.8 MB in the beginning and 204.5 MB in the end (delta: 67.6 MB). Free memory was 99.2 MB in the beginning and 157.4 MB in the end (delta: -58.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.45 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 155.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.66 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 795.34 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 105.6 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90311.25 ms. Allocated memory was 204.5 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 104.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t642, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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, z=0] [L833] FCALL, FORK 0 pthread_create(&t643, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=1, 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, z=1] [L785] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=1, 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, z=1] [L835] FCALL, FORK 0 pthread_create(&t644, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0: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=1, 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, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=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=1, 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, z=2] [L808] EXPR 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=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=1, 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, z=2] [L785] 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) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 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 [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 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 [L844] 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, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.9s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 43.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7323 SDtfs, 11113 SDslu, 30621 SDs, 0 SdLazy, 26397 SolverSat, 576 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 42 SyntacticMatches, 42 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5250 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 327680 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1334 NumberOfCodeBlocks, 1334 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1248 ConstructedInterpolants, 0 QuantifiedInterpolants, 314851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...