/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:58:10,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:58:10,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:58:10,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:58:10,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:58:10,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:58:10,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:58:10,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:58:10,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:58:10,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:58:10,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:58:10,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:58:10,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:58:10,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:58:10,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:58:10,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:58:10,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:58:10,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:58:10,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:58:10,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:58:10,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:58:10,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:58:10,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:58:10,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:58:10,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:58:10,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:58:10,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:58:10,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:58:10,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:58:10,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:58:10,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:58:10,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:58:10,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:58:10,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:58:10,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:58:10,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:58:10,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:58:10,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:58:10,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:58:10,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:58:10,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:58:10,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:58:10,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:58:10,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:58:10,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:58:10,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:58:10,427 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:58:10,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:58:10,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:58:10,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:58:10,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:58:10,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:58:10,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:58:10,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:58:10,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:58:10,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:58:10,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:58:10,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:58:10,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:58:10,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:58:10,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:58:10,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:58:10,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:58:10,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:58:10,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:58:10,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:58:10,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:58:10,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:58:10,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:58:10,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:58:10,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:58:10,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:58:10,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:58:10,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:58:10,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:58:10,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:58:10,757 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:58:10,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2019-12-26 21:58:10,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f618bcb7/348ce968cd1b4d5daabb161770f58c99/FLAG437e8f02c [2019-12-26 21:58:11,385 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:58:11,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2019-12-26 21:58:11,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f618bcb7/348ce968cd1b4d5daabb161770f58c99/FLAG437e8f02c [2019-12-26 21:58:11,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f618bcb7/348ce968cd1b4d5daabb161770f58c99 [2019-12-26 21:58:11,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:58:11,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:58:11,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:58:11,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:58:11,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:58:11,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:58:11" (1/1) ... [2019-12-26 21:58:11,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c126812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:11, skipping insertion in model container [2019-12-26 21:58:11,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:58:11" (1/1) ... [2019-12-26 21:58:11,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:58:11,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:58:12,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:58:12,243 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:58:12,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:58:12,478 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:58:12,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12 WrapperNode [2019-12-26 21:58:12,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:58:12,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:58:12,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:58:12,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:58:12,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:58:12,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:58:12,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:58:12,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:58:12,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... [2019-12-26 21:58:12,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:58:12,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:58:12,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:58:12,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:58:12,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:58:12,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:58:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:58:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:58:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:58:12,722 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:58:12,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:58:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:58:12,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:58:12,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:58:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:58:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:58:12,726 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:58:13,587 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:58:13,588 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:58:13,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:58:13 BoogieIcfgContainer [2019-12-26 21:58:13,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:58:13,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:58:13,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:58:13,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:58:13,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:58:11" (1/3) ... [2019-12-26 21:58:13,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f04772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:58:13, skipping insertion in model container [2019-12-26 21:58:13,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:12" (2/3) ... [2019-12-26 21:58:13,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f04772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:58:13, skipping insertion in model container [2019-12-26 21:58:13,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:58:13" (3/3) ... [2019-12-26 21:58:13,599 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.oepc.i [2019-12-26 21:58:13,609 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:58:13,610 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:58:13,618 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:58:13,619 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:58:13,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,759 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,761 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,779 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,779 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:13,801 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:58:13,826 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:58:13,826 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:58:13,826 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:58:13,827 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:58:13,827 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:58:13,827 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:58:13,827 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:58:13,827 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:58:13,849 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 21:58:13,851 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:58:13,956 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:58:13,956 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:58:13,973 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:58:14,001 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:58:14,057 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:58:14,057 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:58:14,065 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:58:14,087 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:58:14,089 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:58:19,083 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-26 21:58:19,510 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:58:19,655 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:58:19,679 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-26 21:58:19,679 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 21:58:19,682 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-26 21:58:39,358 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-26 21:58:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-26 21:58:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:58:39,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:39,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:58:39,366 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:58:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-26 21:58:39,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:39,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656836054] [2019-12-26 21:58:39,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:58:39,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656836054] [2019-12-26 21:58:39,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:39,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:58:39,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269222252] [2019-12-26 21:58:39,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:58:39,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:58:39,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:58:39,681 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-26 21:58:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:43,043 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-26 21:58:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:58:43,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:58:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:58:43,747 INFO L225 Difference]: With dead ends: 114110 [2019-12-26 21:58:43,747 INFO L226 Difference]: Without dead ends: 107012 [2019-12-26 21:58:43,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:58:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-26 21:58:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-26 21:58:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-26 21:58:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-26 21:58:56,534 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-26 21:58:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:58:56,534 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-26 21:58:56,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:58:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-26 21:58:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:58:56,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:58:56,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:58:56,539 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:58:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:58:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-26 21:58:56,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:58:56,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385097077] [2019-12-26 21:58:56,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:58:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:58:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:58:56,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385097077] [2019-12-26 21:58:56,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:58:56,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:58:56,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148011100] [2019-12-26 21:58:56,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:58:56,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:58:56,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:58:56,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:58:56,637 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-26 21:58:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:58:57,799 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-26 21:58:57,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:58:57,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:58:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:03,193 INFO L225 Difference]: With dead ends: 166210 [2019-12-26 21:59:03,193 INFO L226 Difference]: Without dead ends: 166161 [2019-12-26 21:59:03,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-26 21:59:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-26 21:59:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-26 21:59:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-26 21:59:17,257 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-26 21:59:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:17,258 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-26 21:59:17,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-26 21:59:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:59:17,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:17,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:17,266 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:17,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-26 21:59:17,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:17,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256716765] [2019-12-26 21:59:17,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:17,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256716765] [2019-12-26 21:59:17,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:17,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:17,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915503176] [2019-12-26 21:59:17,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:17,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:17,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:17,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:17,331 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-26 21:59:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:17,460 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-26 21:59:17,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:17,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:59:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:17,513 INFO L225 Difference]: With dead ends: 33068 [2019-12-26 21:59:17,514 INFO L226 Difference]: Without dead ends: 33068 [2019-12-26 21:59:17,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-26 21:59:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-26 21:59:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-26 21:59:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-26 21:59:18,116 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-26 21:59:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:18,116 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-26 21:59:18,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-26 21:59:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:59:18,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:18,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:18,121 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:18,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-26 21:59:18,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:18,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026573981] [2019-12-26 21:59:18,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:18,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026573981] [2019-12-26 21:59:18,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:18,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:18,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914414737] [2019-12-26 21:59:18,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:59:18,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:18,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:59:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:18,214 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-26 21:59:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:18,722 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-26 21:59:18,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:59:18,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:59:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:18,795 INFO L225 Difference]: With dead ends: 45410 [2019-12-26 21:59:18,795 INFO L226 Difference]: Without dead ends: 45410 [2019-12-26 21:59:18,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-26 21:59:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-26 21:59:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-26 21:59:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-26 21:59:20,467 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-26 21:59:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:20,468 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-26 21:59:20,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:59:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-26 21:59:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:59:20,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:20,478 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-26 21:59:20,479 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-26 21:59:20,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:20,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614736041] [2019-12-26 21:59:20,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:20,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614736041] [2019-12-26 21:59:20,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:20,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:59:20,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325182817] [2019-12-26 21:59:20,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:59:20,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:59:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:59:20,615 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-26 21:59:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:21,703 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-26 21:59:21,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:59:21,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 21:59:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:21,809 INFO L225 Difference]: With dead ends: 56872 [2019-12-26 21:59:21,810 INFO L226 Difference]: Without dead ends: 56865 [2019-12-26 21:59:21,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:59:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-26 21:59:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-26 21:59:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-26 21:59:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-26 21:59:23,154 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-26 21:59:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:23,154 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-26 21:59:23,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:59:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-26 21:59:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:59:23,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:23,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:23,167 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-26 21:59:23,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:23,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546032264] [2019-12-26 21:59:23,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:23,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546032264] [2019-12-26 21:59:23,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:23,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:23,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97380638] [2019-12-26 21:59:23,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:59:23,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:23,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:59:23,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:23,225 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-26 21:59:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:23,292 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-26 21:59:23,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:59:23,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:59:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:23,314 INFO L225 Difference]: With dead ends: 16014 [2019-12-26 21:59:23,315 INFO L226 Difference]: Without dead ends: 16014 [2019-12-26 21:59:23,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-26 21:59:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-26 21:59:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-26 21:59:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-26 21:59:23,554 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-26 21:59:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:23,555 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-26 21:59:23,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-26 21:59:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:59:23,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:23,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:23,567 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-26 21:59:23,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:23,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118907839] [2019-12-26 21:59:23,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:23,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118907839] [2019-12-26 21:59:23,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:23,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:59:23,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361921190] [2019-12-26 21:59:23,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:59:23,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:23,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:59:23,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:59:23,657 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-26 21:59:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:24,301 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-26 21:59:24,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:59:24,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:59:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:24,333 INFO L225 Difference]: With dead ends: 22624 [2019-12-26 21:59:24,333 INFO L226 Difference]: Without dead ends: 22624 [2019-12-26 21:59:24,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:59:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-26 21:59:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-26 21:59:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-26 21:59:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-26 21:59:24,999 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-26 21:59:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:25,000 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-26 21:59:25,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:59:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-26 21:59:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:59:25,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:25,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:25,018 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-26 21:59:25,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:25,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732895639] [2019-12-26 21:59:25,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:25,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732895639] [2019-12-26 21:59:25,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:25,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:59:25,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373032346] [2019-12-26 21:59:25,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:59:25,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:25,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:59:25,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:25,134 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-26 21:59:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:26,382 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-26 21:59:26,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:59:26,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:59:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:26,416 INFO L225 Difference]: With dead ends: 24689 [2019-12-26 21:59:26,416 INFO L226 Difference]: Without dead ends: 24689 [2019-12-26 21:59:26,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:59:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-26 21:59:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-26 21:59:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-26 21:59:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-26 21:59:26,717 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-26 21:59:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:26,717 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-26 21:59:26,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:59:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-26 21:59:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:59:26,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:26,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:26,740 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-26 21:59:26,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:26,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644370088] [2019-12-26 21:59:26,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:26,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644370088] [2019-12-26 21:59:26,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:26,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:26,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31680941] [2019-12-26 21:59:26,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:26,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:26,804 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-26 21:59:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:26,894 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-26 21:59:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:26,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:59:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:26,926 INFO L225 Difference]: With dead ends: 31245 [2019-12-26 21:59:26,926 INFO L226 Difference]: Without dead ends: 17019 [2019-12-26 21:59:26,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-26 21:59:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-26 21:59:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-26 21:59:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-26 21:59:27,171 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-26 21:59:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:27,171 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-26 21:59:27,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-26 21:59:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:59:27,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:27,193 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-26 21:59:27,193 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-26 21:59:27,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:27,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740876102] [2019-12-26 21:59:27,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:27,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740876102] [2019-12-26 21:59:27,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:27,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:27,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102017276] [2019-12-26 21:59:27,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:59:27,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:59:27,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:27,258 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-26 21:59:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:27,334 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-26 21:59:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:59:27,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-26 21:59:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:27,349 INFO L225 Difference]: With dead ends: 24032 [2019-12-26 21:59:27,350 INFO L226 Difference]: Without dead ends: 10093 [2019-12-26 21:59:27,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-26 21:59:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-26 21:59:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-26 21:59:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-26 21:59:27,862 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-26 21:59:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:27,863 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-26 21:59:27,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-26 21:59:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:59:27,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:27,876 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-26 21:59:27,876 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:27,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:27,876 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-26 21:59:27,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:27,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847296338] [2019-12-26 21:59:27,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:27,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847296338] [2019-12-26 21:59:27,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:27,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:59:27,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161004896] [2019-12-26 21:59:27,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:59:27,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:59:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:27,950 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-26 21:59:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:28,005 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-26 21:59:28,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:59:28,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:59:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:28,019 INFO L225 Difference]: With dead ends: 9224 [2019-12-26 21:59:28,019 INFO L226 Difference]: Without dead ends: 6480 [2019-12-26 21:59:28,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-26 21:59:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-26 21:59:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-26 21:59:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-26 21:59:28,234 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-26 21:59:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:28,234 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-26 21:59:28,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:59:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-26 21:59:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:28,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:28,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:28,249 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:28,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-26 21:59:28,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:28,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507877602] [2019-12-26 21:59:28,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:28,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507877602] [2019-12-26 21:59:28,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:28,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:28,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826109541] [2019-12-26 21:59:28,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:28,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:28,319 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-26 21:59:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:28,409 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-26 21:59:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:28,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:59:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:28,429 INFO L225 Difference]: With dead ends: 9612 [2019-12-26 21:59:28,430 INFO L226 Difference]: Without dead ends: 9612 [2019-12-26 21:59:28,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-26 21:59:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-26 21:59:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-26 21:59:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-26 21:59:28,634 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-26 21:59:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:28,634 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-26 21:59:28,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-26 21:59:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:28,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:28,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:28,643 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:28,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-26 21:59:28,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:28,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745759096] [2019-12-26 21:59:28,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:28,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745759096] [2019-12-26 21:59:28,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:28,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:59:28,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96790638] [2019-12-26 21:59:28,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:59:28,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:28,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:59:28,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:28,740 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-26 21:59:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:29,026 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-26 21:59:29,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:59:29,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:59:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:29,047 INFO L225 Difference]: With dead ends: 14786 [2019-12-26 21:59:29,047 INFO L226 Difference]: Without dead ends: 11103 [2019-12-26 21:59:29,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:59:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-26 21:59:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-26 21:59:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-26 21:59:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-26 21:59:29,211 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-26 21:59:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:29,211 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-26 21:59:29,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:59:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-26 21:59:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:29,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:29,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:29,222 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-26 21:59:29,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:29,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147001752] [2019-12-26 21:59:29,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:29,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147001752] [2019-12-26 21:59:29,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:29,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:59:29,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429696936] [2019-12-26 21:59:29,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:59:29,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:29,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:59:29,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:29,323 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-26 21:59:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:29,616 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-26 21:59:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:59:29,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:59:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:29,636 INFO L225 Difference]: With dead ends: 16709 [2019-12-26 21:59:29,636 INFO L226 Difference]: Without dead ends: 12623 [2019-12-26 21:59:29,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:59:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-26 21:59:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-26 21:59:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-26 21:59:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-26 21:59:29,818 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-26 21:59:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:29,819 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-26 21:59:29,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:59:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-26 21:59:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:29,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:29,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:29,830 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-26 21:59:29,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:29,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505679979] [2019-12-26 21:59:29,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:29,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505679979] [2019-12-26 21:59:29,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:29,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:59:29,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732265638] [2019-12-26 21:59:29,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:59:29,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:29,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:59:29,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:29,961 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-26 21:59:31,192 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-26 21:59:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:31,490 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-26 21:59:31,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:59:31,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:59:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:31,534 INFO L225 Difference]: With dead ends: 36233 [2019-12-26 21:59:31,534 INFO L226 Difference]: Without dead ends: 32009 [2019-12-26 21:59:31,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:59:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-26 21:59:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-26 21:59:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-26 21:59:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-26 21:59:31,842 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-26 21:59:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:31,842 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-26 21:59:31,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:59:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-26 21:59:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:31,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:31,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:31,858 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-26 21:59:31,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:31,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285274456] [2019-12-26 21:59:31,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:31,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285274456] [2019-12-26 21:59:31,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:31,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:31,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902753246] [2019-12-26 21:59:31,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:31,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:31,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:31,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:31,915 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-26 21:59:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:31,992 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-26 21:59:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:31,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:59:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:32,010 INFO L225 Difference]: With dead ends: 12867 [2019-12-26 21:59:32,010 INFO L226 Difference]: Without dead ends: 12867 [2019-12-26 21:59:32,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-26 21:59:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-26 21:59:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-26 21:59:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-26 21:59:32,199 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-26 21:59:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:32,200 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-26 21:59:32,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-26 21:59:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:32,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:32,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:32,217 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:32,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:32,217 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-26 21:59:32,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:32,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786840565] [2019-12-26 21:59:32,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:32,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786840565] [2019-12-26 21:59:32,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:32,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:59:32,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779168547] [2019-12-26 21:59:32,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:59:32,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:32,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:59:32,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:32,343 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-26 21:59:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:33,363 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-26 21:59:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:59:33,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:59:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:33,402 INFO L225 Difference]: With dead ends: 28791 [2019-12-26 21:59:33,403 INFO L226 Difference]: Without dead ends: 26476 [2019-12-26 21:59:33,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:59:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-26 21:59:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-26 21:59:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-26 21:59:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-26 21:59:33,677 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-26 21:59:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:33,677 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-26 21:59:33,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:59:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-26 21:59:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:33,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:33,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:33,691 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:33,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:33,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-26 21:59:33,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:33,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451398078] [2019-12-26 21:59:33,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:33,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451398078] [2019-12-26 21:59:33,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:33,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:59:33,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324215145] [2019-12-26 21:59:33,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:59:33,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:33,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:59:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:33,798 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 5 states. [2019-12-26 21:59:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:34,160 INFO L93 Difference]: Finished difference Result 12384 states and 38249 transitions. [2019-12-26 21:59:34,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:59:34,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-26 21:59:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:34,575 INFO L225 Difference]: With dead ends: 12384 [2019-12-26 21:59:34,575 INFO L226 Difference]: Without dead ends: 12384 [2019-12-26 21:59:34,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:59:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2019-12-26 21:59:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 11630. [2019-12-26 21:59:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2019-12-26 21:59:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 36167 transitions. [2019-12-26 21:59:34,862 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 36167 transitions. Word has length 64 [2019-12-26 21:59:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:34,862 INFO L462 AbstractCegarLoop]: Abstraction has 11630 states and 36167 transitions. [2019-12-26 21:59:34,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:59:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 36167 transitions. [2019-12-26 21:59:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:34,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:34,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:34,881 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:34,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:34,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 6 times [2019-12-26 21:59:34,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:34,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602496167] [2019-12-26 21:59:34,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:35,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602496167] [2019-12-26 21:59:35,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:35,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:59:35,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031646256] [2019-12-26 21:59:35,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:59:35,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:35,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:59:35,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:35,013 INFO L87 Difference]: Start difference. First operand 11630 states and 36167 transitions. Second operand 7 states. [2019-12-26 21:59:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:35,989 INFO L93 Difference]: Finished difference Result 20495 states and 61153 transitions. [2019-12-26 21:59:35,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:59:35,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:59:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:36,017 INFO L225 Difference]: With dead ends: 20495 [2019-12-26 21:59:36,017 INFO L226 Difference]: Without dead ends: 20327 [2019-12-26 21:59:36,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:59:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-26 21:59:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 17055. [2019-12-26 21:59:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17055 states. [2019-12-26 21:59:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17055 states to 17055 states and 51675 transitions. [2019-12-26 21:59:36,303 INFO L78 Accepts]: Start accepts. Automaton has 17055 states and 51675 transitions. Word has length 64 [2019-12-26 21:59:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:36,304 INFO L462 AbstractCegarLoop]: Abstraction has 17055 states and 51675 transitions. [2019-12-26 21:59:36,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:59:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 17055 states and 51675 transitions. [2019-12-26 21:59:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:36,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:36,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:36,322 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 7 times [2019-12-26 21:59:36,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:36,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566815776] [2019-12-26 21:59:36,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:36,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566815776] [2019-12-26 21:59:36,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:36,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:59:36,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924649873] [2019-12-26 21:59:36,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:59:36,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:36,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:59:36,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:59:36,412 INFO L87 Difference]: Start difference. First operand 17055 states and 51675 transitions. Second operand 6 states. [2019-12-26 21:59:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:37,248 INFO L93 Difference]: Finished difference Result 30832 states and 92113 transitions. [2019-12-26 21:59:37,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:59:37,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-26 21:59:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:37,291 INFO L225 Difference]: With dead ends: 30832 [2019-12-26 21:59:37,291 INFO L226 Difference]: Without dead ends: 30612 [2019-12-26 21:59:37,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:59:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30612 states. [2019-12-26 21:59:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30612 to 22076. [2019-12-26 21:59:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22076 states. [2019-12-26 21:59:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22076 states to 22076 states and 66013 transitions. [2019-12-26 21:59:37,738 INFO L78 Accepts]: Start accepts. Automaton has 22076 states and 66013 transitions. Word has length 64 [2019-12-26 21:59:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:37,738 INFO L462 AbstractCegarLoop]: Abstraction has 22076 states and 66013 transitions. [2019-12-26 21:59:37,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:59:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 22076 states and 66013 transitions. [2019-12-26 21:59:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:59:37,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:37,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:37,766 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:37,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 8 times [2019-12-26 21:59:37,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:37,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958084287] [2019-12-26 21:59:37,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:37,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958084287] [2019-12-26 21:59:37,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:37,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:37,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180590227] [2019-12-26 21:59:37,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:37,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:37,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:37,871 INFO L87 Difference]: Start difference. First operand 22076 states and 66013 transitions. Second operand 3 states. [2019-12-26 21:59:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:38,354 INFO L93 Difference]: Finished difference Result 22076 states and 66012 transitions. [2019-12-26 21:59:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:38,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:59:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:38,406 INFO L225 Difference]: With dead ends: 22076 [2019-12-26 21:59:38,407 INFO L226 Difference]: Without dead ends: 22076 [2019-12-26 21:59:38,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22076 states. [2019-12-26 21:59:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22076 to 20293. [2019-12-26 21:59:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20293 states. [2019-12-26 21:59:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20293 states to 20293 states and 61028 transitions. [2019-12-26 21:59:39,026 INFO L78 Accepts]: Start accepts. Automaton has 20293 states and 61028 transitions. Word has length 64 [2019-12-26 21:59:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:39,026 INFO L462 AbstractCegarLoop]: Abstraction has 20293 states and 61028 transitions. [2019-12-26 21:59:39,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 20293 states and 61028 transitions. [2019-12-26 21:59:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:59:39,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:39,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:39,060 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1480180120, now seen corresponding path program 1 times [2019-12-26 21:59:39,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:39,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974574671] [2019-12-26 21:59:39,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:39,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974574671] [2019-12-26 21:59:39,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:39,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:59:39,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676301549] [2019-12-26 21:59:39,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:59:39,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:39,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:59:39,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:39,201 INFO L87 Difference]: Start difference. First operand 20293 states and 61028 transitions. Second operand 7 states. [2019-12-26 21:59:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:39,977 INFO L93 Difference]: Finished difference Result 26332 states and 77690 transitions. [2019-12-26 21:59:39,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:59:39,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:59:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:40,012 INFO L225 Difference]: With dead ends: 26332 [2019-12-26 21:59:40,012 INFO L226 Difference]: Without dead ends: 26092 [2019-12-26 21:59:40,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:59:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26092 states. [2019-12-26 21:59:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26092 to 21007. [2019-12-26 21:59:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21007 states. [2019-12-26 21:59:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21007 states to 21007 states and 62973 transitions. [2019-12-26 21:59:40,372 INFO L78 Accepts]: Start accepts. Automaton has 21007 states and 62973 transitions. Word has length 65 [2019-12-26 21:59:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:40,372 INFO L462 AbstractCegarLoop]: Abstraction has 21007 states and 62973 transitions. [2019-12-26 21:59:40,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:59:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21007 states and 62973 transitions. [2019-12-26 21:59:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:59:40,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:40,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:40,396 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:40,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2117464962, now seen corresponding path program 2 times [2019-12-26 21:59:40,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:40,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313362708] [2019-12-26 21:59:40,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:40,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313362708] [2019-12-26 21:59:40,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:40,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:40,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036820920] [2019-12-26 21:59:40,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:40,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:40,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:40,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:40,525 INFO L87 Difference]: Start difference. First operand 21007 states and 62973 transitions. Second operand 3 states. [2019-12-26 21:59:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:40,603 INFO L93 Difference]: Finished difference Result 14534 states and 43150 transitions. [2019-12-26 21:59:40,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:40,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:59:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:40,628 INFO L225 Difference]: With dead ends: 14534 [2019-12-26 21:59:40,628 INFO L226 Difference]: Without dead ends: 14534 [2019-12-26 21:59:40,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14534 states. [2019-12-26 21:59:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14534 to 14345. [2019-12-26 21:59:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14345 states. [2019-12-26 21:59:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 42613 transitions. [2019-12-26 21:59:40,971 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 42613 transitions. Word has length 65 [2019-12-26 21:59:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:40,972 INFO L462 AbstractCegarLoop]: Abstraction has 14345 states and 42613 transitions. [2019-12-26 21:59:40,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 42613 transitions. [2019-12-26 21:59:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:59:40,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:40,992 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:40,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1338482558, now seen corresponding path program 1 times [2019-12-26 21:59:40,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:40,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409940553] [2019-12-26 21:59:40,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:41,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409940553] [2019-12-26 21:59:41,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:41,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:59:41,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324405730] [2019-12-26 21:59:41,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:59:41,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:59:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:59:41,126 INFO L87 Difference]: Start difference. First operand 14345 states and 42613 transitions. Second operand 8 states. [2019-12-26 21:59:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:42,272 INFO L93 Difference]: Finished difference Result 25482 states and 74721 transitions. [2019-12-26 21:59:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 21:59:42,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-26 21:59:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:42,296 INFO L225 Difference]: With dead ends: 25482 [2019-12-26 21:59:42,296 INFO L226 Difference]: Without dead ends: 18758 [2019-12-26 21:59:42,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:59:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18758 states. [2019-12-26 21:59:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18758 to 15008. [2019-12-26 21:59:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15008 states. [2019-12-26 21:59:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15008 states to 15008 states and 44099 transitions. [2019-12-26 21:59:42,539 INFO L78 Accepts]: Start accepts. Automaton has 15008 states and 44099 transitions. Word has length 66 [2019-12-26 21:59:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:42,539 INFO L462 AbstractCegarLoop]: Abstraction has 15008 states and 44099 transitions. [2019-12-26 21:59:42,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:59:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15008 states and 44099 transitions. [2019-12-26 21:59:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:59:42,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:42,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:42,553 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1029826500, now seen corresponding path program 2 times [2019-12-26 21:59:42,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:42,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742064904] [2019-12-26 21:59:42,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:42,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742064904] [2019-12-26 21:59:42,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:42,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:59:42,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009652782] [2019-12-26 21:59:42,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:59:42,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:42,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:59:42,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:42,661 INFO L87 Difference]: Start difference. First operand 15008 states and 44099 transitions. Second operand 9 states. [2019-12-26 21:59:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:43,568 INFO L93 Difference]: Finished difference Result 24021 states and 69932 transitions. [2019-12-26 21:59:43,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:59:43,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:59:43,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:43,599 INFO L225 Difference]: With dead ends: 24021 [2019-12-26 21:59:43,600 INFO L226 Difference]: Without dead ends: 17577 [2019-12-26 21:59:43,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:59:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-12-26 21:59:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 14770. [2019-12-26 21:59:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14770 states. [2019-12-26 21:59:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14770 states to 14770 states and 43349 transitions. [2019-12-26 21:59:43,880 INFO L78 Accepts]: Start accepts. Automaton has 14770 states and 43349 transitions. Word has length 66 [2019-12-26 21:59:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:43,880 INFO L462 AbstractCegarLoop]: Abstraction has 14770 states and 43349 transitions. [2019-12-26 21:59:43,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:59:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 14770 states and 43349 transitions. [2019-12-26 21:59:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:59:43,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:43,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:43,895 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:43,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1662390436, now seen corresponding path program 3 times [2019-12-26 21:59:43,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:43,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834186350] [2019-12-26 21:59:43,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:44,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834186350] [2019-12-26 21:59:44,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:44,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:59:44,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574170954] [2019-12-26 21:59:44,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:59:44,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:59:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:59:44,068 INFO L87 Difference]: Start difference. First operand 14770 states and 43349 transitions. Second operand 10 states. [2019-12-26 21:59:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:45,595 INFO L93 Difference]: Finished difference Result 25274 states and 72784 transitions. [2019-12-26 21:59:45,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:59:45,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:59:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:45,639 INFO L225 Difference]: With dead ends: 25274 [2019-12-26 21:59:45,640 INFO L226 Difference]: Without dead ends: 25274 [2019-12-26 21:59:45,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:59:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25274 states. [2019-12-26 21:59:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25274 to 16246. [2019-12-26 21:59:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16246 states. [2019-12-26 21:59:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16246 states to 16246 states and 47556 transitions. [2019-12-26 21:59:45,950 INFO L78 Accepts]: Start accepts. Automaton has 16246 states and 47556 transitions. Word has length 66 [2019-12-26 21:59:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:45,950 INFO L462 AbstractCegarLoop]: Abstraction has 16246 states and 47556 transitions. [2019-12-26 21:59:45,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:59:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 16246 states and 47556 transitions. [2019-12-26 21:59:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:59:45,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:45,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:45,967 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash -848717318, now seen corresponding path program 4 times [2019-12-26 21:59:45,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:45,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386681795] [2019-12-26 21:59:45,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:46,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386681795] [2019-12-26 21:59:46,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:46,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:59:46,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486567384] [2019-12-26 21:59:46,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:59:46,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:46,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:59:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:59:46,137 INFO L87 Difference]: Start difference. First operand 16246 states and 47556 transitions. Second operand 11 states. [2019-12-26 21:59:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:48,021 INFO L93 Difference]: Finished difference Result 24229 states and 69793 transitions. [2019-12-26 21:59:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:59:48,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:59:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:48,052 INFO L225 Difference]: With dead ends: 24229 [2019-12-26 21:59:48,052 INFO L226 Difference]: Without dead ends: 24229 [2019-12-26 21:59:48,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:59:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24229 states. [2019-12-26 21:59:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24229 to 16318. [2019-12-26 21:59:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16318 states. [2019-12-26 21:59:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16318 states to 16318 states and 47756 transitions. [2019-12-26 21:59:48,350 INFO L78 Accepts]: Start accepts. Automaton has 16318 states and 47756 transitions. Word has length 66 [2019-12-26 21:59:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:48,350 INFO L462 AbstractCegarLoop]: Abstraction has 16318 states and 47756 transitions. [2019-12-26 21:59:48,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:59:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 16318 states and 47756 transitions. [2019-12-26 21:59:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:59:48,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:48,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:48,366 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:48,367 INFO L82 PathProgramCache]: Analyzing trace with hash 150910970, now seen corresponding path program 5 times [2019-12-26 21:59:48,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:48,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130075132] [2019-12-26 21:59:48,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:48,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130075132] [2019-12-26 21:59:48,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:48,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 21:59:48,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890051264] [2019-12-26 21:59:48,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:59:48,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:48,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:59:48,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:59:48,546 INFO L87 Difference]: Start difference. First operand 16318 states and 47756 transitions. Second operand 11 states. [2019-12-26 21:59:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:50,823 INFO L93 Difference]: Finished difference Result 25237 states and 72487 transitions. [2019-12-26 21:59:50,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:59:50,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:59:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:50,856 INFO L225 Difference]: With dead ends: 25237 [2019-12-26 21:59:50,856 INFO L226 Difference]: Without dead ends: 25237 [2019-12-26 21:59:50,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:59:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25237 states. [2019-12-26 21:59:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25237 to 15766. [2019-12-26 21:59:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-12-26 21:59:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 46172 transitions. [2019-12-26 21:59:51,158 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 46172 transitions. Word has length 66 [2019-12-26 21:59:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:51,158 INFO L462 AbstractCegarLoop]: Abstraction has 15766 states and 46172 transitions. [2019-12-26 21:59:51,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:59:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 46172 transitions. [2019-12-26 21:59:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:59:51,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:51,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:51,174 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 6 times [2019-12-26 21:59:51,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:51,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444328197] [2019-12-26 21:59:51,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:51,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444328197] [2019-12-26 21:59:51,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:51,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:59:51,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993012859] [2019-12-26 21:59:51,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:59:51,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:59:51,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:59:51,335 INFO L87 Difference]: Start difference. First operand 15766 states and 46172 transitions. Second operand 11 states. [2019-12-26 21:59:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:52,536 INFO L93 Difference]: Finished difference Result 23147 states and 66955 transitions. [2019-12-26 21:59:52,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 21:59:52,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:59:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:52,561 INFO L225 Difference]: With dead ends: 23147 [2019-12-26 21:59:52,561 INFO L226 Difference]: Without dead ends: 18005 [2019-12-26 21:59:52,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:59:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18005 states. [2019-12-26 21:59:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18005 to 15208. [2019-12-26 21:59:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-26 21:59:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44534 transitions. [2019-12-26 21:59:52,817 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44534 transitions. Word has length 66 [2019-12-26 21:59:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:52,817 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44534 transitions. [2019-12-26 21:59:52,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:59:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44534 transitions. [2019-12-26 21:59:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:59:52,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:52,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:52,834 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:52,834 INFO L82 PathProgramCache]: Analyzing trace with hash 777925054, now seen corresponding path program 7 times [2019-12-26 21:59:52,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:52,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482828776] [2019-12-26 21:59:52,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:53,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482828776] [2019-12-26 21:59:53,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:53,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:59:53,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801465284] [2019-12-26 21:59:53,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:59:53,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:59:53,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:59:53,019 INFO L87 Difference]: Start difference. First operand 15208 states and 44534 transitions. Second operand 10 states. [2019-12-26 21:59:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:55,597 INFO L93 Difference]: Finished difference Result 28214 states and 80972 transitions. [2019-12-26 21:59:55,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:59:55,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:59:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:55,634 INFO L225 Difference]: With dead ends: 28214 [2019-12-26 21:59:55,635 INFO L226 Difference]: Without dead ends: 28214 [2019-12-26 21:59:55,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:59:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28214 states. [2019-12-26 21:59:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28214 to 13004. [2019-12-26 21:59:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13004 states. [2019-12-26 21:59:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13004 states to 13004 states and 38434 transitions. [2019-12-26 21:59:55,925 INFO L78 Accepts]: Start accepts. Automaton has 13004 states and 38434 transitions. Word has length 66 [2019-12-26 21:59:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:55,925 INFO L462 AbstractCegarLoop]: Abstraction has 13004 states and 38434 transitions. [2019-12-26 21:59:55,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:59:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 13004 states and 38434 transitions. [2019-12-26 21:59:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:59:55,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:55,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:55,938 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:55,939 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 8 times [2019-12-26 21:59:55,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:55,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747697980] [2019-12-26 21:59:55,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:56,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747697980] [2019-12-26 21:59:56,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:56,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:56,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980412028] [2019-12-26 21:59:56,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:59:56,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:59:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:56,050 INFO L87 Difference]: Start difference. First operand 13004 states and 38434 transitions. Second operand 4 states. [2019-12-26 21:59:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:56,181 INFO L93 Difference]: Finished difference Result 14948 states and 44329 transitions. [2019-12-26 21:59:56,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:56,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 21:59:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:56,216 INFO L225 Difference]: With dead ends: 14948 [2019-12-26 21:59:56,217 INFO L226 Difference]: Without dead ends: 14948 [2019-12-26 21:59:56,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14948 states. [2019-12-26 21:59:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14948 to 12181. [2019-12-26 21:59:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12181 states. [2019-12-26 21:59:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12181 states to 12181 states and 36301 transitions. [2019-12-26 21:59:56,640 INFO L78 Accepts]: Start accepts. Automaton has 12181 states and 36301 transitions. Word has length 66 [2019-12-26 21:59:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:56,640 INFO L462 AbstractCegarLoop]: Abstraction has 12181 states and 36301 transitions. [2019-12-26 21:59:56,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 12181 states and 36301 transitions. [2019-12-26 21:59:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:59:56,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:56,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:56,665 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:56,666 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 1 times [2019-12-26 21:59:56,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:56,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614476914] [2019-12-26 21:59:56,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:56,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614476914] [2019-12-26 21:59:56,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:56,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:59:56,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177057694] [2019-12-26 21:59:56,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:59:56,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:59:56,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:59:56,945 INFO L87 Difference]: Start difference. First operand 12181 states and 36301 transitions. Second operand 12 states. [2019-12-26 21:59:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:57,791 INFO L93 Difference]: Finished difference Result 14914 states and 44027 transitions. [2019-12-26 21:59:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:59:57,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:59:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:57,812 INFO L225 Difference]: With dead ends: 14914 [2019-12-26 21:59:57,812 INFO L226 Difference]: Without dead ends: 14493 [2019-12-26 21:59:57,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:59:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2019-12-26 21:59:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 11927. [2019-12-26 21:59:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11927 states. [2019-12-26 21:59:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 35657 transitions. [2019-12-26 21:59:58,344 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 35657 transitions. Word has length 67 [2019-12-26 21:59:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:58,345 INFO L462 AbstractCegarLoop]: Abstraction has 11927 states and 35657 transitions. [2019-12-26 21:59:58,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:59:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 35657 transitions. [2019-12-26 21:59:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:59:58,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:58,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:58,357 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 2 times [2019-12-26 21:59:58,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:58,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835137602] [2019-12-26 21:59:58,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:59:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:59:58,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:59:58,496 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:59:58,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t639~0.base_24| 1)) (= |v_ULTIMATE.start_main_~#t639~0.offset_19| 0) (= 0 v_~weak$$choice0~0_14) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t639~0.base_24| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t639~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t639~0.base_24|) |v_ULTIMATE.start_main_~#t639~0.offset_19| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t639~0.base_24|) 0) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t639~0.base_24|) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ULTIMATE.start_main_~#t640~0.offset=|v_ULTIMATE.start_main_~#t640~0.offset_19|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ULTIMATE.start_main_~#t640~0.base=|v_ULTIMATE.start_main_~#t640~0.base_26|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ULTIMATE.start_main_~#t641~0.base=|v_ULTIMATE.start_main_~#t641~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t639~0.base=|v_ULTIMATE.start_main_~#t639~0.base_24|, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_~#t639~0.offset=|v_ULTIMATE.start_main_~#t639~0.offset_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ULTIMATE.start_main_~#t641~0.offset=|v_ULTIMATE.start_main_~#t641~0.offset_20|, ~y~0=v_~y~0_39, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t640~0.offset, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t640~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t641~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t639~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t639~0.offset, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t641~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 21:59:58,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t640~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t640~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t640~0.base_10|) |v_ULTIMATE.start_main_~#t640~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t640~0.base_10| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t640~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t640~0.offset_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t640~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t640~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t640~0.offset=|v_ULTIMATE.start_main_~#t640~0.offset_9|, ULTIMATE.start_main_~#t640~0.base=|v_ULTIMATE.start_main_~#t640~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t640~0.offset, ULTIMATE.start_main_~#t640~0.base, #length] because there is no mapped edge [2019-12-26 21:59:58,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t641~0.base_13|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t641~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t641~0.base_13|) (= |v_ULTIMATE.start_main_~#t641~0.offset_11| 0) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t641~0.base_13|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t641~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t641~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t641~0.base_13|) |v_ULTIMATE.start_main_~#t641~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t641~0.base=|v_ULTIMATE.start_main_~#t641~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t641~0.offset=|v_ULTIMATE.start_main_~#t641~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t641~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t641~0.offset, #length] because there is no mapped edge [2019-12-26 21:59:58,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:59:58,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In96228061 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In96228061 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out96228061| ~a$w_buff1~0_In96228061) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out96228061| ~a~0_In96228061) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In96228061, ~a$w_buff1~0=~a$w_buff1~0_In96228061, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In96228061, ~a$w_buff1_used~0=~a$w_buff1_used~0_In96228061} OutVars{~a~0=~a~0_In96228061, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out96228061|, ~a$w_buff1~0=~a$w_buff1~0_In96228061, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In96228061, ~a$w_buff1_used~0=~a$w_buff1_used~0_In96228061} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 21:59:58,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1610093385 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1610093385 256)))) (or (and (= ~a$w_buff0_used~0_In1610093385 |P0Thread1of1ForFork1_#t~ite5_Out1610093385|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1610093385|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1610093385, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1610093385} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1610093385|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1610093385, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1610093385} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:59:58,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In130284842 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In130284842 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In130284842 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In130284842 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out130284842| ~a$w_buff1_used~0_In130284842) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out130284842| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In130284842, ~a$w_buff0_used~0=~a$w_buff0_used~0_In130284842, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In130284842, ~a$w_buff1_used~0=~a$w_buff1_used~0_In130284842} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out130284842|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In130284842, ~a$w_buff0_used~0=~a$w_buff0_used~0_In130284842, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In130284842, ~a$w_buff1_used~0=~a$w_buff1_used~0_In130284842} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:59:58,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-346318166 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-346318166 256) 0))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-346318166 0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out-346318166 ~a$r_buff0_thd1~0_In-346318166) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-346318166, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-346318166} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-346318166|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-346318166, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-346318166} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:59:58,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-493661788 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-493661788 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-493661788 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-493661788 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-493661788| ~a$r_buff1_thd1~0_In-493661788) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-493661788|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-493661788, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-493661788, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-493661788, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-493661788} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-493661788|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-493661788, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-493661788, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-493661788, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-493661788} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:59:58,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:59:58,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-183091062 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-183091062| |P2Thread1of1ForFork0_#t~ite20_Out-183091062|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-183091062 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-183091062 256)) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In-183091062 256) 0)) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In-183091062 256))))) .cse1 (= ~a$w_buff0~0_In-183091062 |P2Thread1of1ForFork0_#t~ite20_Out-183091062|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-183091062| |P2Thread1of1ForFork0_#t~ite20_Out-183091062|) (= |P2Thread1of1ForFork0_#t~ite21_Out-183091062| ~a$w_buff0~0_In-183091062) (not .cse1)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-183091062, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-183091062, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-183091062, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-183091062, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-183091062, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-183091062|, ~weak$$choice2~0=~weak$$choice2~0_In-183091062} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-183091062|, ~a$w_buff0~0=~a$w_buff0~0_In-183091062, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-183091062, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-183091062, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-183091062, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-183091062|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-183091062, ~weak$$choice2~0=~weak$$choice2~0_In-183091062} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:59:58,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1731720664 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1731720664| |P2Thread1of1ForFork0_#t~ite26_Out-1731720664|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1731720664 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1731720664 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-1731720664 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1731720664 256) 0)))) (= ~a$w_buff0_used~0_In-1731720664 |P2Thread1of1ForFork0_#t~ite26_Out-1731720664|)) (and (= ~a$w_buff0_used~0_In-1731720664 |P2Thread1of1ForFork0_#t~ite27_Out-1731720664|) (= |P2Thread1of1ForFork0_#t~ite26_In-1731720664| |P2Thread1of1ForFork0_#t~ite26_Out-1731720664|) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1731720664|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1731720664, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1731720664, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1731720664, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1731720664, ~weak$$choice2~0=~weak$$choice2~0_In-1731720664} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1731720664|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1731720664|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1731720664, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1731720664, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1731720664, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1731720664, ~weak$$choice2~0=~weak$$choice2~0_In-1731720664} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 21:59:58,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In834870387 256) 0))) (or (and (= ~a$w_buff1_used~0_In834870387 |P2Thread1of1ForFork0_#t~ite30_Out834870387|) (= |P2Thread1of1ForFork0_#t~ite29_In834870387| |P2Thread1of1ForFork0_#t~ite29_Out834870387|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out834870387| ~a$w_buff1_used~0_In834870387) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out834870387| |P2Thread1of1ForFork0_#t~ite30_Out834870387|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In834870387 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In834870387 256))) (= (mod ~a$w_buff0_used~0_In834870387 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In834870387 256) 0))))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In834870387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In834870387, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In834870387, ~a$w_buff1_used~0=~a$w_buff1_used~0_In834870387, ~weak$$choice2~0=~weak$$choice2~0_In834870387, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In834870387|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In834870387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In834870387, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In834870387, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out834870387|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In834870387, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out834870387|, ~weak$$choice2~0=~weak$$choice2~0_In834870387} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:59:58,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:59:58,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:59:58,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1348052965 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1348052965 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1348052965| ~a$w_buff0_used~0_In1348052965)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1348052965|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1348052965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1348052965} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1348052965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1348052965, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1348052965|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:59:58,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd2~0_In-1275396001 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1275396001 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1275396001 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1275396001 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1275396001| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite12_Out-1275396001| ~a$w_buff1_used~0_In-1275396001) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1275396001, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1275396001, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1275396001, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1275396001} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1275396001, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1275396001, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1275396001, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1275396001|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1275396001} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:59:58,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-514919356 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-514919356 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-514919356 |P1Thread1of1ForFork2_#t~ite13_Out-514919356|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-514919356|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-514919356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-514919356} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-514919356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-514919356, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-514919356|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:59:58,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1042847082 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1042847082 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1042847082 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1042847082 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-1042847082| ~a$r_buff1_thd2~0_In-1042847082)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1042847082| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1042847082, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1042847082, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1042847082, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1042847082} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1042847082, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1042847082, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1042847082, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1042847082, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1042847082|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:59:58,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:59:58,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:59:58,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-1750415336 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1750415336 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-1750415336| |P2Thread1of1ForFork0_#t~ite38_Out-1750415336|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1750415336| ~a~0_In-1750415336) (or .cse0 .cse1) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1750415336| ~a$w_buff1~0_In-1750415336) (not .cse0) (not .cse1) .cse2))) InVars {~a~0=~a~0_In-1750415336, ~a$w_buff1~0=~a$w_buff1~0_In-1750415336, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1750415336, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1750415336} OutVars{~a~0=~a~0_In-1750415336, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1750415336|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1750415336|, ~a$w_buff1~0=~a$w_buff1~0_In-1750415336, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1750415336, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1750415336} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:59:58,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1005799140 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1005799140 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1005799140| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1005799140| ~a$w_buff0_used~0_In-1005799140) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1005799140, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1005799140} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1005799140|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1005799140, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1005799140} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:59:58,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-1192023495 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1192023495 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-1192023495 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1192023495 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1192023495|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1192023495 |P2Thread1of1ForFork0_#t~ite41_Out-1192023495|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1192023495, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1192023495, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1192023495, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1192023495} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1192023495, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1192023495, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1192023495, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1192023495, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1192023495|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:59:58,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-738566919 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-738566919 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-738566919| ~a$r_buff0_thd3~0_In-738566919)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-738566919|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-738566919, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-738566919} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-738566919, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-738566919, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-738566919|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:59:58,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-1417181271 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1417181271 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1417181271 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1417181271 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1417181271| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out-1417181271| ~a$r_buff1_thd3~0_In-1417181271)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1417181271, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1417181271, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1417181271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1417181271} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1417181271|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1417181271, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1417181271, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1417181271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1417181271} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:59:58,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:59:58,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:59:58,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In833009902 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out833009902| |ULTIMATE.start_main_#t~ite47_Out833009902|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In833009902 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out833009902| ~a~0_In833009902)) (and (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite47_Out833009902| ~a$w_buff1~0_In833009902) (not .cse2)))) InVars {~a~0=~a~0_In833009902, ~a$w_buff1~0=~a$w_buff1~0_In833009902, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In833009902, ~a$w_buff1_used~0=~a$w_buff1_used~0_In833009902} OutVars{~a~0=~a~0_In833009902, ~a$w_buff1~0=~a$w_buff1~0_In833009902, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out833009902|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In833009902, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out833009902|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In833009902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:59:58,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1245282852 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1245282852 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1245282852| ~a$w_buff0_used~0_In-1245282852)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1245282852| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1245282852, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1245282852} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1245282852, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1245282852|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1245282852} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:59:58,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1378987708 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1378987708 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1378987708 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1378987708 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1378987708|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-1378987708 |ULTIMATE.start_main_#t~ite50_Out-1378987708|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1378987708, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1378987708, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1378987708, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1378987708} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1378987708|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1378987708, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1378987708, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1378987708, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1378987708} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:59:58,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-135580956 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-135580956 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-135580956| 0)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In-135580956 |ULTIMATE.start_main_#t~ite51_Out-135580956|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-135580956, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-135580956} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-135580956|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-135580956, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-135580956} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:59:58,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1724842717 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1724842717 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1724842717 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1724842717 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1724842717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In1724842717 |ULTIMATE.start_main_#t~ite52_Out1724842717|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1724842717, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1724842717, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1724842717, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1724842717} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1724842717|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1724842717, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1724842717, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1724842717, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1724842717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:59:58,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:59:58,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:59:58 BasicIcfg [2019-12-26 21:59:58,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:59:58,669 INFO L168 Benchmark]: Toolchain (without parser) took 107037.80 ms. Allocated memory was 137.9 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 99.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-26 21:59:58,670 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 21:59:58,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.87 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 154.0 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:58,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.43 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:58,671 INFO L168 Benchmark]: Boogie Preprocessor took 78.20 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:58,671 INFO L168 Benchmark]: RCFGBuilder took 932.95 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 98.6 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:58,672 INFO L168 Benchmark]: TraceAbstraction took 105076.65 ms. Allocated memory was 201.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-26 21:59:58,674 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.76 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.87 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.0 MB in the beginning and 154.0 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.43 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.20 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 932.95 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 98.6 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105076.65 ms. Allocated memory was 201.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t639, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t640, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t641, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) 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, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 104.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6948 SDtfs, 9885 SDslu, 23414 SDs, 0 SdLazy, 14582 SolverSat, 443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 88 SyntacticMatches, 21 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 175238 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1701 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1602 ConstructedInterpolants, 0 QuantifiedInterpolants, 375549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...