/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:13:36,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:13:36,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:13:36,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:13:36,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:13:36,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:13:36,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:13:36,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:13:36,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:13:36,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:13:36,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:13:36,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:13:36,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:13:36,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:13:36,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:13:36,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:13:36,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:13:36,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:13:36,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:13:36,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:13:36,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:13:36,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:13:36,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:13:36,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:13:36,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:13:36,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:13:36,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:13:36,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:13:36,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:13:36,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:13:36,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:13:36,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:13:36,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:13:36,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:13:36,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:13:36,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:13:36,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:13:36,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:13:36,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:13:36,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:13:36,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:13:36,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:13:36,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:13:36,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:13:36,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:13:36,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:13:36,675 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:13:36,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:13:36,676 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:13:36,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:13:36,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:13:36,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:13:36,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:13:36,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:13:36,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:13:36,677 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:13:36,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:13:36,677 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:13:36,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:13:36,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:13:36,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:13:36,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:13:36,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:13:36,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:13:36,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:13:36,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:13:36,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:13:36,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:13:36,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:13:36,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:13:36,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:13:36,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:13:36,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:13:36,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:13:36,992 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:13:36,993 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:13:36,993 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2019-12-18 17:13:37,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80e49d96/acb1365151244f0da11717593555c0be/FLAG193fb3424 [2019-12-18 17:13:37,655 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:13:37,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2019-12-18 17:13:37,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80e49d96/acb1365151244f0da11717593555c0be/FLAG193fb3424 [2019-12-18 17:13:37,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80e49d96/acb1365151244f0da11717593555c0be [2019-12-18 17:13:37,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:13:37,972 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:13:37,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:37,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:13:37,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:13:37,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:37" (1/1) ... [2019-12-18 17:13:37,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd6b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:37, skipping insertion in model container [2019-12-18 17:13:37,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:13:37" (1/1) ... [2019-12-18 17:13:37,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:13:38,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:13:38,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:38,672 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:13:38,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:13:38,840 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:13:38,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38 WrapperNode [2019-12-18 17:13:38,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:13:38,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:38,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:13:38,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:13:38,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:13:38,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:13:38,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:13:38,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:13:38,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (1/1) ... [2019-12-18 17:13:38,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:13:38,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:13:38,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:13:38,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:13:38,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (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 17:13:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:13:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:13:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:13:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:13:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:13:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:13:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:13:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:13:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:13:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:13:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:13:39,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:13:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:13:39,032 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 17:13:39,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:13:39,831 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:13:39,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:39 BoogieIcfgContainer [2019-12-18 17:13:39,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:13:39,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:13:39,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:13:39,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:13:39,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:13:37" (1/3) ... [2019-12-18 17:13:39,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2023f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:39, skipping insertion in model container [2019-12-18 17:13:39,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:13:38" (2/3) ... [2019-12-18 17:13:39,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2023f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:13:39, skipping insertion in model container [2019-12-18 17:13:39,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:13:39" (3/3) ... [2019-12-18 17:13:39,842 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.opt.i [2019-12-18 17:13:39,852 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:13:39,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:13:39,859 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:13:39,860 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:13:39,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,926 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,950 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,968 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:13:39,989 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:13:40,003 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:13:40,004 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:13:40,004 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:13:40,004 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:13:40,004 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:13:40,004 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:13:40,004 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:13:40,004 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:13:40,027 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 17:13:40,029 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 17:13:40,130 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 17:13:40,130 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:40,154 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:13:40,179 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 17:13:40,272 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 17:13:40,272 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:13:40,282 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:13:40,306 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 17:13:40,307 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:13:45,798 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 17:13:45,945 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 17:13:46,073 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66821 [2019-12-18 17:13:46,074 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 17:13:46,077 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 91 transitions [2019-12-18 17:13:57,083 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-18 17:13:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-18 17:13:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:13:57,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:13:57,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:13:57,091 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:13:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:13:57,097 INFO L82 PathProgramCache]: Analyzing trace with hash 802094366, now seen corresponding path program 1 times [2019-12-18 17:13:57,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:13:57,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138130969] [2019-12-18 17:13:57,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:13:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:13:57,351 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 17:13:57,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138130969] [2019-12-18 17:13:57,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:13:57,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:13:57,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093140521] [2019-12-18 17:13:57,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:13:57,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:13:57,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:13:57,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:13:57,377 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-18 17:14:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:01,331 INFO L93 Difference]: Finished difference Result 87938 states and 378592 transitions. [2019-12-18 17:14:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:01,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:14:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:01,936 INFO L225 Difference]: With dead ends: 87938 [2019-12-18 17:14:01,936 INFO L226 Difference]: Without dead ends: 82842 [2019-12-18 17:14:01,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82842 states. [2019-12-18 17:14:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82842 to 82842. [2019-12-18 17:14:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82842 states. [2019-12-18 17:14:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82842 states to 82842 states and 356178 transitions. [2019-12-18 17:14:09,211 INFO L78 Accepts]: Start accepts. Automaton has 82842 states and 356178 transitions. Word has length 5 [2019-12-18 17:14:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:09,212 INFO L462 AbstractCegarLoop]: Abstraction has 82842 states and 356178 transitions. [2019-12-18 17:14:09,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 82842 states and 356178 transitions. [2019-12-18 17:14:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:14:09,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:09,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:09,220 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:09,221 INFO L82 PathProgramCache]: Analyzing trace with hash -136321435, now seen corresponding path program 1 times [2019-12-18 17:14:09,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:09,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922265664] [2019-12-18 17:14:09,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:09,318 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 17:14:09,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922265664] [2019-12-18 17:14:09,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:09,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:09,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370222074] [2019-12-18 17:14:09,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:09,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:09,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:09,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:09,321 INFO L87 Difference]: Start difference. First operand 82842 states and 356178 transitions. Second operand 3 states. [2019-12-18 17:14:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:09,687 INFO L93 Difference]: Finished difference Result 21610 states and 74688 transitions. [2019-12-18 17:14:09,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:09,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:14:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:09,797 INFO L225 Difference]: With dead ends: 21610 [2019-12-18 17:14:09,797 INFO L226 Difference]: Without dead ends: 21610 [2019-12-18 17:14:09,798 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 17:14:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21610 states. [2019-12-18 17:14:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21610 to 21610. [2019-12-18 17:14:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21610 states. [2019-12-18 17:14:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21610 states to 21610 states and 74688 transitions. [2019-12-18 17:14:13,521 INFO L78 Accepts]: Start accepts. Automaton has 21610 states and 74688 transitions. Word has length 13 [2019-12-18 17:14:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:13,522 INFO L462 AbstractCegarLoop]: Abstraction has 21610 states and 74688 transitions. [2019-12-18 17:14:13,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 21610 states and 74688 transitions. [2019-12-18 17:14:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:14:13,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:13,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:13,524 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -120546049, now seen corresponding path program 1 times [2019-12-18 17:14:13,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:13,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559306808] [2019-12-18 17:14:13,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:13,626 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 17:14:13,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559306808] [2019-12-18 17:14:13,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:13,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:13,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788193300] [2019-12-18 17:14:13,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:14:13,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:14:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:13,628 INFO L87 Difference]: Start difference. First operand 21610 states and 74688 transitions. Second operand 4 states. [2019-12-18 17:14:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:14,010 INFO L93 Difference]: Finished difference Result 31986 states and 107232 transitions. [2019-12-18 17:14:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:14:14,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:14:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:14,221 INFO L225 Difference]: With dead ends: 31986 [2019-12-18 17:14:14,222 INFO L226 Difference]: Without dead ends: 31972 [2019-12-18 17:14:14,222 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 17:14:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31972 states. [2019-12-18 17:14:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31972 to 28300. [2019-12-18 17:14:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28300 states. [2019-12-18 17:14:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28300 states to 28300 states and 95848 transitions. [2019-12-18 17:14:15,088 INFO L78 Accepts]: Start accepts. Automaton has 28300 states and 95848 transitions. Word has length 13 [2019-12-18 17:14:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:15,088 INFO L462 AbstractCegarLoop]: Abstraction has 28300 states and 95848 transitions. [2019-12-18 17:14:15,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:14:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 28300 states and 95848 transitions. [2019-12-18 17:14:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:14:15,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:15,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:15,091 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2051868705, now seen corresponding path program 1 times [2019-12-18 17:14:15,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:15,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486785532] [2019-12-18 17:14:15,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:15,176 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 17:14:15,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486785532] [2019-12-18 17:14:15,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:15,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:15,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184333657] [2019-12-18 17:14:15,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:15,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:15,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:15,179 INFO L87 Difference]: Start difference. First operand 28300 states and 95848 transitions. Second operand 5 states. [2019-12-18 17:14:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:15,636 INFO L93 Difference]: Finished difference Result 42745 states and 142288 transitions. [2019-12-18 17:14:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:14:15,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 17:14:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:15,739 INFO L225 Difference]: With dead ends: 42745 [2019-12-18 17:14:15,739 INFO L226 Difference]: Without dead ends: 42727 [2019-12-18 17:14:15,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:14:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42727 states. [2019-12-18 17:14:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42727 to 34163. [2019-12-18 17:14:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34163 states. [2019-12-18 17:14:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34163 states to 34163 states and 114786 transitions. [2019-12-18 17:14:16,968 INFO L78 Accepts]: Start accepts. Automaton has 34163 states and 114786 transitions. Word has length 14 [2019-12-18 17:14:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:16,969 INFO L462 AbstractCegarLoop]: Abstraction has 34163 states and 114786 transitions. [2019-12-18 17:14:16,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 34163 states and 114786 transitions. [2019-12-18 17:14:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:14:16,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:16,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:16,980 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1808091808, now seen corresponding path program 1 times [2019-12-18 17:14:16,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:16,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740256612] [2019-12-18 17:14:16,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:17,122 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 17:14:17,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740256612] [2019-12-18 17:14:17,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:17,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:14:17,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197106799] [2019-12-18 17:14:17,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:14:17,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:17,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:14:17,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:14:17,125 INFO L87 Difference]: Start difference. First operand 34163 states and 114786 transitions. Second operand 6 states. [2019-12-18 17:14:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:18,107 INFO L93 Difference]: Finished difference Result 52347 states and 172257 transitions. [2019-12-18 17:14:18,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:14:18,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 17:14:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:18,216 INFO L225 Difference]: With dead ends: 52347 [2019-12-18 17:14:18,216 INFO L226 Difference]: Without dead ends: 52317 [2019-12-18 17:14:18,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:14:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52317 states. [2019-12-18 17:14:19,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52317 to 34394. [2019-12-18 17:14:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34394 states. [2019-12-18 17:14:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34394 states to 34394 states and 114647 transitions. [2019-12-18 17:14:19,373 INFO L78 Accepts]: Start accepts. Automaton has 34394 states and 114647 transitions. Word has length 22 [2019-12-18 17:14:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:19,374 INFO L462 AbstractCegarLoop]: Abstraction has 34394 states and 114647 transitions. [2019-12-18 17:14:19,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:14:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 34394 states and 114647 transitions. [2019-12-18 17:14:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:14:19,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:19,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:19,389 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:19,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1844565345, now seen corresponding path program 1 times [2019-12-18 17:14:19,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:19,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256370817] [2019-12-18 17:14:19,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:19,452 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 17:14:19,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256370817] [2019-12-18 17:14:19,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:19,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:19,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57117088] [2019-12-18 17:14:19,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:14:19,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:19,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:14:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:14:19,454 INFO L87 Difference]: Start difference. First operand 34394 states and 114647 transitions. Second operand 4 states. [2019-12-18 17:14:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:19,518 INFO L93 Difference]: Finished difference Result 13523 states and 41801 transitions. [2019-12-18 17:14:19,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:14:19,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:14:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:19,537 INFO L225 Difference]: With dead ends: 13523 [2019-12-18 17:14:19,537 INFO L226 Difference]: Without dead ends: 13523 [2019-12-18 17:14:19,538 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 17:14:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13523 states. [2019-12-18 17:14:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13523 to 13303. [2019-12-18 17:14:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13303 states. [2019-12-18 17:14:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13303 states to 13303 states and 41151 transitions. [2019-12-18 17:14:19,723 INFO L78 Accepts]: Start accepts. Automaton has 13303 states and 41151 transitions. Word has length 25 [2019-12-18 17:14:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:19,725 INFO L462 AbstractCegarLoop]: Abstraction has 13303 states and 41151 transitions. [2019-12-18 17:14:19,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:14:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 13303 states and 41151 transitions. [2019-12-18 17:14:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:14:19,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:19,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:19,745 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1639479592, now seen corresponding path program 1 times [2019-12-18 17:14:19,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:19,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174139844] [2019-12-18 17:14:19,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:19,854 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 17:14:19,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174139844] [2019-12-18 17:14:19,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:19,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:19,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133261762] [2019-12-18 17:14:19,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:19,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:19,856 INFO L87 Difference]: Start difference. First operand 13303 states and 41151 transitions. Second operand 3 states. [2019-12-18 17:14:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:19,919 INFO L93 Difference]: Finished difference Result 12716 states and 38855 transitions. [2019-12-18 17:14:19,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:19,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 17:14:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:19,942 INFO L225 Difference]: With dead ends: 12716 [2019-12-18 17:14:19,942 INFO L226 Difference]: Without dead ends: 12716 [2019-12-18 17:14:19,943 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 17:14:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2019-12-18 17:14:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 12700. [2019-12-18 17:14:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12700 states. [2019-12-18 17:14:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12700 states to 12700 states and 38815 transitions. [2019-12-18 17:14:20,167 INFO L78 Accepts]: Start accepts. Automaton has 12700 states and 38815 transitions. Word has length 39 [2019-12-18 17:14:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:20,168 INFO L462 AbstractCegarLoop]: Abstraction has 12700 states and 38815 transitions. [2019-12-18 17:14:20,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12700 states and 38815 transitions. [2019-12-18 17:14:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:14:20,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:20,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:20,185 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:20,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1144095462, now seen corresponding path program 1 times [2019-12-18 17:14:20,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:20,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542101095] [2019-12-18 17:14:20,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:20,274 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 17:14:20,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542101095] [2019-12-18 17:14:20,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:20,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:14:20,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426568433] [2019-12-18 17:14:20,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:20,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:20,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:20,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:20,277 INFO L87 Difference]: Start difference. First operand 12700 states and 38815 transitions. Second operand 5 states. [2019-12-18 17:14:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:20,832 INFO L93 Difference]: Finished difference Result 17919 states and 54342 transitions. [2019-12-18 17:14:20,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:14:20,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:14:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:20,858 INFO L225 Difference]: With dead ends: 17919 [2019-12-18 17:14:20,859 INFO L226 Difference]: Without dead ends: 17919 [2019-12-18 17:14:20,859 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 17:14:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17919 states. [2019-12-18 17:14:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17919 to 16320. [2019-12-18 17:14:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16320 states. [2019-12-18 17:14:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16320 states to 16320 states and 49873 transitions. [2019-12-18 17:14:21,207 INFO L78 Accepts]: Start accepts. Automaton has 16320 states and 49873 transitions. Word has length 40 [2019-12-18 17:14:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:21,208 INFO L462 AbstractCegarLoop]: Abstraction has 16320 states and 49873 transitions. [2019-12-18 17:14:21,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16320 states and 49873 transitions. [2019-12-18 17:14:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:14:21,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:21,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:21,230 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2007286560, now seen corresponding path program 2 times [2019-12-18 17:14:21,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:21,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091195725] [2019-12-18 17:14:21,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:21,298 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 17:14:21,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091195725] [2019-12-18 17:14:21,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:21,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:14:21,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176964775] [2019-12-18 17:14:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:14:21,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:21,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:14:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:14:21,300 INFO L87 Difference]: Start difference. First operand 16320 states and 49873 transitions. Second operand 5 states. [2019-12-18 17:14:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:21,386 INFO L93 Difference]: Finished difference Result 14953 states and 46364 transitions. [2019-12-18 17:14:21,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:14:21,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:14:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:21,413 INFO L225 Difference]: With dead ends: 14953 [2019-12-18 17:14:21,413 INFO L226 Difference]: Without dead ends: 14953 [2019-12-18 17:14:21,414 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 17:14:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14953 states. [2019-12-18 17:14:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14953 to 13921. [2019-12-18 17:14:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13921 states. [2019-12-18 17:14:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13921 states to 13921 states and 43359 transitions. [2019-12-18 17:14:21,643 INFO L78 Accepts]: Start accepts. Automaton has 13921 states and 43359 transitions. Word has length 40 [2019-12-18 17:14:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:21,644 INFO L462 AbstractCegarLoop]: Abstraction has 13921 states and 43359 transitions. [2019-12-18 17:14:21,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:14:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 13921 states and 43359 transitions. [2019-12-18 17:14:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:14:21,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:21,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:21,664 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 425228576, now seen corresponding path program 1 times [2019-12-18 17:14:21,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:21,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663617259] [2019-12-18 17:14:21,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:21,821 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 17:14:21,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663617259] [2019-12-18 17:14:21,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:21,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:14:21,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103938413] [2019-12-18 17:14:21,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:14:21,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:14:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:14:21,824 INFO L87 Difference]: Start difference. First operand 13921 states and 43359 transitions. Second operand 9 states. [2019-12-18 17:14:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:23,262 INFO L93 Difference]: Finished difference Result 31249 states and 96830 transitions. [2019-12-18 17:14:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 17:14:23,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 17:14:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:23,294 INFO L225 Difference]: With dead ends: 31249 [2019-12-18 17:14:23,294 INFO L226 Difference]: Without dead ends: 22250 [2019-12-18 17:14:23,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:14:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22250 states. [2019-12-18 17:14:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22250 to 17210. [2019-12-18 17:14:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17210 states. [2019-12-18 17:14:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17210 states to 17210 states and 53206 transitions. [2019-12-18 17:14:23,571 INFO L78 Accepts]: Start accepts. Automaton has 17210 states and 53206 transitions. Word has length 55 [2019-12-18 17:14:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:23,571 INFO L462 AbstractCegarLoop]: Abstraction has 17210 states and 53206 transitions. [2019-12-18 17:14:23,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:14:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17210 states and 53206 transitions. [2019-12-18 17:14:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:14:23,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:23,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:23,591 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash 235395682, now seen corresponding path program 2 times [2019-12-18 17:14:23,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:23,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371072771] [2019-12-18 17:14:23,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:23,647 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 17:14:23,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371072771] [2019-12-18 17:14:23,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:23,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:14:23,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285259621] [2019-12-18 17:14:23,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:23,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:23,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:23,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:23,649 INFO L87 Difference]: Start difference. First operand 17210 states and 53206 transitions. Second operand 3 states. [2019-12-18 17:14:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:23,770 INFO L93 Difference]: Finished difference Result 23156 states and 70253 transitions. [2019-12-18 17:14:23,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:23,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:14:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:23,812 INFO L225 Difference]: With dead ends: 23156 [2019-12-18 17:14:23,812 INFO L226 Difference]: Without dead ends: 23156 [2019-12-18 17:14:23,812 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 17:14:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23156 states. [2019-12-18 17:14:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23156 to 19339. [2019-12-18 17:14:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19339 states. [2019-12-18 17:14:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19339 states to 19339 states and 59397 transitions. [2019-12-18 17:14:24,272 INFO L78 Accepts]: Start accepts. Automaton has 19339 states and 59397 transitions. Word has length 55 [2019-12-18 17:14:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:24,272 INFO L462 AbstractCegarLoop]: Abstraction has 19339 states and 59397 transitions. [2019-12-18 17:14:24,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19339 states and 59397 transitions. [2019-12-18 17:14:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:14:24,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:24,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:24,294 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 579382589, now seen corresponding path program 1 times [2019-12-18 17:14:24,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:24,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841912059] [2019-12-18 17:14:24,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:24,452 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 17:14:24,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841912059] [2019-12-18 17:14:24,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:24,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:14:24,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037495588] [2019-12-18 17:14:24,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:14:24,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:24,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:14:24,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:14:24,454 INFO L87 Difference]: Start difference. First operand 19339 states and 59397 transitions. Second operand 10 states. [2019-12-18 17:14:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:27,272 INFO L93 Difference]: Finished difference Result 35706 states and 106178 transitions. [2019-12-18 17:14:27,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 17:14:27,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-18 17:14:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:27,320 INFO L225 Difference]: With dead ends: 35706 [2019-12-18 17:14:27,320 INFO L226 Difference]: Without dead ends: 35502 [2019-12-18 17:14:27,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 17:14:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35502 states. [2019-12-18 17:14:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35502 to 20462. [2019-12-18 17:14:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20462 states. [2019-12-18 17:14:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20462 states to 20462 states and 62626 transitions. [2019-12-18 17:14:27,687 INFO L78 Accepts]: Start accepts. Automaton has 20462 states and 62626 transitions. Word has length 55 [2019-12-18 17:14:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:27,688 INFO L462 AbstractCegarLoop]: Abstraction has 20462 states and 62626 transitions. [2019-12-18 17:14:27,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:14:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 20462 states and 62626 transitions. [2019-12-18 17:14:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:14:27,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:27,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:27,716 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1244789413, now seen corresponding path program 2 times [2019-12-18 17:14:27,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:27,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839810184] [2019-12-18 17:14:27,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:27,798 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 17:14:27,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839810184] [2019-12-18 17:14:27,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:27,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:14:27,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75218591] [2019-12-18 17:14:27,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:14:27,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:14:27,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:14:27,800 INFO L87 Difference]: Start difference. First operand 20462 states and 62626 transitions. Second operand 3 states. [2019-12-18 17:14:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:27,888 INFO L93 Difference]: Finished difference Result 20460 states and 62621 transitions. [2019-12-18 17:14:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:14:27,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:14:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:27,931 INFO L225 Difference]: With dead ends: 20460 [2019-12-18 17:14:27,932 INFO L226 Difference]: Without dead ends: 20460 [2019-12-18 17:14:27,932 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 17:14:28,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20460 states. [2019-12-18 17:14:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20460 to 16031. [2019-12-18 17:14:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16031 states. [2019-12-18 17:14:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16031 states to 16031 states and 49976 transitions. [2019-12-18 17:14:28,558 INFO L78 Accepts]: Start accepts. Automaton has 16031 states and 49976 transitions. Word has length 55 [2019-12-18 17:14:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:28,559 INFO L462 AbstractCegarLoop]: Abstraction has 16031 states and 49976 transitions. [2019-12-18 17:14:28,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:14:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 16031 states and 49976 transitions. [2019-12-18 17:14:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:28,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:28,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:28,583 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1211542094, now seen corresponding path program 1 times [2019-12-18 17:14:28,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:28,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607910375] [2019-12-18 17:14:28,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:28,946 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 17:14:28,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607910375] [2019-12-18 17:14:28,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:28,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:14:28,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611954747] [2019-12-18 17:14:28,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:14:28,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:14:28,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:14:28,949 INFO L87 Difference]: Start difference. First operand 16031 states and 49976 transitions. Second operand 11 states. [2019-12-18 17:14:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:30,324 INFO L93 Difference]: Finished difference Result 32646 states and 101610 transitions. [2019-12-18 17:14:30,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 17:14:30,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 17:14:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:30,401 INFO L225 Difference]: With dead ends: 32646 [2019-12-18 17:14:30,401 INFO L226 Difference]: Without dead ends: 31120 [2019-12-18 17:14:30,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 17:14:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31120 states. [2019-12-18 17:14:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31120 to 19352. [2019-12-18 17:14:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19352 states. [2019-12-18 17:14:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19352 states to 19352 states and 60634 transitions. [2019-12-18 17:14:30,948 INFO L78 Accepts]: Start accepts. Automaton has 19352 states and 60634 transitions. Word has length 56 [2019-12-18 17:14:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:30,948 INFO L462 AbstractCegarLoop]: Abstraction has 19352 states and 60634 transitions. [2019-12-18 17:14:30,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:14:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 19352 states and 60634 transitions. [2019-12-18 17:14:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:30,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:30,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:30,974 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:30,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1696832882, now seen corresponding path program 2 times [2019-12-18 17:14:30,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:30,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293550927] [2019-12-18 17:14:30,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:31,244 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 17:14:31,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293550927] [2019-12-18 17:14:31,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:31,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:14:31,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828075057] [2019-12-18 17:14:31,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:14:31,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:31,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:14:31,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:14:31,247 INFO L87 Difference]: Start difference. First operand 19352 states and 60634 transitions. Second operand 12 states. [2019-12-18 17:14:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:33,069 INFO L93 Difference]: Finished difference Result 26126 states and 80765 transitions. [2019-12-18 17:14:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:14:33,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 17:14:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:33,107 INFO L225 Difference]: With dead ends: 26126 [2019-12-18 17:14:33,108 INFO L226 Difference]: Without dead ends: 23932 [2019-12-18 17:14:33,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:14:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23932 states. [2019-12-18 17:14:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23932 to 19278. [2019-12-18 17:14:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19278 states. [2019-12-18 17:14:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19278 states to 19278 states and 60298 transitions. [2019-12-18 17:14:33,625 INFO L78 Accepts]: Start accepts. Automaton has 19278 states and 60298 transitions. Word has length 56 [2019-12-18 17:14:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:33,625 INFO L462 AbstractCegarLoop]: Abstraction has 19278 states and 60298 transitions. [2019-12-18 17:14:33,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:14:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 19278 states and 60298 transitions. [2019-12-18 17:14:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:33,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:33,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:33,647 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:33,648 INFO L82 PathProgramCache]: Analyzing trace with hash -274348836, now seen corresponding path program 3 times [2019-12-18 17:14:33,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:33,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002394671] [2019-12-18 17:14:33,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:33,914 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 17:14:33,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002394671] [2019-12-18 17:14:33,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:33,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:14:33,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151719973] [2019-12-18 17:14:33,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:14:33,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:33,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:14:33,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:14:33,916 INFO L87 Difference]: Start difference. First operand 19278 states and 60298 transitions. Second operand 10 states. [2019-12-18 17:14:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:34,857 INFO L93 Difference]: Finished difference Result 33815 states and 104211 transitions. [2019-12-18 17:14:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:14:34,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 17:14:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:34,912 INFO L225 Difference]: With dead ends: 33815 [2019-12-18 17:14:34,912 INFO L226 Difference]: Without dead ends: 26895 [2019-12-18 17:14:34,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:14:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26895 states. [2019-12-18 17:14:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26895 to 18272. [2019-12-18 17:14:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18272 states. [2019-12-18 17:14:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18272 states to 18272 states and 56644 transitions. [2019-12-18 17:14:35,266 INFO L78 Accepts]: Start accepts. Automaton has 18272 states and 56644 transitions. Word has length 56 [2019-12-18 17:14:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:35,267 INFO L462 AbstractCegarLoop]: Abstraction has 18272 states and 56644 transitions. [2019-12-18 17:14:35,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:14:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 18272 states and 56644 transitions. [2019-12-18 17:14:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:35,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:35,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:35,285 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash 802342730, now seen corresponding path program 4 times [2019-12-18 17:14:35,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:35,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790506724] [2019-12-18 17:14:35,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:14:35,571 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 17:14:35,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790506724] [2019-12-18 17:14:35,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:14:35,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:14:35,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137938998] [2019-12-18 17:14:35,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:14:35,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:14:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:14:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:14:35,573 INFO L87 Difference]: Start difference. First operand 18272 states and 56644 transitions. Second operand 11 states. [2019-12-18 17:14:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:14:36,492 INFO L93 Difference]: Finished difference Result 26585 states and 81469 transitions. [2019-12-18 17:14:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:14:36,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 17:14:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:14:36,524 INFO L225 Difference]: With dead ends: 26585 [2019-12-18 17:14:36,524 INFO L226 Difference]: Without dead ends: 22976 [2019-12-18 17:14:36,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:14:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22976 states. [2019-12-18 17:14:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22976 to 15040. [2019-12-18 17:14:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15040 states. [2019-12-18 17:14:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15040 states to 15040 states and 46772 transitions. [2019-12-18 17:14:36,791 INFO L78 Accepts]: Start accepts. Automaton has 15040 states and 46772 transitions. Word has length 56 [2019-12-18 17:14:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:14:36,791 INFO L462 AbstractCegarLoop]: Abstraction has 15040 states and 46772 transitions. [2019-12-18 17:14:36,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:14:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 15040 states and 46772 transitions. [2019-12-18 17:14:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:14:37,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:14:37,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:14:37,013 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:14:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:14:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash -196673722, now seen corresponding path program 5 times [2019-12-18 17:14:37,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:14:37,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936502069] [2019-12-18 17:14:37,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:14:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:14:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:14:37,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:14:37,133 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:14:37,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$r_buff1_thd2~0_202) (= v_~weak$$choice2~0_155 0) (= v_~z~0_13 0) (= v_~__unbuffered_cnt~0_148 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff0_thd1~0_322 0) (= 0 v_~x$r_buff0_thd2~0_247) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21| 1)) (= v_~x$flush_delayed~0_68 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t916~0.base_21| 4)) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t916~0.base_21|) |v_ULTIMATE.start_main_~#t916~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1_used~0_539) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~weak$$choice0~0_35) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t916~0.base_21|) (= v_~x$r_buff1_thd1~0_293 0) (= v_~x$r_buff0_thd0~0_140 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t916~0.base_21|) 0) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$w_buff0~0_441) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~x~0_192) (= v_~main$tmp_guard0~0_20 0) (= v_~y~0_44 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~x$w_buff1~0_298) (= 0 |v_ULTIMATE.start_main_~#t916~0.offset_16|) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX~0_150 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_964) (= v_~x$r_buff1_thd0~0_215 0) (= v_~x$mem_tmp~0_38 0) (= v_~a~0_41 0) (= 0 v_~x$r_buff0_thd3~0_132))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_441, ~x$flush_delayed~0=v_~x$flush_delayed~0_68, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_293, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_270|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~a~0=v_~a~0_41, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t916~0.offset=|v_ULTIMATE.start_main_~#t916~0.offset_16|, ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_298, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_202, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_35, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_148, ~x~0=v_~x~0_192, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_322, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_72|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_38, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y~0=v_~y~0_44, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_964, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_155, ULTIMATE.start_main_~#t916~0.base=|v_ULTIMATE.start_main_~#t916~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t916~0.offset, ULTIMATE.start_main_~#t917~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t918~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t917~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t916~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 17:14:37,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L828-1-->L830: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13|)) (= |v_ULTIMATE.start_main_~#t917~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t917~0.base_13|) |v_ULTIMATE.start_main_~#t917~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t917~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t917~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t917~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t917~0.offset=|v_ULTIMATE.start_main_~#t917~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t917~0.base=|v_ULTIMATE.start_main_~#t917~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t917~0.offset, ULTIMATE.start_main_~#t917~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 17:14:37,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L830-1-->L832: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t918~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t918~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t918~0.base_13|) (= |v_ULTIMATE.start_main_~#t918~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t918~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t918~0.base_13|) |v_ULTIMATE.start_main_~#t918~0.offset_11| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t918~0.base=|v_ULTIMATE.start_main_~#t918~0.base_13|, ULTIMATE.start_main_~#t918~0.offset=|v_ULTIMATE.start_main_~#t918~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t918~0.base, ULTIMATE.start_main_~#t918~0.offset] because there is no mapped edge [2019-12-18 17:14:37,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 1 v_~x$w_buff0~0_19) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= v_~x$w_buff1_used~0_44 v_~x$w_buff0_used~0_74) (= 1 v_~x$w_buff0_used~0_73) (= 0 (mod v_~x$w_buff1_used~0_44 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_74} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_73} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 17:14:37,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In940528902 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In940528902 256)))) (or (and (= ~x~0_In940528902 |P2Thread1of1ForFork2_#t~ite32_Out940528902|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In940528902 |P2Thread1of1ForFork2_#t~ite32_Out940528902|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In940528902, ~x$w_buff1_used~0=~x$w_buff1_used~0_In940528902, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In940528902, ~x~0=~x~0_In940528902} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out940528902|, ~x$w_buff1~0=~x$w_buff1~0_In940528902, ~x$w_buff1_used~0=~x$w_buff1_used~0_In940528902, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In940528902, ~x~0=~x~0_In940528902} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 17:14:37,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-414012121 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-414012121 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-414012121|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-414012121 |P1Thread1of1ForFork1_#t~ite28_Out-414012121|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-414012121, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-414012121} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-414012121, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-414012121|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-414012121} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 17:14:37,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= v_~x~0_35 |v_P2Thread1of1ForFork2_#t~ite32_12|) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_12|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_17|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-18 17:14:37,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1659532905 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1659532905 256) 0))) (or (and (= ~x$w_buff0_used~0_In1659532905 |P2Thread1of1ForFork2_#t~ite34_Out1659532905|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite34_Out1659532905|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1659532905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1659532905} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1659532905|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1659532905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1659532905} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 17:14:37,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In77680703 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In77680703 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In77680703 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In77680703 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out77680703|)) (and (= ~x$w_buff1_used~0_In77680703 |P2Thread1of1ForFork2_#t~ite35_Out77680703|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In77680703, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In77680703, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In77680703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In77680703} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out77680703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In77680703, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In77680703, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In77680703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In77680703} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 17:14:37,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In308367954 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In308367954 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In308367954 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In308367954 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out308367954| ~x$w_buff1_used~0_In308367954)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out308367954| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In308367954, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In308367954, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In308367954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In308367954} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out308367954|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In308367954, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In308367954, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In308367954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In308367954} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 17:14:37,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-793524236 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-793524236 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-793524236 ~x$r_buff0_thd2~0_Out-793524236) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-793524236)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-793524236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-793524236} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-793524236|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-793524236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-793524236} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:14:37,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In207912215 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In207912215 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In207912215 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In207912215 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out207912215|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In207912215 |P1Thread1of1ForFork1_#t~ite31_Out207912215|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In207912215, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In207912215, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In207912215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In207912215} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out207912215|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In207912215, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In207912215, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In207912215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In207912215} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 17:14:37,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_113 |v_P1Thread1of1ForFork1_#t~ite31_42|)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_41|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:14:37,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1405092321 256)))) (or (and (= ~x$w_buff1~0_In-1405092321 |P0Thread1of1ForFork0_#t~ite12_Out-1405092321|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In-1405092321| |P0Thread1of1ForFork0_#t~ite11_Out-1405092321|)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite12_Out-1405092321| |P0Thread1of1ForFork0_#t~ite11_Out-1405092321|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1405092321 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1405092321 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1405092321 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1405092321 256))))) (= ~x$w_buff1~0_In-1405092321 |P0Thread1of1ForFork0_#t~ite11_Out-1405092321|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-1405092321|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1405092321, ~x$w_buff1~0=~x$w_buff1~0_In-1405092321, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1405092321, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1405092321, ~weak$$choice2~0=~weak$$choice2~0_In-1405092321, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1405092321} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1405092321|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1405092321, ~x$w_buff1~0=~x$w_buff1~0_In-1405092321, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1405092321, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1405092321, ~weak$$choice2~0=~weak$$choice2~0_In-1405092321, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1405092321|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1405092321} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:14:37,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L746-->L746-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1500494962 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite14_Out-1500494962| |P0Thread1of1ForFork0_#t~ite15_Out-1500494962|) (= |P0Thread1of1ForFork0_#t~ite14_Out-1500494962| ~x$w_buff0_used~0_In-1500494962) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1500494962 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1500494962 256)) (and (= (mod ~x$r_buff1_thd1~0_In-1500494962 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1500494962 256)))))) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite14_In-1500494962| |P0Thread1of1ForFork0_#t~ite14_Out-1500494962|) (= ~x$w_buff0_used~0_In-1500494962 |P0Thread1of1ForFork0_#t~ite15_Out-1500494962|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1500494962, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1500494962, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1500494962, ~weak$$choice2~0=~weak$$choice2~0_In-1500494962, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In-1500494962|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1500494962} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1500494962, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1500494962, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1500494962, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out-1500494962|, ~weak$$choice2~0=~weak$$choice2~0_In-1500494962, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-1500494962|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1500494962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 17:14:37,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_65 v_~x$r_buff0_thd1~0_64) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_64, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 17:14:37,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= v_~x$flush_delayed~0_20 0) (= v_~x~0_54 v_~x$mem_tmp~0_15) (not (= (mod v_~x$flush_delayed~0_21 256) 0)) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 17:14:37,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1739053364 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1739053364 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite36_Out1739053364| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite36_Out1739053364| ~x$r_buff0_thd3~0_In1739053364) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1739053364, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1739053364} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1739053364|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1739053364, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1739053364} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 17:14:37,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-564422927 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-564422927 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-564422927 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-564422927 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-564422927|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite37_Out-564422927| ~x$r_buff1_thd3~0_In-564422927)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-564422927, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-564422927, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-564422927, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-564422927} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-564422927|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-564422927, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-564422927, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-564422927, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-564422927} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 17:14:37,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_46| v_~x$r_buff1_thd3~0_117)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_45|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_117, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:14:37,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:14:37,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-624531177 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-624531177 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-624531177| ~x~0_In-624531177) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-624531177 |ULTIMATE.start_main_#t~ite41_Out-624531177|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-624531177, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-624531177, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-624531177, ~x~0=~x~0_In-624531177} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-624531177|, ~x$w_buff1~0=~x$w_buff1~0_In-624531177, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-624531177, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-624531177, ~x~0=~x~0_In-624531177} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:14:37,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 17:14:37,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1196831677 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1196831677 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1196831677 |ULTIMATE.start_main_#t~ite43_Out-1196831677|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1196831677| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1196831677, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1196831677} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1196831677, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1196831677|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1196831677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 17:14:37,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-68404968 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-68404968 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-68404968 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-68404968 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-68404968| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-68404968| ~x$w_buff1_used~0_In-68404968) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-68404968, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-68404968, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-68404968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-68404968} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-68404968, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-68404968, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-68404968, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-68404968|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-68404968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:14:37,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1130001088 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1130001088 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1130001088| ~x$r_buff0_thd0~0_In1130001088)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out1130001088|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1130001088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1130001088} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1130001088, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1130001088|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1130001088} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:14:37,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1812290004 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1812290004 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1812290004 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1812290004 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In1812290004 |ULTIMATE.start_main_#t~ite46_Out1812290004|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1812290004|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1812290004, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1812290004, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1812290004, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1812290004} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1812290004, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1812290004|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1812290004, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1812290004, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1812290004} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 17:14:37,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p1_EAX~0_139 0) (= v_~x$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite46_54|) (= v_~main$tmp_guard1~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p0_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_54|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_203, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:14:37,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:14:37 BasicIcfg [2019-12-18 17:14:37,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:14:37,277 INFO L168 Benchmark]: Toolchain (without parser) took 59301.48 ms. Allocated memory was 145.2 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 830.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:14:37,278 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:14:37,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.73 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:14:37,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.26 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:14:37,282 INFO L168 Benchmark]: Boogie Preprocessor took 37.60 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:14:37,282 INFO L168 Benchmark]: RCFGBuilder took 884.01 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 103.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:14:37,283 INFO L168 Benchmark]: TraceAbstraction took 57437.27 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 103.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 775.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:14:37,293 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.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 868.73 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 156.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.26 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.60 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 884.01 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 103.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57437.27 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 103.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 775.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 6463 VarBasedMoverChecksPositive, 266 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 257 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66821 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L841] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 57.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3482 SDtfs, 4762 SDslu, 12919 SDs, 0 SdLazy, 7837 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 39 SyntacticMatches, 12 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89098occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 94333 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 711 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 638 ConstructedInterpolants, 0 QuantifiedInterpolants, 165690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...