/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/mix047_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:42:02,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:42:02,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:42:02,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:42:02,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:42:02,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:42:02,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:42:02,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:42:02,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:42:02,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:42:02,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:42:02,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:42:02,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:42:02,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:42:02,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:42:02,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:42:02,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:42:02,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:42:02,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:42:02,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:42:02,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:42:02,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:42:02,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:42:02,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:42:02,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:42:02,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:42:02,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:42:02,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:42:02,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:42:02,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:42:02,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:42:02,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:42:02,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:42:02,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:42:02,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:42:02,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:42:02,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:42:02,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:42:02,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:42:02,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:42:02,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:42:02,561 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-18 13:42:02,593 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:42:02,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:42:02,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:42:02,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:42:02,595 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:42:02,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:42:02,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:42:02,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:42:02,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:42:02,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:42:02,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:42:02,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:42:02,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:42:02,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:42:02,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:42:02,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:42:02,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:42:02,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:42:02,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:42:02,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:42:02,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:42:02,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:42:02,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:42:02,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:42:02,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:42:02,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:42:02,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:42:02,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:42:02,600 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:42:02,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:42:02,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:42:02,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:42:02,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:42:02,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:42:02,902 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:42:02,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2019-12-18 13:42:02,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e8809d4/7845ba0072e94aae8c56514607674f02/FLAG3c8514b5a [2019-12-18 13:42:03,464 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:42:03,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2019-12-18 13:42:03,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e8809d4/7845ba0072e94aae8c56514607674f02/FLAG3c8514b5a [2019-12-18 13:42:03,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e8809d4/7845ba0072e94aae8c56514607674f02 [2019-12-18 13:42:03,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:42:03,810 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:42:03,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:42:03,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:42:03,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:42:03,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:42:03" (1/1) ... [2019-12-18 13:42:03,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749fc15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:03, skipping insertion in model container [2019-12-18 13:42:03,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:42:03" (1/1) ... [2019-12-18 13:42:03,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:42:03,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:42:04,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:42:04,455 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:42:04,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:42:04,683 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:42:04,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04 WrapperNode [2019-12-18 13:42:04,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:42:04,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:42:04,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:42:04,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:42:04,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:42:04,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:42:04,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:42:04,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:42:04,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (1/1) ... [2019-12-18 13:42:04,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:42:04,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:42:04,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:42:04,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:42:04,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (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-18 13:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:42:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:42:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:42:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:42:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:42:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:42:04,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:42:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:42:04,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:42:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:42:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:42:04,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:42:04,914 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:42:05,677 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:42:05,678 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:42:05,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:42:05 BoogieIcfgContainer [2019-12-18 13:42:05,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:42:05,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:42:05,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:42:05,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:42:05,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:42:03" (1/3) ... [2019-12-18 13:42:05,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f636e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:42:05, skipping insertion in model container [2019-12-18 13:42:05,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:42:04" (2/3) ... [2019-12-18 13:42:05,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f636e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:42:05, skipping insertion in model container [2019-12-18 13:42:05,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:42:05" (3/3) ... [2019-12-18 13:42:05,689 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_tso.oepc.i [2019-12-18 13:42:05,700 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:42:05,700 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:42:05,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:42:05,712 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:42:05,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,762 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,762 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,771 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,771 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,800 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,804 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,804 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,807 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,807 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,809 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:42:05,825 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:42:05,846 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:42:05,846 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:42:05,846 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:42:05,847 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:42:05,847 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:42:05,847 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:42:05,847 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:42:05,847 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:42:05,865 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 13:42:05,867 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 13:42:05,977 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 13:42:05,977 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:42:05,998 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:42:06,019 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 13:42:06,085 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 13:42:06,086 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:42:06,092 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:42:06,108 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:42:06,109 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:42:11,245 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 13:42:11,395 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 13:42:11,446 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-18 13:42:11,446 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-18 13:42:11,450 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-18 13:42:13,706 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-18 13:42:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-18 13:42:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:42:13,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:13,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:13,717 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-18 13:42:13,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:13,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658057016] [2019-12-18 13:42:13,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:42:14,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658057016] [2019-12-18 13:42:14,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:14,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:42:14,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816574644] [2019-12-18 13:42:14,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:42:14,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:14,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:42:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:42:14,662 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-18 13:42:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:15,431 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-18 13:42:15,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:42:15,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:42:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:15,771 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 13:42:15,772 INFO L226 Difference]: Without dead ends: 33638 [2019-12-18 13:42:15,773 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-18 13:42:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-18 13:42:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-18 13:42:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-18 13:42:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-18 13:42:17,666 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-18 13:42:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:17,667 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-18 13:42:17,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:42:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-18 13:42:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:42:17,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:17,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:17,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:17,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-18 13:42:17,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:17,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65108932] [2019-12-18 13:42:17,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:17,814 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-18 13:42:17,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65108932] [2019-12-18 13:42:17,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:17,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:42:17,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55706793] [2019-12-18 13:42:17,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:42:17,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:17,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:42:17,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:42:17,818 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-18 13:42:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:19,740 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-18 13:42:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:42:19,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:42:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:20,036 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 13:42:20,036 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 13:42:20,037 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-18 13:42:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 13:42:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-18 13:42:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-18 13:42:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-18 13:42:22,257 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-18 13:42:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:22,257 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-18 13:42:22,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:42:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-18 13:42:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:42:22,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:22,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:22,262 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-18 13:42:22,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:22,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381948221] [2019-12-18 13:42:22,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:22,326 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-18 13:42:22,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381948221] [2019-12-18 13:42:22,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:22,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:42:22,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967799736] [2019-12-18 13:42:22,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:42:22,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:22,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:42:22,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:42:22,331 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-18 13:42:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:22,488 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-18 13:42:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:42:22,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:42:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:22,604 INFO L225 Difference]: With dead ends: 37462 [2019-12-18 13:42:22,605 INFO L226 Difference]: Without dead ends: 37462 [2019-12-18 13:42:22,605 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-18 13:42:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-18 13:42:25,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-18 13:42:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-18 13:42:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-18 13:42:25,954 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-18 13:42:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:25,954 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-18 13:42:25,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:42:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-18 13:42:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:42:25,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:25,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:25,957 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:25,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:25,957 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-18 13:42:25,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:25,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073093863] [2019-12-18 13:42:25,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:26,023 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-18 13:42:26,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073093863] [2019-12-18 13:42:26,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:26,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:42:26,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168364430] [2019-12-18 13:42:26,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:42:26,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:26,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:42:26,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:42:26,025 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-18 13:42:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:26,098 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-18 13:42:26,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:42:26,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:42:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:26,128 INFO L225 Difference]: With dead ends: 15610 [2019-12-18 13:42:26,128 INFO L226 Difference]: Without dead ends: 15610 [2019-12-18 13:42:26,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:42:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-18 13:42:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-18 13:42:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-18 13:42:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-18 13:42:26,493 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-18 13:42:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:26,494 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-18 13:42:26,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:42:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-18 13:42:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:42:26,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:26,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:26,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-18 13:42:26,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:26,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465229476] [2019-12-18 13:42:26,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:26,573 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-18 13:42:26,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465229476] [2019-12-18 13:42:26,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:26,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:42:26,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501907271] [2019-12-18 13:42:26,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:42:26,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:26,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:42:26,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:42:26,575 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-18 13:42:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:26,615 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-18 13:42:26,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:42:26,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:42:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:26,619 INFO L225 Difference]: With dead ends: 2718 [2019-12-18 13:42:26,620 INFO L226 Difference]: Without dead ends: 2718 [2019-12-18 13:42:26,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:42:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-18 13:42:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-18 13:42:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-18 13:42:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-18 13:42:26,650 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-18 13:42:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:26,651 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-18 13:42:26,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:42:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-18 13:42:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:42:26,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:26,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:26,656 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-18 13:42:26,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:26,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073871722] [2019-12-18 13:42:26,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:42:26,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073871722] [2019-12-18 13:42:26,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:26,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:42:26,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705533167] [2019-12-18 13:42:26,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:42:26,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:26,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:42:26,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:42:26,758 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-18 13:42:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:26,805 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-18 13:42:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:42:26,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:42:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:26,808 INFO L225 Difference]: With dead ends: 1354 [2019-12-18 13:42:26,808 INFO L226 Difference]: Without dead ends: 1354 [2019-12-18 13:42:26,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:42:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-18 13:42:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-18 13:42:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-18 13:42:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-18 13:42:26,829 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-18 13:42:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:26,829 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-18 13:42:26,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:42:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-18 13:42:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:42:26,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:26,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:26,834 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:26,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:26,836 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-18 13:42:26,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:26,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124768689] [2019-12-18 13:42:26,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:26,954 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-18 13:42:26,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124768689] [2019-12-18 13:42:26,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:26,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:42:26,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323954644] [2019-12-18 13:42:26,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:42:26,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:42:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:42:26,957 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-18 13:42:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:26,996 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-18 13:42:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:42:26,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:42:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:26,999 INFO L225 Difference]: With dead ends: 1222 [2019-12-18 13:42:26,999 INFO L226 Difference]: Without dead ends: 1222 [2019-12-18 13:42:27,000 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-18 13:42:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-18 13:42:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-18 13:42:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 13:42:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-18 13:42:27,017 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-18 13:42:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:27,019 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-18 13:42:27,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:42:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-18 13:42:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:42:27,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:27,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:27,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-18 13:42:27,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:27,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067405946] [2019-12-18 13:42:27,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:27,162 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-18 13:42:27,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067405946] [2019-12-18 13:42:27,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:27,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:42:27,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444658052] [2019-12-18 13:42:27,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:42:27,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:42:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:42:27,164 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 5 states. [2019-12-18 13:42:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:27,402 INFO L93 Difference]: Finished difference Result 1758 states and 5009 transitions. [2019-12-18 13:42:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:42:27,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 13:42:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:27,406 INFO L225 Difference]: With dead ends: 1758 [2019-12-18 13:42:27,406 INFO L226 Difference]: Without dead ends: 1758 [2019-12-18 13:42:27,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:42:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-12-18 13:42:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1413. [2019-12-18 13:42:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-18 13:42:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 4063 transitions. [2019-12-18 13:42:27,433 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 4063 transitions. Word has length 58 [2019-12-18 13:42:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:27,433 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 4063 transitions. [2019-12-18 13:42:27,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:42:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 4063 transitions. [2019-12-18 13:42:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:42:27,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:27,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:27,438 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:27,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:27,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2139138521, now seen corresponding path program 2 times [2019-12-18 13:42:27,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:27,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435179529] [2019-12-18 13:42:27,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:27,562 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-18 13:42:27,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435179529] [2019-12-18 13:42:27,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:27,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:42:27,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504619638] [2019-12-18 13:42:27,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:42:27,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:27,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:42:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:42:27,566 INFO L87 Difference]: Start difference. First operand 1413 states and 4063 transitions. Second operand 6 states. [2019-12-18 13:42:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:28,314 INFO L93 Difference]: Finished difference Result 2360 states and 6721 transitions. [2019-12-18 13:42:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:42:28,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:42:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:28,319 INFO L225 Difference]: With dead ends: 2360 [2019-12-18 13:42:28,319 INFO L226 Difference]: Without dead ends: 2360 [2019-12-18 13:42:28,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:42:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-18 13:42:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1497. [2019-12-18 13:42:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-12-18 13:42:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 4311 transitions. [2019-12-18 13:42:28,343 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 4311 transitions. Word has length 58 [2019-12-18 13:42:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:28,343 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 4311 transitions. [2019-12-18 13:42:28,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:42:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 4311 transitions. [2019-12-18 13:42:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:42:28,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:28,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:28,347 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:28,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1500936233, now seen corresponding path program 3 times [2019-12-18 13:42:28,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:28,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951312694] [2019-12-18 13:42:28,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:42:28,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951312694] [2019-12-18 13:42:28,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:28,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:42:28,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720907834] [2019-12-18 13:42:28,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:42:28,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:42:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:42:28,456 INFO L87 Difference]: Start difference. First operand 1497 states and 4311 transitions. Second operand 6 states. [2019-12-18 13:42:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:28,805 INFO L93 Difference]: Finished difference Result 2371 states and 6747 transitions. [2019-12-18 13:42:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:42:28,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:42:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:28,812 INFO L225 Difference]: With dead ends: 2371 [2019-12-18 13:42:28,812 INFO L226 Difference]: Without dead ends: 2371 [2019-12-18 13:42:28,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:42:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-12-18 13:42:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1685. [2019-12-18 13:42:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-18 13:42:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 4855 transitions. [2019-12-18 13:42:28,840 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 4855 transitions. Word has length 58 [2019-12-18 13:42:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:28,840 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 4855 transitions. [2019-12-18 13:42:28,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:42:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 4855 transitions. [2019-12-18 13:42:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:42:28,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:28,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:28,844 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:28,845 INFO L82 PathProgramCache]: Analyzing trace with hash -774913423, now seen corresponding path program 4 times [2019-12-18 13:42:28,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:28,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428086638] [2019-12-18 13:42:28,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:28,993 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-18 13:42:28,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428086638] [2019-12-18 13:42:28,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:28,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:42:28,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919928636] [2019-12-18 13:42:28,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:42:28,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:42:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:42:28,995 INFO L87 Difference]: Start difference. First operand 1685 states and 4855 transitions. Second operand 7 states. [2019-12-18 13:42:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:29,170 INFO L93 Difference]: Finished difference Result 3565 states and 9684 transitions. [2019-12-18 13:42:29,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:42:29,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 13:42:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:29,176 INFO L225 Difference]: With dead ends: 3565 [2019-12-18 13:42:29,177 INFO L226 Difference]: Without dead ends: 2597 [2019-12-18 13:42:29,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:42:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2019-12-18 13:42:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 1539. [2019-12-18 13:42:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2019-12-18 13:42:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 4361 transitions. [2019-12-18 13:42:29,215 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 4361 transitions. Word has length 58 [2019-12-18 13:42:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:29,216 INFO L462 AbstractCegarLoop]: Abstraction has 1539 states and 4361 transitions. [2019-12-18 13:42:29,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:42:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 4361 transitions. [2019-12-18 13:42:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:42:29,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:29,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:29,220 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 890823083, now seen corresponding path program 5 times [2019-12-18 13:42:29,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:29,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917789160] [2019-12-18 13:42:29,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:29,313 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-18 13:42:29,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917789160] [2019-12-18 13:42:29,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:29,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:42:29,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311463945] [2019-12-18 13:42:29,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:42:29,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:29,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:42:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:42:29,315 INFO L87 Difference]: Start difference. First operand 1539 states and 4361 transitions. Second operand 3 states. [2019-12-18 13:42:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:29,331 INFO L93 Difference]: Finished difference Result 1355 states and 3763 transitions. [2019-12-18 13:42:29,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:42:29,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:42:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:29,334 INFO L225 Difference]: With dead ends: 1355 [2019-12-18 13:42:29,334 INFO L226 Difference]: Without dead ends: 1355 [2019-12-18 13:42:29,335 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-18 13:42:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-12-18 13:42:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2019-12-18 13:42:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-12-18 13:42:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 3763 transitions. [2019-12-18 13:42:29,358 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 3763 transitions. Word has length 58 [2019-12-18 13:42:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:29,359 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 3763 transitions. [2019-12-18 13:42:29,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:42:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 3763 transitions. [2019-12-18 13:42:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:42:29,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:29,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:29,362 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2057740932, now seen corresponding path program 1 times [2019-12-18 13:42:29,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:29,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562113831] [2019-12-18 13:42:29,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:29,441 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-18 13:42:29,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562113831] [2019-12-18 13:42:29,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:29,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:42:29,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102752105] [2019-12-18 13:42:29,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:42:29,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:29,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:42:29,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:42:29,443 INFO L87 Difference]: Start difference. First operand 1355 states and 3763 transitions. Second operand 3 states. [2019-12-18 13:42:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:29,494 INFO L93 Difference]: Finished difference Result 1355 states and 3762 transitions. [2019-12-18 13:42:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:42:29,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:42:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:29,497 INFO L225 Difference]: With dead ends: 1355 [2019-12-18 13:42:29,497 INFO L226 Difference]: Without dead ends: 1355 [2019-12-18 13:42:29,498 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-18 13:42:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-12-18 13:42:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 826. [2019-12-18 13:42:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-18 13:42:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2272 transitions. [2019-12-18 13:42:29,518 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2272 transitions. Word has length 59 [2019-12-18 13:42:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:29,521 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 2272 transitions. [2019-12-18 13:42:29,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:42:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2272 transitions. [2019-12-18 13:42:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:42:29,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:29,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:29,524 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1465585068, now seen corresponding path program 1 times [2019-12-18 13:42:29,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:29,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083005672] [2019-12-18 13:42:29,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:29,668 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-18 13:42:29,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083005672] [2019-12-18 13:42:29,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:29,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:42:29,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348519468] [2019-12-18 13:42:29,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:42:29,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:29,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:42:29,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:42:29,670 INFO L87 Difference]: Start difference. First operand 826 states and 2272 transitions. Second operand 5 states. [2019-12-18 13:42:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:29,730 INFO L93 Difference]: Finished difference Result 1031 states and 2639 transitions. [2019-12-18 13:42:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:42:29,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-18 13:42:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:29,732 INFO L225 Difference]: With dead ends: 1031 [2019-12-18 13:42:29,732 INFO L226 Difference]: Without dead ends: 600 [2019-12-18 13:42:29,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:42:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-18 13:42:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-12-18 13:42:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-18 13:42:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-18 13:42:29,745 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 60 [2019-12-18 13:42:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:29,745 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-18 13:42:29,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:42:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-18 13:42:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:42:29,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:29,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:29,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 2 times [2019-12-18 13:42:29,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:29,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821719367] [2019-12-18 13:42:29,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:29,900 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-18 13:42:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821719367] [2019-12-18 13:42:29,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:29,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:42:29,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856517191] [2019-12-18 13:42:29,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:42:29,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:42:29,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:42:29,902 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 5 states. [2019-12-18 13:42:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:29,952 INFO L93 Difference]: Finished difference Result 785 states and 1776 transitions. [2019-12-18 13:42:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:42:29,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-18 13:42:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:29,953 INFO L225 Difference]: With dead ends: 785 [2019-12-18 13:42:29,954 INFO L226 Difference]: Without dead ends: 232 [2019-12-18 13:42:29,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:42:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-18 13:42:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-12-18 13:42:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-18 13:42:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-18 13:42:29,960 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-18 13:42:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:29,960 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-18 13:42:29,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:42:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-18 13:42:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:42:29,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:29,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:29,961 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 3 times [2019-12-18 13:42:29,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:29,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617764134] [2019-12-18 13:42:29,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:42:30,238 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-18 13:42:30,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617764134] [2019-12-18 13:42:30,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:42:30,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:42:30,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519139616] [2019-12-18 13:42:30,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:42:30,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:42:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:42:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:42:30,240 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 13 states. [2019-12-18 13:42:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:42:30,733 INFO L93 Difference]: Finished difference Result 378 states and 649 transitions. [2019-12-18 13:42:30,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:42:30,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:42:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:42:30,734 INFO L225 Difference]: With dead ends: 378 [2019-12-18 13:42:30,734 INFO L226 Difference]: Without dead ends: 350 [2019-12-18 13:42:30,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:42:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-18 13:42:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 340. [2019-12-18 13:42:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 13:42:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-18 13:42:30,740 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-18 13:42:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:42:30,741 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-18 13:42:30,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:42:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-18 13:42:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:42:30,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:42:30,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:42:30,742 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:42:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:42:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 4 times [2019-12-18 13:42:30,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:42:30,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611346005] [2019-12-18 13:42:30,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:42:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:42:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:42:30,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:42:30,889 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:42:30,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$w_buff0~0_376 0) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1273~0.base_21|) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= |v_ULTIMATE.start_main_~#t1273~0.offset_17| 0) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1273~0.base_21| 1)) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1273~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1273~0.base_21|) |v_ULTIMATE.start_main_~#t1273~0.offset_17| 0)) |v_#memory_int_23|) (= v_~a~0_207 0) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1273~0.base_21| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1273~0.base_21|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1274~0.base=|v_ULTIMATE.start_main_~#t1274~0.base_23|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1273~0.offset=|v_ULTIMATE.start_main_~#t1273~0.offset_17|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ULTIMATE.start_main_~#t1276~0.offset=|v_ULTIMATE.start_main_~#t1276~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ULTIMATE.start_main_~#t1275~0.base=|v_ULTIMATE.start_main_~#t1275~0.base_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ULTIMATE.start_main_~#t1275~0.offset=|v_ULTIMATE.start_main_~#t1275~0.offset_18|, ULTIMATE.start_main_~#t1274~0.offset=|v_ULTIMATE.start_main_~#t1274~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ULTIMATE.start_main_~#t1276~0.base=|v_ULTIMATE.start_main_~#t1276~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1273~0.base=|v_ULTIMATE.start_main_~#t1273~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1274~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1273~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1276~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1275~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1275~0.offset, ULTIMATE.start_main_~#t1274~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1276~0.base, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1273~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:42:30,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1274~0.base_13| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1274~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1274~0.base_13|) |v_ULTIMATE.start_main_~#t1274~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t1274~0.offset_11| 0) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1274~0.base_13| 1)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1274~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1274~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1274~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1274~0.offset=|v_ULTIMATE.start_main_~#t1274~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1274~0.base=|v_ULTIMATE.start_main_~#t1274~0.base_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1274~0.offset, ULTIMATE.start_main_~#t1274~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 13:42:30,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1275~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1275~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1275~0.base_11|) (= |v_ULTIMATE.start_main_~#t1275~0.offset_10| 0) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1275~0.base_11|) 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1275~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1275~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1275~0.base_11|) |v_ULTIMATE.start_main_~#t1275~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1275~0.base=|v_ULTIMATE.start_main_~#t1275~0.base_11|, ULTIMATE.start_main_~#t1275~0.offset=|v_ULTIMATE.start_main_~#t1275~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1275~0.base, ULTIMATE.start_main_~#t1275~0.offset] because there is no mapped edge [2019-12-18 13:42:30,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1276~0.base_13|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1276~0.base_13| 1) |v_#valid_46|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1276~0.base_13|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1276~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1276~0.offset_11| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1276~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1276~0.base_13|) |v_ULTIMATE.start_main_~#t1276~0.offset_11| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1276~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1276~0.base=|v_ULTIMATE.start_main_~#t1276~0.base_13|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1276~0.offset=|v_ULTIMATE.start_main_~#t1276~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1276~0.base, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1276~0.offset] because there is no mapped edge [2019-12-18 13:42:30,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} 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-18 13:42:30,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:42:30,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:42:30,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In696539666 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In696539666 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out696539666|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In696539666 |P3Thread1of1ForFork3_#t~ite11_Out696539666|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In696539666, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In696539666} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In696539666, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In696539666, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out696539666|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:42:30,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-267872149 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-267872149 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-267872149 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-267872149 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out-267872149| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-267872149 |P3Thread1of1ForFork3_#t~ite12_Out-267872149|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-267872149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-267872149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-267872149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-267872149} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-267872149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-267872149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-267872149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-267872149, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-267872149|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:42:30,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1128181089 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1128181089 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1128181089 |P2Thread1of1ForFork2_#t~ite3_Out-1128181089|)) (and (= ~z$w_buff1~0_In-1128181089 |P2Thread1of1ForFork2_#t~ite3_Out-1128181089|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1128181089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128181089, ~z$w_buff1~0=~z$w_buff1~0_In-1128181089, ~z~0=~z~0_In-1128181089} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1128181089|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1128181089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128181089, ~z$w_buff1~0=~z$w_buff1~0_In-1128181089, ~z~0=~z~0_In-1128181089} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:42:30,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:42:30,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-606038932 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-606038932 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-606038932| ~z$w_buff0_used~0_In-606038932)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-606038932| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-606038932, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-606038932} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-606038932|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-606038932, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-606038932} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:42:30,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-493800936 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-493800936 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-493800936 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-493800936 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-493800936| ~z$w_buff1_used~0_In-493800936) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite6_Out-493800936| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-493800936, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-493800936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-493800936, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-493800936} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-493800936|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-493800936, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-493800936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-493800936, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-493800936} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:42:30,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-809395084 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-809395084 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-809395084|) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-809395084| ~z$r_buff0_thd3~0_In-809395084) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-809395084, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-809395084} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-809395084, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-809395084, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-809395084|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:42:30,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1094774800 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1094774800 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1094774800 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1094774800 256)))) (or (and (= ~z$r_buff1_thd3~0_In-1094774800 |P2Thread1of1ForFork2_#t~ite8_Out-1094774800|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite8_Out-1094774800| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1094774800, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1094774800, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1094774800, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1094774800} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1094774800, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1094774800, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1094774800, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1094774800, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1094774800|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:42:30,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:42:30,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-799252695 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-799252695 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-799252695 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out-799252695 ~z$r_buff0_thd4~0_In-799252695)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-799252695, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-799252695} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-799252695, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-799252695, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-799252695|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:42:30,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2072744540 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In2072744540 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2072744540 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In2072744540 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out2072744540|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In2072744540 |P3Thread1of1ForFork3_#t~ite14_Out2072744540|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2072744540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2072744540, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2072744540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2072744540} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2072744540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2072744540, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out2072744540|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2072744540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2072744540} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:42:30,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:42:30,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 13:42:30,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1428290307 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1428290307 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite20_Out1428290307| |ULTIMATE.start_main_#t~ite19_Out1428290307|))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out1428290307| ~z$w_buff1~0_In1428290307) (not .cse2)) (and (or .cse1 .cse2) (= ~z~0_In1428290307 |ULTIMATE.start_main_#t~ite19_Out1428290307|) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1428290307, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1428290307, ~z$w_buff1~0=~z$w_buff1~0_In1428290307, ~z~0=~z~0_In1428290307} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1428290307|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1428290307, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1428290307, ~z$w_buff1~0=~z$w_buff1~0_In1428290307, ~z~0=~z~0_In1428290307, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1428290307|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:42:30,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1116084056 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1116084056 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1116084056|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1116084056 |ULTIMATE.start_main_#t~ite21_Out-1116084056|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1116084056, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1116084056} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1116084056, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1116084056, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1116084056|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:42:30,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-919154157 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-919154157 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-919154157 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-919154157 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-919154157|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-919154157 |ULTIMATE.start_main_#t~ite22_Out-919154157|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-919154157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-919154157, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-919154157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-919154157} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-919154157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-919154157, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-919154157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-919154157, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-919154157|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:42:30,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1393418376 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1393418376 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out1393418376| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1393418376 |ULTIMATE.start_main_#t~ite23_Out1393418376|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1393418376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1393418376} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1393418376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1393418376, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1393418376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:42:30,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1494121964 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1494121964 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1494121964 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1494121964 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-1494121964| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite24_Out-1494121964| ~z$r_buff1_thd0~0_In-1494121964) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1494121964, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1494121964, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1494121964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1494121964} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1494121964, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1494121964, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1494121964, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1494121964|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1494121964} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:42:30,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1605845876 256)))) (or (and (= ~z$w_buff0~0_In-1605845876 |ULTIMATE.start_main_#t~ite31_Out-1605845876|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_In-1605845876| |ULTIMATE.start_main_#t~ite30_Out-1605845876|)) (and (= ~z$w_buff0~0_In-1605845876 |ULTIMATE.start_main_#t~ite30_Out-1605845876|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1605845876 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-1605845876 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-1605845876 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1605845876 256))))) (= |ULTIMATE.start_main_#t~ite31_Out-1605845876| |ULTIMATE.start_main_#t~ite30_Out-1605845876|) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1605845876, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-1605845876|, ~z$w_buff0~0=~z$w_buff0~0_In-1605845876, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1605845876, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1605845876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1605845876, ~weak$$choice2~0=~weak$$choice2~0_In-1605845876} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1605845876, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1605845876|, ~z$w_buff0~0=~z$w_buff0~0_In-1605845876, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1605845876, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1605845876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1605845876, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1605845876|, ~weak$$choice2~0=~weak$$choice2~0_In-1605845876} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-18 13:42:30,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1278503022 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite34_Out-1278503022| |ULTIMATE.start_main_#t~ite33_Out-1278503022|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1278503022 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1278503022 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1278503022 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-1278503022 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite33_Out-1278503022| ~z$w_buff1~0_In-1278503022)) (and (= |ULTIMATE.start_main_#t~ite34_Out-1278503022| ~z$w_buff1~0_In-1278503022) (= |ULTIMATE.start_main_#t~ite33_In-1278503022| |ULTIMATE.start_main_#t~ite33_Out-1278503022|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1278503022, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1278503022, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1278503022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1278503022, ~z$w_buff1~0=~z$w_buff1~0_In-1278503022, ~weak$$choice2~0=~weak$$choice2~0_In-1278503022, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-1278503022|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1278503022, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1278503022, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1278503022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1278503022, ~z$w_buff1~0=~z$w_buff1~0_In-1278503022, ~weak$$choice2~0=~weak$$choice2~0_In-1278503022, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1278503022|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1278503022|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 13:42:30,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:42:30,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1899214782 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1899214782| |ULTIMATE.start_main_#t~ite45_Out-1899214782|) (= |ULTIMATE.start_main_#t~ite45_Out-1899214782| ~z$r_buff1_thd0~0_In-1899214782) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1899214782 256) 0))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1899214782 256))) (= (mod ~z$w_buff0_used~0_In-1899214782 256) 0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1899214782 256))))) .cse1) (and (= |ULTIMATE.start_main_#t~ite46_Out-1899214782| ~z$r_buff1_thd0~0_In-1899214782) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_In-1899214782| |ULTIMATE.start_main_#t~ite45_Out-1899214782|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1899214782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1899214782, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1899214782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1899214782, ~weak$$choice2~0=~weak$$choice2~0_In-1899214782, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1899214782|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1899214782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1899214782, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1899214782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1899214782, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1899214782|, ~weak$$choice2~0=~weak$$choice2~0_In-1899214782, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1899214782|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:42:30,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:42:30,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:42:31,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:42:31 BasicIcfg [2019-12-18 13:42:31,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:42:31,031 INFO L168 Benchmark]: Toolchain (without parser) took 27221.77 ms. Allocated memory was 146.3 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 100.9 MB in the beginning and 595.9 MB in the end (delta: -495.0 MB). Peak memory consumption was 578.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:42:31,032 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:42:31,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 873.37 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 100.5 MB in the beginning and 156.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:42:31,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.54 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:42:31,034 INFO L168 Benchmark]: Boogie Preprocessor took 49.63 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:42:31,035 INFO L168 Benchmark]: RCFGBuilder took 848.15 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 102.5 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:42:31,035 INFO L168 Benchmark]: TraceAbstraction took 25348.63 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 101.5 MB in the beginning and 595.9 MB in the end (delta: -494.4 MB). Peak memory consumption was 521.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:42:31,039 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.21 ms. Allocated memory is still 146.3 MB. Free memory is still 120.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 873.37 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 100.5 MB in the beginning and 156.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.54 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.63 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.15 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 102.5 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25348.63 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 101.5 MB in the beginning and 595.9 MB in the end (delta: -494.4 MB). Peak memory consumption was 521.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1273, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L833] FCALL, FORK 0 pthread_create(&t1274, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L835] FCALL, FORK 0 pthread_create(&t1275, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L837] FCALL, FORK 0 pthread_create(&t1276, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] 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 [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=0, weak$$choice2=0, x=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 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) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=0, weak$$choice2=0, x=2, y=2, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 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 [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=0, weak$$choice2=0, x=2, y=2, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 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) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1662 SDtfs, 1530 SDslu, 3503 SDs, 0 SdLazy, 1358 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 8212 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 748 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 109486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...