/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/mix039_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:30:45,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:30:45,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:30:45,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:30:45,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:30:45,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:30:45,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:30:45,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:30:45,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:30:45,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:30:45,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:30:45,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:30:45,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:30:45,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:30:45,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:30:45,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:30:45,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:30:45,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:30:45,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:30:45,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:30:45,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:30:45,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:30:45,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:30:45,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:30:45,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:30:45,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:30:45,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:30:45,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:30:45,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:30:45,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:30:45,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:30:45,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:30:45,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:30:45,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:30:45,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:30:45,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:30:45,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:30:45,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:30:45,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:30:45,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:30:45,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:30:45,538 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 22:30:45,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:30:45,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:30:45,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:30:45,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:30:45,560 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:30:45,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:30:45,560 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:30:45,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:30:45,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:30:45,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:30:45,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:30:45,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:30:45,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:30:45,563 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:30:45,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:30:45,563 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:30:45,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:30:45,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:30:45,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:30:45,564 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:30:45,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:30:45,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:30:45,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:30:45,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:30:45,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:30:45,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:30:45,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:30:45,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:30:45,566 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:30:45,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:30:45,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:30:45,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:30:45,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:30:45,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:30:45,925 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:30:45,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_rmo.opt.i [2019-12-26 22:30:45,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4052df/9846459068744dcd9413559295f9f05c/FLAG54f4d1490 [2019-12-26 22:30:46,589 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:30:46,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_rmo.opt.i [2019-12-26 22:30:46,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4052df/9846459068744dcd9413559295f9f05c/FLAG54f4d1490 [2019-12-26 22:30:46,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4052df/9846459068744dcd9413559295f9f05c [2019-12-26 22:30:46,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:30:46,822 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:30:46,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:30:46,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:30:46,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:30:46,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:30:46" (1/1) ... [2019-12-26 22:30:46,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6a8a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:46, skipping insertion in model container [2019-12-26 22:30:46,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:30:46" (1/1) ... [2019-12-26 22:30:46,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:30:46,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:30:47,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:30:47,378 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:30:47,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:30:47,563 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:30:47,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47 WrapperNode [2019-12-26 22:30:47,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:30:47,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:30:47,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:30:47,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:30:47,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:30:47,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:30:47,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:30:47,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:30:47,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (1/1) ... [2019-12-26 22:30:47,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:30:47,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:30:47,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:30:47,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:30:47,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (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 22:30:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:30:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:30:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:30:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:30:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:30:47,750 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:30:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:30:47,750 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:30:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:30:47,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:30:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:30:47,751 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:30:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:30:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:30:47,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:30:47,754 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 22:30:48,469 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:30:48,470 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:30:48,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:30:48 BoogieIcfgContainer [2019-12-26 22:30:48,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:30:48,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:30:48,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:30:48,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:30:48,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:30:46" (1/3) ... [2019-12-26 22:30:48,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e23c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:30:48, skipping insertion in model container [2019-12-26 22:30:48,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:30:47" (2/3) ... [2019-12-26 22:30:48,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e23c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:30:48, skipping insertion in model container [2019-12-26 22:30:48,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:30:48" (3/3) ... [2019-12-26 22:30:48,484 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_rmo.opt.i [2019-12-26 22:30:48,495 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:30:48,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:30:48,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:30:48,512 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:30:48,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,571 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,573 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,573 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,578 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,578 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,642 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,647 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,648 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,649 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:30:48,666 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:30:48,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:30:48,684 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:30:48,684 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:30:48,684 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:30:48,684 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:30:48,684 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:30:48,684 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:30:48,684 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:30:48,698 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-26 22:30:48,700 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-26 22:30:48,800 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-26 22:30:48,800 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:30:48,817 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-26 22:30:48,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-26 22:30:48,891 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-26 22:30:48,891 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:30:48,897 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-26 22:30:48,914 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-26 22:30:48,915 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:30:53,816 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 22:30:54,392 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-26 22:30:54,541 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-26 22:30:54,556 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-26 22:30:54,556 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-26 22:30:54,559 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-26 22:30:55,816 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-26 22:30:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-26 22:30:55,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:30:55,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:55,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:30:55,825 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:30:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-26 22:30:55,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:55,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111434299] [2019-12-26 22:30:55,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:56,167 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 22:30:56,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111434299] [2019-12-26 22:30:56,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:56,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:30:56,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951993768] [2019-12-26 22:30:56,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:30:56,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:56,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:30:56,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:30:56,206 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-26 22:30:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:56,688 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-26 22:30:56,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:30:56,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:30:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:57,679 INFO L225 Difference]: With dead ends: 20958 [2019-12-26 22:30:57,679 INFO L226 Difference]: Without dead ends: 19662 [2019-12-26 22:30:57,683 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 22:30:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-26 22:30:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-26 22:30:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-26 22:30:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-26 22:30:58,714 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-26 22:30:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:58,716 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-26 22:30:58,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:30:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-26 22:30:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:30:58,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:58,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:30:58,729 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:30:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-26 22:30:58,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:58,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523045419] [2019-12-26 22:30:58,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:58,893 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 22:30:58,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523045419] [2019-12-26 22:30:58,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:58,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:30:58,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121923001] [2019-12-26 22:30:58,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:30:58,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:30:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:30:58,898 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-26 22:30:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:59,585 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-26 22:30:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:30:59,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:30:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:59,741 INFO L225 Difference]: With dead ends: 30494 [2019-12-26 22:30:59,741 INFO L226 Difference]: Without dead ends: 30438 [2019-12-26 22:30:59,742 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 22:31:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-26 22:31:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-26 22:31:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-26 22:31:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-26 22:31:02,142 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-26 22:31:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:02,142 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-26 22:31:02,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:31:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-26 22:31:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:31:02,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:02,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:31:02,150 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-26 22:31:02,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:02,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402928568] [2019-12-26 22:31:02,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:02,264 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 22:31:02,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402928568] [2019-12-26 22:31:02,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:02,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:31:02,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140161430] [2019-12-26 22:31:02,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:31:02,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:02,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:31:02,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:31:02,270 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-26 22:31:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:02,628 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-26 22:31:02,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:31:02,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 22:31:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:02,789 INFO L225 Difference]: With dead ends: 35230 [2019-12-26 22:31:02,789 INFO L226 Difference]: Without dead ends: 35182 [2019-12-26 22:31:02,790 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 22:31:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-26 22:31:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-26 22:31:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-26 22:31:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-26 22:31:05,297 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-26 22:31:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:05,297 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-26 22:31:05,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:31:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-26 22:31:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 22:31:05,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:05,312 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] [2019-12-26 22:31:05,313 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-26 22:31:05,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:05,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155327267] [2019-12-26 22:31:05,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:05,358 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 22:31:05,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155327267] [2019-12-26 22:31:05,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:05,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:31:05,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911967744] [2019-12-26 22:31:05,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:31:05,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:31:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:31:05,361 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-26 22:31:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:05,804 INFO L93 Difference]: Finished difference Result 30328 states and 126949 transitions. [2019-12-26 22:31:05,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:31:05,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-26 22:31:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:05,881 INFO L225 Difference]: With dead ends: 30328 [2019-12-26 22:31:05,881 INFO L226 Difference]: Without dead ends: 30328 [2019-12-26 22:31:05,881 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 22:31:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-12-26 22:31:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 30328. [2019-12-26 22:31:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30328 states. [2019-12-26 22:31:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30328 states to 30328 states and 126949 transitions. [2019-12-26 22:31:07,014 INFO L78 Accepts]: Start accepts. Automaton has 30328 states and 126949 transitions. Word has length 20 [2019-12-26 22:31:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:07,014 INFO L462 AbstractCegarLoop]: Abstraction has 30328 states and 126949 transitions. [2019-12-26 22:31:07,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:31:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 30328 states and 126949 transitions. [2019-12-26 22:31:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 22:31:07,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:07,028 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] [2019-12-26 22:31:07,028 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-26 22:31:07,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:07,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735959317] [2019-12-26 22:31:07,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:07,072 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 22:31:07,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735959317] [2019-12-26 22:31:07,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:07,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:31:07,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36972735] [2019-12-26 22:31:07,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:31:07,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:31:07,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:31:07,074 INFO L87 Difference]: Start difference. First operand 30328 states and 126949 transitions. Second operand 3 states. [2019-12-26 22:31:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:07,301 INFO L93 Difference]: Finished difference Result 44924 states and 179717 transitions. [2019-12-26 22:31:07,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:31:07,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-26 22:31:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:07,377 INFO L225 Difference]: With dead ends: 44924 [2019-12-26 22:31:07,377 INFO L226 Difference]: Without dead ends: 32296 [2019-12-26 22:31:07,378 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 22:31:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2019-12-26 22:31:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 31012. [2019-12-26 22:31:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31012 states. [2019-12-26 22:31:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31012 states to 31012 states and 116299 transitions. [2019-12-26 22:31:09,719 INFO L78 Accepts]: Start accepts. Automaton has 31012 states and 116299 transitions. Word has length 21 [2019-12-26 22:31:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:09,720 INFO L462 AbstractCegarLoop]: Abstraction has 31012 states and 116299 transitions. [2019-12-26 22:31:09,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:31:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31012 states and 116299 transitions. [2019-12-26 22:31:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 22:31:09,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:09,731 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] [2019-12-26 22:31:09,732 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1131875471, now seen corresponding path program 1 times [2019-12-26 22:31:09,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:09,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833624699] [2019-12-26 22:31:09,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:09,812 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 22:31:09,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833624699] [2019-12-26 22:31:09,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:09,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:31:09,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600371103] [2019-12-26 22:31:09,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:31:09,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:09,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:31:09,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:31:09,815 INFO L87 Difference]: Start difference. First operand 31012 states and 116299 transitions. Second operand 3 states. [2019-12-26 22:31:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:09,948 INFO L93 Difference]: Finished difference Result 30604 states and 114575 transitions. [2019-12-26 22:31:09,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:31:09,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-26 22:31:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:10,016 INFO L225 Difference]: With dead ends: 30604 [2019-12-26 22:31:10,017 INFO L226 Difference]: Without dead ends: 30604 [2019-12-26 22:31:10,017 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 22:31:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30604 states. [2019-12-26 22:31:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30604 to 30436. [2019-12-26 22:31:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30436 states. [2019-12-26 22:31:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30436 states to 30436 states and 114095 transitions. [2019-12-26 22:31:10,849 INFO L78 Accepts]: Start accepts. Automaton has 30436 states and 114095 transitions. Word has length 21 [2019-12-26 22:31:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:10,849 INFO L462 AbstractCegarLoop]: Abstraction has 30436 states and 114095 transitions. [2019-12-26 22:31:10,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:31:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30436 states and 114095 transitions. [2019-12-26 22:31:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:31:10,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:10,863 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 22:31:10,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:10,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1107033684, now seen corresponding path program 1 times [2019-12-26 22:31:10,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:10,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592574441] [2019-12-26 22:31:10,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:31:10,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592574441] [2019-12-26 22:31:10,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:10,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:31:10,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350365762] [2019-12-26 22:31:10,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:31:10,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:31:10,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:31:10,923 INFO L87 Difference]: Start difference. First operand 30436 states and 114095 transitions. Second operand 3 states. [2019-12-26 22:31:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:11,473 INFO L93 Difference]: Finished difference Result 30436 states and 112751 transitions. [2019-12-26 22:31:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:31:11,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-26 22:31:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:11,537 INFO L225 Difference]: With dead ends: 30436 [2019-12-26 22:31:11,537 INFO L226 Difference]: Without dead ends: 30436 [2019-12-26 22:31:11,538 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 22:31:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30436 states. [2019-12-26 22:31:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30436 to 30036. [2019-12-26 22:31:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30036 states. [2019-12-26 22:31:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30036 states to 30036 states and 111391 transitions. [2019-12-26 22:31:12,103 INFO L78 Accepts]: Start accepts. Automaton has 30036 states and 111391 transitions. Word has length 22 [2019-12-26 22:31:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:12,103 INFO L462 AbstractCegarLoop]: Abstraction has 30036 states and 111391 transitions. [2019-12-26 22:31:12,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:31:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 30036 states and 111391 transitions. [2019-12-26 22:31:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 22:31:12,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:12,116 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] [2019-12-26 22:31:12,117 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:12,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:12,117 INFO L82 PathProgramCache]: Analyzing trace with hash -428330177, now seen corresponding path program 1 times [2019-12-26 22:31:12,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:12,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075368316] [2019-12-26 22:31:12,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:12,190 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 22:31:12,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075368316] [2019-12-26 22:31:12,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:12,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:31:12,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856920363] [2019-12-26 22:31:12,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:31:12,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:12,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:31:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:31:12,192 INFO L87 Difference]: Start difference. First operand 30036 states and 111391 transitions. Second operand 4 states. [2019-12-26 22:31:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:12,317 INFO L93 Difference]: Finished difference Result 25667 states and 89340 transitions. [2019-12-26 22:31:12,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:31:12,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-26 22:31:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:12,715 INFO L225 Difference]: With dead ends: 25667 [2019-12-26 22:31:12,715 INFO L226 Difference]: Without dead ends: 23877 [2019-12-26 22:31:12,716 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 22:31:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23877 states. [2019-12-26 22:31:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23877 to 23877. [2019-12-26 22:31:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23877 states. [2019-12-26 22:31:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23877 states to 23877 states and 83947 transitions. [2019-12-26 22:31:13,107 INFO L78 Accepts]: Start accepts. Automaton has 23877 states and 83947 transitions. Word has length 23 [2019-12-26 22:31:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:13,108 INFO L462 AbstractCegarLoop]: Abstraction has 23877 states and 83947 transitions. [2019-12-26 22:31:13,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:31:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 23877 states and 83947 transitions. [2019-12-26 22:31:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:31:13,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:13,117 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] [2019-12-26 22:31:13,117 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:13,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1442998109, now seen corresponding path program 1 times [2019-12-26 22:31:13,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:13,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215333033] [2019-12-26 22:31:13,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:13,160 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 22:31:13,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215333033] [2019-12-26 22:31:13,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:13,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:31:13,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753010666] [2019-12-26 22:31:13,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:31:13,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:13,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:31:13,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:31:13,162 INFO L87 Difference]: Start difference. First operand 23877 states and 83947 transitions. Second operand 4 states. [2019-12-26 22:31:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:13,298 INFO L93 Difference]: Finished difference Result 34038 states and 116336 transitions. [2019-12-26 22:31:13,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:31:13,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-26 22:31:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:13,337 INFO L225 Difference]: With dead ends: 34038 [2019-12-26 22:31:13,337 INFO L226 Difference]: Without dead ends: 21154 [2019-12-26 22:31:13,338 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 22:31:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21154 states. [2019-12-26 22:31:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21154 to 20871. [2019-12-26 22:31:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20871 states. [2019-12-26 22:31:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20871 states to 20871 states and 73508 transitions. [2019-12-26 22:31:14,025 INFO L78 Accepts]: Start accepts. Automaton has 20871 states and 73508 transitions. Word has length 24 [2019-12-26 22:31:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:14,025 INFO L462 AbstractCegarLoop]: Abstraction has 20871 states and 73508 transitions. [2019-12-26 22:31:14,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:31:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 20871 states and 73508 transitions. [2019-12-26 22:31:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:31:14,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:14,033 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] [2019-12-26 22:31:14,033 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1161161883, now seen corresponding path program 1 times [2019-12-26 22:31:14,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:14,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058094740] [2019-12-26 22:31:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:31:14,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058094740] [2019-12-26 22:31:14,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:14,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:31:14,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013392736] [2019-12-26 22:31:14,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:31:14,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:14,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:31:14,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:31:14,112 INFO L87 Difference]: Start difference. First operand 20871 states and 73508 transitions. Second operand 5 states. [2019-12-26 22:31:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:14,207 INFO L93 Difference]: Finished difference Result 9585 states and 29775 transitions. [2019-12-26 22:31:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:31:14,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-26 22:31:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:14,224 INFO L225 Difference]: With dead ends: 9585 [2019-12-26 22:31:14,224 INFO L226 Difference]: Without dead ends: 8268 [2019-12-26 22:31:14,225 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 22:31:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2019-12-26 22:31:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 8268. [2019-12-26 22:31:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8268 states. [2019-12-26 22:31:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 25567 transitions. [2019-12-26 22:31:14,347 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 25567 transitions. Word has length 24 [2019-12-26 22:31:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:14,347 INFO L462 AbstractCegarLoop]: Abstraction has 8268 states and 25567 transitions. [2019-12-26 22:31:14,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:31:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 25567 transitions. [2019-12-26 22:31:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:31:14,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:14,351 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 22:31:14,351 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1743073835, now seen corresponding path program 1 times [2019-12-26 22:31:14,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:14,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099164302] [2019-12-26 22:31:14,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:14,424 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 22:31:14,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099164302] [2019-12-26 22:31:14,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:14,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:31:14,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037283241] [2019-12-26 22:31:14,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:31:14,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:14,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:31:14,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:31:14,426 INFO L87 Difference]: Start difference. First operand 8268 states and 25567 transitions. Second operand 4 states. [2019-12-26 22:31:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:14,488 INFO L93 Difference]: Finished difference Result 12230 states and 37956 transitions. [2019-12-26 22:31:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:31:14,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:31:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:14,499 INFO L225 Difference]: With dead ends: 12230 [2019-12-26 22:31:14,499 INFO L226 Difference]: Without dead ends: 7682 [2019-12-26 22:31:14,500 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 22:31:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2019-12-26 22:31:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7209. [2019-12-26 22:31:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-12-26 22:31:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 21269 transitions. [2019-12-26 22:31:14,603 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 21269 transitions. Word has length 25 [2019-12-26 22:31:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:14,603 INFO L462 AbstractCegarLoop]: Abstraction has 7209 states and 21269 transitions. [2019-12-26 22:31:14,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:31:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 21269 transitions. [2019-12-26 22:31:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:31:14,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:14,607 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 22:31:14,607 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -82285579, now seen corresponding path program 2 times [2019-12-26 22:31:14,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:14,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591644906] [2019-12-26 22:31:14,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:14,713 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 22:31:14,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591644906] [2019-12-26 22:31:14,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:14,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:31:14,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917252198] [2019-12-26 22:31:14,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:31:14,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:31:14,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:31:14,715 INFO L87 Difference]: Start difference. First operand 7209 states and 21269 transitions. Second operand 6 states. [2019-12-26 22:31:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:14,820 INFO L93 Difference]: Finished difference Result 2913 states and 7585 transitions. [2019-12-26 22:31:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:31:14,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 22:31:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:14,826 INFO L225 Difference]: With dead ends: 2913 [2019-12-26 22:31:14,827 INFO L226 Difference]: Without dead ends: 2472 [2019-12-26 22:31:14,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:31:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-12-26 22:31:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-12-26 22:31:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-12-26 22:31:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 6301 transitions. [2019-12-26 22:31:14,874 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 6301 transitions. Word has length 25 [2019-12-26 22:31:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:14,876 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 6301 transitions. [2019-12-26 22:31:14,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:31:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 6301 transitions. [2019-12-26 22:31:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:31:14,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:14,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:31:14,883 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:14,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-26 22:31:14,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:14,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845387284] [2019-12-26 22:31:14,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:14,965 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 22:31:14,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845387284] [2019-12-26 22:31:14,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:14,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:31:14,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611443561] [2019-12-26 22:31:14,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:31:14,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:31:14,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:31:14,970 INFO L87 Difference]: Start difference. First operand 2472 states and 6301 transitions. Second operand 3 states. [2019-12-26 22:31:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:15,030 INFO L93 Difference]: Finished difference Result 3752 states and 9516 transitions. [2019-12-26 22:31:15,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:31:15,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-26 22:31:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:15,037 INFO L225 Difference]: With dead ends: 3752 [2019-12-26 22:31:15,038 INFO L226 Difference]: Without dead ends: 3752 [2019-12-26 22:31:15,038 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 22:31:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-26 22:31:15,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2928. [2019-12-26 22:31:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-26 22:31:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 7542 transitions. [2019-12-26 22:31:15,094 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 7542 transitions. Word has length 32 [2019-12-26 22:31:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:15,094 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 7542 transitions. [2019-12-26 22:31:15,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:31:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 7542 transitions. [2019-12-26 22:31:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:31:15,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:15,099 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] [2019-12-26 22:31:15,101 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-26 22:31:15,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:15,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736667325] [2019-12-26 22:31:15,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:15,202 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 22:31:15,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736667325] [2019-12-26 22:31:15,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:15,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:31:15,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022772471] [2019-12-26 22:31:15,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:31:15,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:15,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:31:15,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:31:15,205 INFO L87 Difference]: Start difference. First operand 2928 states and 7542 transitions. Second operand 6 states. [2019-12-26 22:31:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:15,624 INFO L93 Difference]: Finished difference Result 5425 states and 13386 transitions. [2019-12-26 22:31:15,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:31:15,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-26 22:31:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:15,632 INFO L225 Difference]: With dead ends: 5425 [2019-12-26 22:31:15,633 INFO L226 Difference]: Without dead ends: 5242 [2019-12-26 22:31:15,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:31:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2019-12-26 22:31:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2952. [2019-12-26 22:31:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-26 22:31:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 7548 transitions. [2019-12-26 22:31:15,701 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 7548 transitions. Word has length 32 [2019-12-26 22:31:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:15,701 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 7548 transitions. [2019-12-26 22:31:15,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:31:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 7548 transitions. [2019-12-26 22:31:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:31:15,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:15,705 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 22:31:15,705 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:15,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-26 22:31:15,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:15,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245108847] [2019-12-26 22:31:15,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:15,793 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 22:31:15,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245108847] [2019-12-26 22:31:15,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:15,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:31:15,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320310493] [2019-12-26 22:31:15,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:31:15,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:31:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:31:15,795 INFO L87 Difference]: Start difference. First operand 2952 states and 7548 transitions. Second operand 6 states. [2019-12-26 22:31:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:16,255 INFO L93 Difference]: Finished difference Result 5331 states and 12930 transitions. [2019-12-26 22:31:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:31:16,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-26 22:31:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:16,262 INFO L225 Difference]: With dead ends: 5331 [2019-12-26 22:31:16,262 INFO L226 Difference]: Without dead ends: 5133 [2019-12-26 22:31:16,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:31:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-12-26 22:31:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 2837. [2019-12-26 22:31:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-26 22:31:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 7139 transitions. [2019-12-26 22:31:16,308 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 7139 transitions. Word has length 33 [2019-12-26 22:31:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:16,309 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 7139 transitions. [2019-12-26 22:31:16,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:31:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 7139 transitions. [2019-12-26 22:31:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:31:16,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:16,312 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] [2019-12-26 22:31:16,312 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1104473775, now seen corresponding path program 1 times [2019-12-26 22:31:16,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:16,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014931119] [2019-12-26 22:31:16,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:16,412 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 22:31:16,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014931119] [2019-12-26 22:31:16,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:16,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:31:16,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101230111] [2019-12-26 22:31:16,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:31:16,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:31:16,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:31:16,414 INFO L87 Difference]: Start difference. First operand 2837 states and 7139 transitions. Second operand 7 states. [2019-12-26 22:31:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:16,519 INFO L93 Difference]: Finished difference Result 2153 states and 5477 transitions. [2019-12-26 22:31:16,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:31:16,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:31:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:16,521 INFO L225 Difference]: With dead ends: 2153 [2019-12-26 22:31:16,521 INFO L226 Difference]: Without dead ends: 476 [2019-12-26 22:31:16,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:31:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-26 22:31:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2019-12-26 22:31:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-12-26 22:31:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1059 transitions. [2019-12-26 22:31:16,528 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1059 transitions. Word has length 34 [2019-12-26 22:31:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:16,528 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 1059 transitions. [2019-12-26 22:31:16,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:31:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1059 transitions. [2019-12-26 22:31:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 22:31:16,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:16,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:31:16,529 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:16,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:16,530 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 1 times [2019-12-26 22:31:16,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:16,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682028019] [2019-12-26 22:31:16,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:16,622 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 22:31:16,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682028019] [2019-12-26 22:31:16,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:16,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:31:16,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746472508] [2019-12-26 22:31:16,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:31:16,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:16,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:31:16,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:31:16,625 INFO L87 Difference]: Start difference. First operand 470 states and 1059 transitions. Second operand 7 states. [2019-12-26 22:31:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:16,780 INFO L93 Difference]: Finished difference Result 892 states and 1966 transitions. [2019-12-26 22:31:16,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:31:16,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-26 22:31:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:16,782 INFO L225 Difference]: With dead ends: 892 [2019-12-26 22:31:16,782 INFO L226 Difference]: Without dead ends: 594 [2019-12-26 22:31:16,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:31:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-26 22:31:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-26 22:31:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-26 22:31:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-26 22:31:16,790 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-26 22:31:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:16,791 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-26 22:31:16,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:31:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-26 22:31:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 22:31:16,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:16,793 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] [2019-12-26 22:31:16,793 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 2 times [2019-12-26 22:31:16,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:16,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847008525] [2019-12-26 22:31:16,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:31:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:31:16,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:31:16,969 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:31:16,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1045~0.base_71| 4)) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1045~0.base_71| 1)) (= 0 |v_ULTIMATE.start_main_~#t1045~0.offset_43|) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1045~0.base_71|) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1045~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1045~0.base_71|) |v_ULTIMATE.start_main_~#t1045~0.offset_43| 0)) |v_#memory_int_27|) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1045~0.base_71|)) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1047~0.base=|v_ULTIMATE.start_main_~#t1047~0.base_36|, ULTIMATE.start_main_~#t1046~0.offset=|v_ULTIMATE.start_main_~#t1046~0.offset_41|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ULTIMATE.start_main_~#t1045~0.offset=|v_ULTIMATE.start_main_~#t1045~0.offset_43|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ULTIMATE.start_main_~#t1045~0.base=|v_ULTIMATE.start_main_~#t1045~0.base_71|, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1046~0.base=|v_ULTIMATE.start_main_~#t1046~0.base_68|, ULTIMATE.start_main_~#t1047~0.offset=|v_ULTIMATE.start_main_~#t1047~0.offset_25|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1048~0.base=|v_ULTIMATE.start_main_~#t1048~0.base_36|, ULTIMATE.start_main_~#t1048~0.offset=|v_ULTIMATE.start_main_~#t1048~0.offset_24|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1047~0.base, ULTIMATE.start_main_~#t1046~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1045~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1045~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1046~0.base, ULTIMATE.start_main_~#t1047~0.offset, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1048~0.base, ULTIMATE.start_main_~#t1048~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:31:16,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1046~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1046~0.base_11|)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1046~0.base_11|) 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1046~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1046~0.base_11|) |v_ULTIMATE.start_main_~#t1046~0.offset_10| 1))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1046~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1046~0.base_11|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1046~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1046~0.offset=|v_ULTIMATE.start_main_~#t1046~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1046~0.base=|v_ULTIMATE.start_main_~#t1046~0.base_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1046~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1046~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:31:16,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1047~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1047~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1047~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1047~0.base_12|) |v_ULTIMATE.start_main_~#t1047~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1047~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1047~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1047~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1047~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1047~0.base=|v_ULTIMATE.start_main_~#t1047~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1047~0.offset=|v_ULTIMATE.start_main_~#t1047~0.offset_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1047~0.base, ULTIMATE.start_main_~#t1047~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:31:16,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1048~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1048~0.base_12|) |v_ULTIMATE.start_main_~#t1048~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1048~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1048~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1048~0.base_12| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1048~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1048~0.offset_10|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1048~0.base_12| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1048~0.base=|v_ULTIMATE.start_main_~#t1048~0.base_12|, ULTIMATE.start_main_~#t1048~0.offset=|v_ULTIMATE.start_main_~#t1048~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1048~0.base, ULTIMATE.start_main_~#t1048~0.offset, #length] because there is no mapped edge [2019-12-26 22:31:16,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff1_thd3~0_Out-886711650 ~z$r_buff0_thd3~0_In-886711650) (= 1 ~a~0_Out-886711650) (= ~__unbuffered_p3_EAX~0_Out-886711650 ~a~0_Out-886711650) (= ~z$r_buff0_thd4~0_Out-886711650 1) (= ~z$r_buff0_thd4~0_In-886711650 ~z$r_buff1_thd4~0_Out-886711650) (= ~b~0_In-886711650 ~__unbuffered_p3_EBX~0_Out-886711650) (= ~z$r_buff0_thd2~0_In-886711650 ~z$r_buff1_thd2~0_Out-886711650) (= ~z$r_buff1_thd0~0_Out-886711650 ~z$r_buff0_thd0~0_In-886711650) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-886711650 0)) (= ~z$r_buff0_thd1~0_In-886711650 ~z$r_buff1_thd1~0_Out-886711650)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-886711650, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-886711650, ~b~0=~b~0_In-886711650, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-886711650, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-886711650, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-886711650, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-886711650} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-886711650, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-886711650, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-886711650, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-886711650, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-886711650, ~a~0=~a~0_Out-886711650, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-886711650, ~b~0=~b~0_In-886711650, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-886711650, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-886711650, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-886711650, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-886711650, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-886711650, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-886711650, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-886711650} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:31:16,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-26 22:31:16,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~y~0_18 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-26 22:31:16,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1338663578 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_Out1338663578| ~z$w_buff0~0_In1338663578) .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out1338663578| |P2Thread1of1ForFork1_#t~ite9_Out1338663578|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1338663578 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1338663578 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1338663578 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1338663578 256) 0))))) (and (= ~z$w_buff0~0_In1338663578 |P2Thread1of1ForFork1_#t~ite9_Out1338663578|) (= |P2Thread1of1ForFork1_#t~ite8_In1338663578| |P2Thread1of1ForFork1_#t~ite8_Out1338663578|) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1338663578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1338663578, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1338663578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1338663578, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1338663578, ~weak$$choice2~0=~weak$$choice2~0_In1338663578, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1338663578|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1338663578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1338663578, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1338663578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1338663578, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1338663578, ~weak$$choice2~0=~weak$$choice2~0_In1338663578, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1338663578|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1338663578|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:31:16,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-93777040 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In-93777040| |P2Thread1of1ForFork1_#t~ite11_Out-93777040|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out-93777040| ~z$w_buff1~0_In-93777040)) (and (= |P2Thread1of1ForFork1_#t~ite12_Out-93777040| |P2Thread1of1ForFork1_#t~ite11_Out-93777040|) (= ~z$w_buff1~0_In-93777040 |P2Thread1of1ForFork1_#t~ite11_Out-93777040|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-93777040 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-93777040 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-93777040 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-93777040 256))))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-93777040, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-93777040, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-93777040|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-93777040, ~z$w_buff1~0=~z$w_buff1~0_In-93777040, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-93777040, ~weak$$choice2~0=~weak$$choice2~0_In-93777040} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-93777040, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-93777040|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-93777040, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-93777040|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-93777040, ~z$w_buff1~0=~z$w_buff1~0_In-93777040, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-93777040, ~weak$$choice2~0=~weak$$choice2~0_In-93777040} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:31:16,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1590799855 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_Out1590799855| ~z$w_buff0_used~0_In1590799855) (= |P2Thread1of1ForFork1_#t~ite14_Out1590799855| |P2Thread1of1ForFork1_#t~ite15_Out1590799855|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1590799855 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1590799855 256)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1590799855 256))) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In1590799855 256) 0)))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite14_In1590799855| |P2Thread1of1ForFork1_#t~ite14_Out1590799855|) (= ~z$w_buff0_used~0_In1590799855 |P2Thread1of1ForFork1_#t~ite15_Out1590799855|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1590799855|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1590799855, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1590799855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1590799855, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1590799855, ~weak$$choice2~0=~weak$$choice2~0_In1590799855} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1590799855|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1590799855|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1590799855, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1590799855, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1590799855, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1590799855, ~weak$$choice2~0=~weak$$choice2~0_In1590799855} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-26 22:31:16,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-26 22:31:16,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In557142386 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In557142386| |P2Thread1of1ForFork1_#t~ite23_Out557142386|) (= ~z$r_buff1_thd3~0_In557142386 |P2Thread1of1ForFork1_#t~ite24_Out557142386|)) (and .cse0 (= ~z$r_buff1_thd3~0_In557142386 |P2Thread1of1ForFork1_#t~ite23_Out557142386|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In557142386 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In557142386 256))) (= 0 (mod ~z$w_buff0_used~0_In557142386 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In557142386 256))))) (= |P2Thread1of1ForFork1_#t~ite24_Out557142386| |P2Thread1of1ForFork1_#t~ite23_Out557142386|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In557142386, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In557142386, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In557142386|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In557142386, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In557142386, ~weak$$choice2~0=~weak$$choice2~0_In557142386} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out557142386|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In557142386, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In557142386, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out557142386|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In557142386, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In557142386, ~weak$$choice2~0=~weak$$choice2~0_In557142386} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-26 22:31:16,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:31:16,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-796289450 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-796289450 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-796289450| 0) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-796289450| ~z$w_buff0_used~0_In-796289450) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-796289450, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-796289450} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-796289450|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-796289450, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-796289450} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-26 22:31:16,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1596356156 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1596356156 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1596356156 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1596356156 256)))) (or (and (= ~z$w_buff1_used~0_In-1596356156 |P3Thread1of1ForFork2_#t~ite29_Out-1596356156|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out-1596356156| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1596356156, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1596356156, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1596356156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1596356156} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1596356156|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1596356156, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1596356156, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1596356156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1596356156} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-26 22:31:16,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-348281254 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-348281254 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-348281254) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out-348281254 ~z$r_buff0_thd4~0_In-348281254) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-348281254, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-348281254} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-348281254, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-348281254, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-348281254|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-26 22:31:16,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-774262411 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-774262411 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-774262411 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-774262411 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out-774262411| ~z$r_buff1_thd4~0_In-774262411) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out-774262411| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-774262411, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774262411, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-774262411, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-774262411} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-774262411, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-774262411, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-774262411, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-774262411, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-774262411|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-26 22:31:16,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-26 22:31:16,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:31:16,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1162701640 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1162701640 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1162701640| |ULTIMATE.start_main_#t~ite36_Out-1162701640|))) (or (and (= ~z$w_buff1~0_In-1162701640 |ULTIMATE.start_main_#t~ite36_Out-1162701640|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~z~0_In-1162701640 |ULTIMATE.start_main_#t~ite36_Out-1162701640|) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1162701640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1162701640, ~z$w_buff1~0=~z$w_buff1~0_In-1162701640, ~z~0=~z~0_In-1162701640} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1162701640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1162701640, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1162701640|, ~z$w_buff1~0=~z$w_buff1~0_In-1162701640, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1162701640|, ~z~0=~z~0_In-1162701640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 22:31:16,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1671173126 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1671173126 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1671173126|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1671173126 |ULTIMATE.start_main_#t~ite38_Out-1671173126|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1671173126, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1671173126} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1671173126, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1671173126, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1671173126|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:31:16,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In454405350 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In454405350 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In454405350 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In454405350 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out454405350| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In454405350 |ULTIMATE.start_main_#t~ite39_Out454405350|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In454405350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In454405350, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In454405350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In454405350} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In454405350, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out454405350|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In454405350, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In454405350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In454405350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:31:16,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-558920912 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-558920912 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-558920912 |ULTIMATE.start_main_#t~ite40_Out-558920912|)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-558920912|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-558920912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-558920912} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-558920912, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-558920912|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-558920912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:31:16,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1077149124 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1077149124 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1077149124 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1077149124 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite41_Out-1077149124| 0)) (and (= ~z$r_buff1_thd0~0_In-1077149124 |ULTIMATE.start_main_#t~ite41_Out-1077149124|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1077149124, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1077149124, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1077149124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1077149124} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1077149124|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1077149124, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1077149124, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1077149124, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1077149124} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 22:31:16,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:31:17,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:31:17 BasicIcfg [2019-12-26 22:31:17,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:31:17,101 INFO L168 Benchmark]: Toolchain (without parser) took 30279.66 ms. Allocated memory was 146.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 103.2 MB in the beginning and 966.5 MB in the end (delta: -863.3 MB). Peak memory consumption was 640.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:31:17,102 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:31:17,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.66 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.8 MB in the beginning and 157.5 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:31:17,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.88 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:31:17,104 INFO L168 Benchmark]: Boogie Preprocessor took 42.36 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:31:17,104 INFO L168 Benchmark]: RCFGBuilder took 794.65 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 106.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:31:17,105 INFO L168 Benchmark]: TraceAbstraction took 28626.20 ms. Allocated memory was 203.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 106.6 MB in the beginning and 966.5 MB in the end (delta: -859.9 MB). Peak memory consumption was 586.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:31:17,114 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.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.66 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.8 MB in the beginning and 157.5 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.88 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.36 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.65 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 106.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28626.20 ms. Allocated memory was 203.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 106.6 MB in the beginning and 966.5 MB in the end (delta: -859.9 MB). Peak memory consumption was 586.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1045, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1046, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1047, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1048, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1800 SDtfs, 2563 SDslu, 2872 SDs, 0 SdLazy, 1049 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31012occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 15582 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 29991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...