/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:40:18,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:40:18,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:40:18,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:40:18,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:40:18,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:40:18,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:40:18,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:40:18,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:40:18,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:40:18,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:40:18,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:40:18,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:40:18,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:40:18,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:40:18,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:40:18,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:40:18,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:40:18,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:40:18,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:40:18,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:40:18,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:40:18,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:40:18,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:40:18,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:40:18,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:40:18,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:40:18,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:40:18,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:40:18,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:40:18,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:40:18,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:40:18,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:40:18,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:40:18,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:40:18,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:40:18,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:40:18,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:40:18,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:40:18,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:40:18,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:40:18,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:40:18,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:40:18,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:40:18,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:40:18,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:40:18,971 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:40:18,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:40:18,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:40:18,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:40:18,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:40:18,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:40:18,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:40:18,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:40:18,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:40:18,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:40:18,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:40:18,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:40:18,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:40:18,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:40:18,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:40:18,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:40:18,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:40:18,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:40:18,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:40:18,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:40:18,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:40:18,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:40:18,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:40:18,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:40:18,976 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:40:18,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:40:19,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:40:19,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:40:19,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:40:19,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:40:19,284 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:40:19,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2019-12-26 23:40:19,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a695473/8323301690c44bf39214284299a73c94/FLAGf8ab3b28c [2019-12-26 23:40:19,882 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:40:19,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2019-12-26 23:40:19,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a695473/8323301690c44bf39214284299a73c94/FLAGf8ab3b28c [2019-12-26 23:40:20,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a695473/8323301690c44bf39214284299a73c94 [2019-12-26 23:40:20,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:40:20,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:40:20,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:40:20,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:40:20,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:40:20,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:20,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20, skipping insertion in model container [2019-12-26 23:40:20,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:20,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:40:20,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:40:20,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:40:20,748 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:40:20,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:40:20,968 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:40:20,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20 WrapperNode [2019-12-26 23:40:20,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:40:20,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:40:20,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:40:20,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:40:20,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:40:21,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:40:21,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:40:21,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:40:21,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... [2019-12-26 23:40:21,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:40:21,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:40:21,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:40:21,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:40:21,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:40:21,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-26 23:40:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:40:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:40:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:40:21,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:40:21,153 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:40:21,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:40:21,154 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:40:21,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:40:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:40:21,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:40:21,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-26 23:40:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:40:21,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:40:21,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:40:21,158 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:40:21,980 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:40:21,980 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-26 23:40:21,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:40:21 BoogieIcfgContainer [2019-12-26 23:40:21,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:40:21,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:40:21,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:40:21,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:40:21,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:40:20" (1/3) ... [2019-12-26 23:40:21,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73afdc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:40:21, skipping insertion in model container [2019-12-26 23:40:21,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:40:20" (2/3) ... [2019-12-26 23:40:21,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73afdc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:40:21, skipping insertion in model container [2019-12-26 23:40:21,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:40:21" (3/3) ... [2019-12-26 23:40:21,992 INFO L109 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2019-12-26 23:40:22,002 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:40:22,002 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:40:22,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-26 23:40:22,012 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:40:22,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,076 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,085 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,085 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,110 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,125 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,129 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,130 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:40:22,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-26 23:40:22,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:40:22,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:40:22,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:40:22,171 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:40:22,171 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:40:22,171 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:40:22,171 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:40:22,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:40:22,188 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 230 transitions [2019-12-26 23:40:22,190 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 230 transitions [2019-12-26 23:40:22,323 INFO L132 PetriNetUnfolder]: 48/227 cut-off events. [2019-12-26 23:40:22,323 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:40:22,341 INFO L76 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 227 events. 48/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 2 conditions per place. [2019-12-26 23:40:22,371 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 230 transitions [2019-12-26 23:40:22,431 INFO L132 PetriNetUnfolder]: 48/227 cut-off events. [2019-12-26 23:40:22,431 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:40:22,440 INFO L76 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 227 events. 48/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 2 conditions per place. [2019-12-26 23:40:22,462 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19530 [2019-12-26 23:40:22,463 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:40:28,307 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-12-26 23:40:28,534 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-26 23:40:29,052 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2019-12-26 23:40:29,289 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-26 23:40:29,310 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80972 [2019-12-26 23:40:29,311 INFO L214 etLargeBlockEncoding]: Total number of compositions: 145 [2019-12-26 23:40:29,314 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 95 transitions [2019-12-26 23:40:39,790 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 88334 states. [2019-12-26 23:40:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 88334 states. [2019-12-26 23:40:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:40:39,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:39,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:39,865 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash -986847660, now seen corresponding path program 1 times [2019-12-26 23:40:39,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:39,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043834706] [2019-12-26 23:40:39,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:40,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043834706] [2019-12-26 23:40:40,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:40,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:40:40,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524523048] [2019-12-26 23:40:40,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:40:40,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:40:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:40,290 INFO L87 Difference]: Start difference. First operand 88334 states. Second operand 3 states. [2019-12-26 23:40:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:43,707 INFO L93 Difference]: Finished difference Result 86714 states and 375258 transitions. [2019-12-26 23:40:43,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:40:43,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 23:40:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:44,411 INFO L225 Difference]: With dead ends: 86714 [2019-12-26 23:40:44,411 INFO L226 Difference]: Without dead ends: 81566 [2019-12-26 23:40:44,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:40:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81566 states. [2019-12-26 23:40:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81566 to 81566. [2019-12-26 23:40:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81566 states. [2019-12-26 23:40:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81566 states to 81566 states and 353106 transitions. [2019-12-26 23:40:51,969 INFO L78 Accepts]: Start accepts. Automaton has 81566 states and 353106 transitions. Word has length 17 [2019-12-26 23:40:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:51,970 INFO L462 AbstractCegarLoop]: Abstraction has 81566 states and 353106 transitions. [2019-12-26 23:40:51,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:40:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 81566 states and 353106 transitions. [2019-12-26 23:40:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:40:51,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:51,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:51,987 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1233893207, now seen corresponding path program 1 times [2019-12-26 23:40:51,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:51,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650209799] [2019-12-26 23:40:51,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:52,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650209799] [2019-12-26 23:40:52,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:52,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:40:52,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246834616] [2019-12-26 23:40:52,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:40:52,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:40:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:40:52,150 INFO L87 Difference]: Start difference. First operand 81566 states and 353106 transitions. Second operand 4 states. [2019-12-26 23:40:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:52,499 INFO L93 Difference]: Finished difference Result 24578 states and 86748 transitions. [2019-12-26 23:40:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:40:52,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 23:40:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:52,569 INFO L225 Difference]: With dead ends: 24578 [2019-12-26 23:40:52,569 INFO L226 Difference]: Without dead ends: 19610 [2019-12-26 23:40:52,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19610 states. [2019-12-26 23:40:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19610 to 19610. [2019-12-26 23:40:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19610 states. [2019-12-26 23:40:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19610 states to 19610 states and 66534 transitions. [2019-12-26 23:40:56,113 INFO L78 Accepts]: Start accepts. Automaton has 19610 states and 66534 transitions. Word has length 18 [2019-12-26 23:40:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:56,113 INFO L462 AbstractCegarLoop]: Abstraction has 19610 states and 66534 transitions. [2019-12-26 23:40:56,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:40:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 19610 states and 66534 transitions. [2019-12-26 23:40:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:40:56,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:56,129 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] [2019-12-26 23:40:56,129 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash -878963340, now seen corresponding path program 1 times [2019-12-26 23:40:56,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:56,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681681138] [2019-12-26 23:40:56,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:56,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681681138] [2019-12-26 23:40:56,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:56,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:40:56,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881638230] [2019-12-26 23:40:56,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:40:56,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:56,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:40:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:40:56,264 INFO L87 Difference]: Start difference. First operand 19610 states and 66534 transitions. Second operand 4 states. [2019-12-26 23:40:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:56,689 INFO L93 Difference]: Finished difference Result 28094 states and 91940 transitions. [2019-12-26 23:40:56,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:40:56,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-26 23:40:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:56,789 INFO L225 Difference]: With dead ends: 28094 [2019-12-26 23:40:56,789 INFO L226 Difference]: Without dead ends: 28094 [2019-12-26 23:40:56,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28094 states. [2019-12-26 23:40:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28094 to 25566. [2019-12-26 23:40:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25566 states. [2019-12-26 23:40:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25566 states to 25566 states and 84762 transitions. [2019-12-26 23:40:57,508 INFO L78 Accepts]: Start accepts. Automaton has 25566 states and 84762 transitions. Word has length 28 [2019-12-26 23:40:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:57,509 INFO L462 AbstractCegarLoop]: Abstraction has 25566 states and 84762 transitions. [2019-12-26 23:40:57,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:40:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 25566 states and 84762 transitions. [2019-12-26 23:40:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:40:57,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:57,525 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] [2019-12-26 23:40:57,525 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 457198623, now seen corresponding path program 1 times [2019-12-26 23:40:57,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:57,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129088009] [2019-12-26 23:40:57,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:57,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129088009] [2019-12-26 23:40:57,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:57,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:40:57,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364688150] [2019-12-26 23:40:57,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:40:57,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:40:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:40:57,654 INFO L87 Difference]: Start difference. First operand 25566 states and 84762 transitions. Second operand 4 states. [2019-12-26 23:40:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:58,029 INFO L93 Difference]: Finished difference Result 33274 states and 107925 transitions. [2019-12-26 23:40:58,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:40:58,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-26 23:40:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:58,090 INFO L225 Difference]: With dead ends: 33274 [2019-12-26 23:40:58,090 INFO L226 Difference]: Without dead ends: 33274 [2019-12-26 23:40:58,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33274 states. [2019-12-26 23:40:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33274 to 28465. [2019-12-26 23:40:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28465 states. [2019-12-26 23:40:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28465 states to 28465 states and 93739 transitions. [2019-12-26 23:40:59,126 INFO L78 Accepts]: Start accepts. Automaton has 28465 states and 93739 transitions. Word has length 28 [2019-12-26 23:40:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:59,126 INFO L462 AbstractCegarLoop]: Abstraction has 28465 states and 93739 transitions. [2019-12-26 23:40:59,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:40:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 28465 states and 93739 transitions. [2019-12-26 23:40:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:40:59,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:59,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:59,144 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2110520713, now seen corresponding path program 1 times [2019-12-26 23:40:59,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:59,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041456255] [2019-12-26 23:40:59,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:59,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041456255] [2019-12-26 23:40:59,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:59,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:40:59,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392597335] [2019-12-26 23:40:59,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:59,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:59,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:59,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:59,254 INFO L87 Difference]: Start difference. First operand 28465 states and 93739 transitions. Second operand 5 states. [2019-12-26 23:40:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:40:59,357 INFO L93 Difference]: Finished difference Result 12038 states and 36499 transitions. [2019-12-26 23:40:59,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:40:59,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 23:40:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:40:59,376 INFO L225 Difference]: With dead ends: 12038 [2019-12-26 23:40:59,376 INFO L226 Difference]: Without dead ends: 10333 [2019-12-26 23:40:59,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:40:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10333 states. [2019-12-26 23:40:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10333 to 10069. [2019-12-26 23:40:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10069 states. [2019-12-26 23:40:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10069 states to 10069 states and 30458 transitions. [2019-12-26 23:40:59,618 INFO L78 Accepts]: Start accepts. Automaton has 10069 states and 30458 transitions. Word has length 29 [2019-12-26 23:40:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:40:59,618 INFO L462 AbstractCegarLoop]: Abstraction has 10069 states and 30458 transitions. [2019-12-26 23:40:59,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:40:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 10069 states and 30458 transitions. [2019-12-26 23:40:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 23:40:59,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:40:59,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:40:59,644 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:40:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:40:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1416589173, now seen corresponding path program 1 times [2019-12-26 23:40:59,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:40:59,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400668352] [2019-12-26 23:40:59,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:40:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:40:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:40:59,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400668352] [2019-12-26 23:40:59,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:40:59,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:40:59,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892985487] [2019-12-26 23:40:59,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:40:59,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:40:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:40:59,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:40:59,739 INFO L87 Difference]: Start difference. First operand 10069 states and 30458 transitions. Second operand 5 states. [2019-12-26 23:41:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:00,230 INFO L93 Difference]: Finished difference Result 11799 states and 35040 transitions. [2019-12-26 23:41:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:41:00,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-26 23:41:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:00,249 INFO L225 Difference]: With dead ends: 11799 [2019-12-26 23:41:00,249 INFO L226 Difference]: Without dead ends: 11799 [2019-12-26 23:41:00,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:41:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11799 states. [2019-12-26 23:41:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11799 to 9629. [2019-12-26 23:41:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9629 states. [2019-12-26 23:41:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9629 states to 9629 states and 29082 transitions. [2019-12-26 23:41:00,467 INFO L78 Accepts]: Start accepts. Automaton has 9629 states and 29082 transitions. Word has length 39 [2019-12-26 23:41:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:00,468 INFO L462 AbstractCegarLoop]: Abstraction has 9629 states and 29082 transitions. [2019-12-26 23:41:00,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:41:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9629 states and 29082 transitions. [2019-12-26 23:41:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:41:00,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:00,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:00,487 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1670978222, now seen corresponding path program 1 times [2019-12-26 23:41:00,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:00,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982428708] [2019-12-26 23:41:00,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:00,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982428708] [2019-12-26 23:41:00,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:00,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:41:00,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300143658] [2019-12-26 23:41:00,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:41:00,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:41:00,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:41:00,607 INFO L87 Difference]: Start difference. First operand 9629 states and 29082 transitions. Second operand 6 states. [2019-12-26 23:41:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:00,702 INFO L93 Difference]: Finished difference Result 8825 states and 27149 transitions. [2019-12-26 23:41:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:41:00,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:41:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:00,716 INFO L225 Difference]: With dead ends: 8825 [2019-12-26 23:41:00,716 INFO L226 Difference]: Without dead ends: 8724 [2019-12-26 23:41:00,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:41:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8724 states. [2019-12-26 23:41:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8724 to 8436. [2019-12-26 23:41:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-26 23:41:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 26170 transitions. [2019-12-26 23:41:01,004 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 26170 transitions. Word has length 40 [2019-12-26 23:41:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:01,004 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 26170 transitions. [2019-12-26 23:41:01,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:41:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 26170 transitions. [2019-12-26 23:41:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:41:01,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:01,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:01,018 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash 227924408, now seen corresponding path program 1 times [2019-12-26 23:41:01,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:01,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461187574] [2019-12-26 23:41:01,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:01,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461187574] [2019-12-26 23:41:01,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:01,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:41:01,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357004921] [2019-12-26 23:41:01,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:01,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:01,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:01,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:01,066 INFO L87 Difference]: Start difference. First operand 8436 states and 26170 transitions. Second operand 3 states. [2019-12-26 23:41:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:01,147 INFO L93 Difference]: Finished difference Result 13940 states and 42457 transitions. [2019-12-26 23:41:01,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:01,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 23:41:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:01,171 INFO L225 Difference]: With dead ends: 13940 [2019-12-26 23:41:01,171 INFO L226 Difference]: Without dead ends: 13940 [2019-12-26 23:41:01,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13940 states. [2019-12-26 23:41:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13940 to 9810. [2019-12-26 23:41:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9810 states. [2019-12-26 23:41:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9810 states to 9810 states and 30153 transitions. [2019-12-26 23:41:01,343 INFO L78 Accepts]: Start accepts. Automaton has 9810 states and 30153 transitions. Word has length 58 [2019-12-26 23:41:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:01,343 INFO L462 AbstractCegarLoop]: Abstraction has 9810 states and 30153 transitions. [2019-12-26 23:41:01,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 9810 states and 30153 transitions. [2019-12-26 23:41:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:41:01,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:01,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:01,364 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1697581937, now seen corresponding path program 1 times [2019-12-26 23:41:01,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:01,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229419069] [2019-12-26 23:41:01,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:01,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229419069] [2019-12-26 23:41:01,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:01,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:41:01,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848658919] [2019-12-26 23:41:01,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:41:01,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:01,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:41:01,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:41:01,441 INFO L87 Difference]: Start difference. First operand 9810 states and 30153 transitions. Second operand 5 states. [2019-12-26 23:41:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:01,755 INFO L93 Difference]: Finished difference Result 13023 states and 39182 transitions. [2019-12-26 23:41:01,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:41:01,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 23:41:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:01,773 INFO L225 Difference]: With dead ends: 13023 [2019-12-26 23:41:01,773 INFO L226 Difference]: Without dead ends: 13023 [2019-12-26 23:41:01,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:41:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13023 states. [2019-12-26 23:41:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13023 to 10554. [2019-12-26 23:41:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10554 states. [2019-12-26 23:41:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 31876 transitions. [2019-12-26 23:41:01,928 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 31876 transitions. Word has length 58 [2019-12-26 23:41:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:01,928 INFO L462 AbstractCegarLoop]: Abstraction has 10554 states and 31876 transitions. [2019-12-26 23:41:01,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:41:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 31876 transitions. [2019-12-26 23:41:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:41:01,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:01,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:01,941 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash 60629961, now seen corresponding path program 1 times [2019-12-26 23:41:01,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:01,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146461242] [2019-12-26 23:41:01,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:02,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146461242] [2019-12-26 23:41:02,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:02,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:41:02,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940954873] [2019-12-26 23:41:02,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:41:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:41:02,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:41:02,033 INFO L87 Difference]: Start difference. First operand 10554 states and 31876 transitions. Second operand 5 states. [2019-12-26 23:41:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:02,441 INFO L93 Difference]: Finished difference Result 14106 states and 41943 transitions. [2019-12-26 23:41:02,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:41:02,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-26 23:41:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:02,461 INFO L225 Difference]: With dead ends: 14106 [2019-12-26 23:41:02,461 INFO L226 Difference]: Without dead ends: 14106 [2019-12-26 23:41:02,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:41:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14106 states. [2019-12-26 23:41:02,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14106 to 11034. [2019-12-26 23:41:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11034 states. [2019-12-26 23:41:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11034 states to 11034 states and 33302 transitions. [2019-12-26 23:41:02,620 INFO L78 Accepts]: Start accepts. Automaton has 11034 states and 33302 transitions. Word has length 59 [2019-12-26 23:41:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:02,621 INFO L462 AbstractCegarLoop]: Abstraction has 11034 states and 33302 transitions. [2019-12-26 23:41:02,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:41:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11034 states and 33302 transitions. [2019-12-26 23:41:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:41:02,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:02,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:02,633 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2115982021, now seen corresponding path program 2 times [2019-12-26 23:41:02,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:02,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887073979] [2019-12-26 23:41:02,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:02,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887073979] [2019-12-26 23:41:02,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:02,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:41:02,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621966557] [2019-12-26 23:41:02,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:41:02,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:41:02,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:41:02,729 INFO L87 Difference]: Start difference. First operand 11034 states and 33302 transitions. Second operand 4 states. [2019-12-26 23:41:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:02,847 INFO L93 Difference]: Finished difference Result 15781 states and 46934 transitions. [2019-12-26 23:41:02,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:41:02,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-26 23:41:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:02,873 INFO L225 Difference]: With dead ends: 15781 [2019-12-26 23:41:02,873 INFO L226 Difference]: Without dead ends: 15781 [2019-12-26 23:41:02,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:41:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15781 states. [2019-12-26 23:41:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15781 to 10050. [2019-12-26 23:41:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10050 states. [2019-12-26 23:41:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10050 states to 10050 states and 30316 transitions. [2019-12-26 23:41:03,282 INFO L78 Accepts]: Start accepts. Automaton has 10050 states and 30316 transitions. Word has length 59 [2019-12-26 23:41:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:03,282 INFO L462 AbstractCegarLoop]: Abstraction has 10050 states and 30316 transitions. [2019-12-26 23:41:03,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:41:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10050 states and 30316 transitions. [2019-12-26 23:41:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:41:03,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:03,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:03,293 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:03,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1574340111, now seen corresponding path program 1 times [2019-12-26 23:41:03,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:03,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252747377] [2019-12-26 23:41:03,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:03,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252747377] [2019-12-26 23:41:03,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:03,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:41:03,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945829010] [2019-12-26 23:41:03,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:41:03,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:03,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:41:03,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:41:03,415 INFO L87 Difference]: Start difference. First operand 10050 states and 30316 transitions. Second operand 6 states. [2019-12-26 23:41:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:04,097 INFO L93 Difference]: Finished difference Result 12984 states and 38590 transitions. [2019-12-26 23:41:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:41:04,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 23:41:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:04,116 INFO L225 Difference]: With dead ends: 12984 [2019-12-26 23:41:04,116 INFO L226 Difference]: Without dead ends: 12984 [2019-12-26 23:41:04,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:41:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12984 states. [2019-12-26 23:41:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12984 to 10146. [2019-12-26 23:41:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10146 states. [2019-12-26 23:41:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 30618 transitions. [2019-12-26 23:41:04,265 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 30618 transitions. Word has length 59 [2019-12-26 23:41:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:04,265 INFO L462 AbstractCegarLoop]: Abstraction has 10146 states and 30618 transitions. [2019-12-26 23:41:04,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:41:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 30618 transitions. [2019-12-26 23:41:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:41:04,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:04,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:04,277 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1554852441, now seen corresponding path program 2 times [2019-12-26 23:41:04,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:04,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343397257] [2019-12-26 23:41:04,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:04,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343397257] [2019-12-26 23:41:04,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:04,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:41:04,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627168524] [2019-12-26 23:41:04,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:04,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:04,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:04,353 INFO L87 Difference]: Start difference. First operand 10146 states and 30618 transitions. Second operand 3 states. [2019-12-26 23:41:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:04,396 INFO L93 Difference]: Finished difference Result 10145 states and 30616 transitions. [2019-12-26 23:41:04,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:04,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 23:41:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:04,413 INFO L225 Difference]: With dead ends: 10145 [2019-12-26 23:41:04,413 INFO L226 Difference]: Without dead ends: 10145 [2019-12-26 23:41:04,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10145 states. [2019-12-26 23:41:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10145 to 8086. [2019-12-26 23:41:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8086 states. [2019-12-26 23:41:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 24816 transitions. [2019-12-26 23:41:04,541 INFO L78 Accepts]: Start accepts. Automaton has 8086 states and 24816 transitions. Word has length 59 [2019-12-26 23:41:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:04,541 INFO L462 AbstractCegarLoop]: Abstraction has 8086 states and 24816 transitions. [2019-12-26 23:41:04,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 8086 states and 24816 transitions. [2019-12-26 23:41:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:41:04,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:04,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:04,551 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:04,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:04,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2028677292, now seen corresponding path program 1 times [2019-12-26 23:41:04,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:04,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238305122] [2019-12-26 23:41:04,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:04,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-26 23:41:04,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238305122] [2019-12-26 23:41:04,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:04,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:41:04,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620930195] [2019-12-26 23:41:04,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:04,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:04,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:04,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:04,628 INFO L87 Difference]: Start difference. First operand 8086 states and 24816 transitions. Second operand 3 states. [2019-12-26 23:41:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:04,660 INFO L93 Difference]: Finished difference Result 7978 states and 24240 transitions. [2019-12-26 23:41:04,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:04,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-26 23:41:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:04,673 INFO L225 Difference]: With dead ends: 7978 [2019-12-26 23:41:04,673 INFO L226 Difference]: Without dead ends: 7978 [2019-12-26 23:41:04,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7978 states. [2019-12-26 23:41:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7978 to 7702. [2019-12-26 23:41:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7702 states. [2019-12-26 23:41:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7702 states to 7702 states and 23452 transitions. [2019-12-26 23:41:04,780 INFO L78 Accepts]: Start accepts. Automaton has 7702 states and 23452 transitions. Word has length 60 [2019-12-26 23:41:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:04,780 INFO L462 AbstractCegarLoop]: Abstraction has 7702 states and 23452 transitions. [2019-12-26 23:41:04,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7702 states and 23452 transitions. [2019-12-26 23:41:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-26 23:41:04,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:04,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:04,789 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1407709555, now seen corresponding path program 1 times [2019-12-26 23:41:04,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:04,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935882512] [2019-12-26 23:41:04,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:04,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935882512] [2019-12-26 23:41:04,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:04,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:41:04,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041394002] [2019-12-26 23:41:04,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:04,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:04,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:04,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:04,857 INFO L87 Difference]: Start difference. First operand 7702 states and 23452 transitions. Second operand 3 states. [2019-12-26 23:41:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:04,892 INFO L93 Difference]: Finished difference Result 7701 states and 23450 transitions. [2019-12-26 23:41:04,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:04,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-26 23:41:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:04,906 INFO L225 Difference]: With dead ends: 7701 [2019-12-26 23:41:04,906 INFO L226 Difference]: Without dead ends: 7701 [2019-12-26 23:41:04,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7701 states. [2019-12-26 23:41:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7701 to 7701. [2019-12-26 23:41:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-12-26 23:41:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 23450 transitions. [2019-12-26 23:41:05,054 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 23450 transitions. Word has length 61 [2019-12-26 23:41:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:05,054 INFO L462 AbstractCegarLoop]: Abstraction has 7701 states and 23450 transitions. [2019-12-26 23:41:05,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 23450 transitions. [2019-12-26 23:41:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 23:41:05,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:05,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:05,066 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash 687699090, now seen corresponding path program 1 times [2019-12-26 23:41:05,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:05,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715249917] [2019-12-26 23:41:05,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:05,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715249917] [2019-12-26 23:41:05,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:05,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:41:05,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327049528] [2019-12-26 23:41:05,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:05,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:05,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:05,152 INFO L87 Difference]: Start difference. First operand 7701 states and 23450 transitions. Second operand 3 states. [2019-12-26 23:41:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:05,183 INFO L93 Difference]: Finished difference Result 7491 states and 22621 transitions. [2019-12-26 23:41:05,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:05,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-26 23:41:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:05,194 INFO L225 Difference]: With dead ends: 7491 [2019-12-26 23:41:05,195 INFO L226 Difference]: Without dead ends: 7491 [2019-12-26 23:41:05,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7491 states. [2019-12-26 23:41:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7491 to 6963. [2019-12-26 23:41:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6963 states. [2019-12-26 23:41:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6963 states to 6963 states and 21113 transitions. [2019-12-26 23:41:05,288 INFO L78 Accepts]: Start accepts. Automaton has 6963 states and 21113 transitions. Word has length 62 [2019-12-26 23:41:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:05,288 INFO L462 AbstractCegarLoop]: Abstraction has 6963 states and 21113 transitions. [2019-12-26 23:41:05,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:41:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6963 states and 21113 transitions. [2019-12-26 23:41:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 23:41:05,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:05,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:05,295 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash 249256444, now seen corresponding path program 1 times [2019-12-26 23:41:05,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:05,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059195095] [2019-12-26 23:41:05,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:05,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059195095] [2019-12-26 23:41:05,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:05,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:41:05,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147191930] [2019-12-26 23:41:05,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:41:05,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:05,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:41:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:41:05,410 INFO L87 Difference]: Start difference. First operand 6963 states and 21113 transitions. Second operand 5 states. [2019-12-26 23:41:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:05,502 INFO L93 Difference]: Finished difference Result 12408 states and 37474 transitions. [2019-12-26 23:41:05,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:41:05,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-26 23:41:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:05,515 INFO L225 Difference]: With dead ends: 12408 [2019-12-26 23:41:05,516 INFO L226 Difference]: Without dead ends: 5990 [2019-12-26 23:41:05,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:41:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2019-12-26 23:41:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 5990. [2019-12-26 23:41:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5990 states. [2019-12-26 23:41:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 17967 transitions. [2019-12-26 23:41:05,743 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 17967 transitions. Word has length 63 [2019-12-26 23:41:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:05,743 INFO L462 AbstractCegarLoop]: Abstraction has 5990 states and 17967 transitions. [2019-12-26 23:41:05,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:41:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 17967 transitions. [2019-12-26 23:41:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 23:41:05,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:05,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:05,753 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1218456598, now seen corresponding path program 2 times [2019-12-26 23:41:05,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:05,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677758648] [2019-12-26 23:41:05,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:05,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677758648] [2019-12-26 23:41:05,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:05,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:41:05,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561306721] [2019-12-26 23:41:05,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:41:05,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:05,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:41:05,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:41:05,836 INFO L87 Difference]: Start difference. First operand 5990 states and 17967 transitions. Second operand 4 states. [2019-12-26 23:41:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:05,882 INFO L93 Difference]: Finished difference Result 7454 states and 21950 transitions. [2019-12-26 23:41:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:41:05,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-26 23:41:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:05,885 INFO L225 Difference]: With dead ends: 7454 [2019-12-26 23:41:05,885 INFO L226 Difference]: Without dead ends: 1934 [2019-12-26 23:41:05,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:41:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-12-26 23:41:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2019-12-26 23:41:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-12-26 23:41:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 5237 transitions. [2019-12-26 23:41:05,919 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 5237 transitions. Word has length 63 [2019-12-26 23:41:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:41:05,920 INFO L462 AbstractCegarLoop]: Abstraction has 1934 states and 5237 transitions. [2019-12-26 23:41:05,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:41:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 5237 transitions. [2019-12-26 23:41:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 23:41:05,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:05,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:41:05,922 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:05,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1116199452, now seen corresponding path program 3 times [2019-12-26 23:41:05,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:05,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444543578] [2019-12-26 23:41:05,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:41:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:41:06,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:41:06,079 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:41:06,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse1 (store |v_#valid_75| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_140| 1))) (and (= (select (select |v_#memory_int_277| |v_~#x~0.base_140|) |v_~#x~0.offset_140|) 0) (= 0 v_~x$r_buff0_thd1~0_68) (= v_~x$r_buff1_thd3~0_58 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8 0) (= v_~x$r_buff1_thd1~0_56 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_7 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_58) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= 0 v_~x$read_delayed~0_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= 0 v_~weak$$choice2~0_98) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2000~0.base_24| 1)) (= 0 v_~x$r_buff0_thd0~0_92) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= 0 v_~x$r_buff0_thd3~0_78) (= 0 v_~x$w_buff0~0_96) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_77) (= v_~main$tmp_guard0~0_54 0) (= 0 v_~x$r_buff0_thd2~0_264) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8 0) (= 0 v_~weak$$choice1~0_32) (= v_~__unbuffered_p1_EAX$w_buff1~0_8 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= v_~x$mem_tmp~0_39 0) (= 0 (select .cse1 |v_~#x~0.base_140|)) (< 0 |v_#StackHeapBarrier_22|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2000~0.base_24|) (= 0 v_~x$w_buff1~0_81) (= 0 v_~__unbuffered_p1_EAX~0_61) (= v_~x$flush_delayed~0_68 0) (= 0 v_~x$r_buff1_thd2~0_177) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2000~0.base_24|) 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_8 0) (= 0 v_~weak$$choice0~0_17) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8 0) (= 0 v_~x$w_buff0_used~0_579) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_35 0) (= v_~y~0_85 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t2000~0.offset_18|) (= 0 |v_~#x~0.offset_140|) (= v_~__unbuffered_p1_EAX$read_delayed~0_41 0) (= v_~main$tmp_guard1~0_32 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_7 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_35 0) (= 0 v_~x$w_buff1_used~0_346) (= |v_#length_36| (store (store |v_#length_37| |v_~#x~0.base_140| 4) |v_ULTIMATE.start_main_~#t2000~0.base_24| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_8) (= (store |v_#memory_int_277| |v_ULTIMATE.start_main_~#t2000~0.base_24| (store (select |v_#memory_int_277| |v_ULTIMATE.start_main_~#t2000~0.base_24|) |v_ULTIMATE.start_main_~#t2000~0.offset_18| 0)) |v_#memory_int_276|) (< |v_#StackHeapBarrier_22| |v_~#x~0.base_140|) (= v_~x$r_buff1_thd0~0_55 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_277|, #length=|v_#length_37|} OutVars{ULTIMATE.start_main_#t~nondet53=|v_ULTIMATE.start_main_#t~nondet53_26|, ~x$w_buff0~0=v_~x$w_buff0~0_96, ULTIMATE.start_main_#t~nondet51=|v_ULTIMATE.start_main_#t~nondet51_10|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8, ~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_56, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_59|, ~weak$$choice1~0=v_~weak$$choice1~0_32, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_35, #length=|v_#length_36|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_92, ULTIMATE.start_main_#t~mem54=|v_ULTIMATE.start_main_#t~mem54_26|, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8, ~#x~0.offset=|v_~#x~0.offset_140|, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_7, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_169|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_346, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_177, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_46|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_8, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ULTIMATE.start_main_#t~nondet52=|v_ULTIMATE.start_main_#t~nondet52_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_41, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_43|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_58, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_39, ULTIMATE.start_main_~#t2002~0.offset=|v_ULTIMATE.start_main_~#t2002~0.offset_17|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_8, ULTIMATE.start_main_~#t2000~0.base=|v_ULTIMATE.start_main_~#t2000~0.base_24|, ~y~0=v_~y~0_85, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_149|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_35, ULTIMATE.start_main_~#t2001~0.offset=|v_ULTIMATE.start_main_~#t2001~0.offset_20|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ULTIMATE.start_main_~#t2001~0.base=|v_ULTIMATE.start_main_~#t2001~0.base_25|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_55, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_264, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_31|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_7, ULTIMATE.start_main_~#t2002~0.base=|v_ULTIMATE.start_main_~#t2002~0.base_21|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_276|, ~#x~0.base=|v_~#x~0.base_140|, ~weak$$choice2~0=v_~weak$$choice2~0_98, ULTIMATE.start_main_~#t2000~0.offset=|v_ULTIMATE.start_main_~#t2000~0.offset_18|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet53, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet51, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite64, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem54, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~__unbuffered_p1_EAX$w_buff1_used~0, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet52, ~__unbuffered_p1_EAX$read_delayed~0, ULTIMATE.start_main_#t~mem62, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2002~0.offset, ~__unbuffered_p1_EAX$mem_tmp~0, ULTIMATE.start_main_~#t2000~0.base, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite57, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2001~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2001~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX$w_buff0_used~0, ULTIMATE.start_main_~#t2002~0.base, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t2000~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:41:06,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t2001~0.offset_10| 0) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2001~0.base_11|) 0) (= (store |v_#memory_int_139| |v_ULTIMATE.start_main_~#t2001~0.base_11| (store (select |v_#memory_int_139| |v_ULTIMATE.start_main_~#t2001~0.base_11|) |v_ULTIMATE.start_main_~#t2001~0.offset_10| 1)) |v_#memory_int_138|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2001~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2001~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2001~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2001~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_139|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet51=|v_ULTIMATE.start_main_#t~nondet51_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_138|, ULTIMATE.start_main_~#t2001~0.offset=|v_ULTIMATE.start_main_~#t2001~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2001~0.base=|v_ULTIMATE.start_main_~#t2001~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet51, #valid, #memory_int, ULTIMATE.start_main_~#t2001~0.offset, #length, ULTIMATE.start_main_~#t2001~0.base] because there is no mapped edge [2019-12-26 23:41:06,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L827-1-->L829: Formula: (and (= |v_ULTIMATE.start_main_~#t2002~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2002~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2002~0.base_13|) (= (store |v_#memory_int_203| |v_ULTIMATE.start_main_~#t2002~0.base_13| (store (select |v_#memory_int_203| |v_ULTIMATE.start_main_~#t2002~0.base_13|) |v_ULTIMATE.start_main_~#t2002~0.offset_11| 2)) |v_#memory_int_202|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t2002~0.base_13|) 0) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t2002~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2002~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_203|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t2002~0.base=|v_ULTIMATE.start_main_~#t2002~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet52=|v_ULTIMATE.start_main_#t~nondet52_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_202|, ULTIMATE.start_main_~#t2002~0.offset=|v_ULTIMATE.start_main_~#t2002~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2002~0.base, ULTIMATE.start_main_#t~nondet52, #valid, #memory_int, ULTIMATE.start_main_~#t2002~0.offset, #length] because there is no mapped edge [2019-12-26 23:41:06,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L769-->L770: Formula: (let ((.cse2 (= (mod ~weak$$choice2~0_In1368356189 256) 0)) (.cse1 (= ~x$w_buff0~0_In1368356189 ~x$w_buff0~0_Out1368356189))) (or (let ((.cse0 (not (= 0 (mod ~x$r_buff0_thd2~0_In1368356189 256))))) (and (or .cse0 (not (= (mod ~x$w_buff1_used~0_In1368356189 256) 0))) (or (not (= 0 (mod ~x$r_buff1_thd2~0_In1368356189 256))) .cse0) .cse1 (not (= 0 (mod ~x$w_buff0_used~0_In1368356189 256))) .cse2)) (and (not .cse2) .cse1))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1368356189, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1368356189, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1368356189, ~weak$$choice2~0=~weak$$choice2~0_In1368356189, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1368356189, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1368356189} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1368356189, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1368356189, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1368356189, P1Thread1of1ForFork0_#t~ite16=|P1Thread1of1ForFork0_#t~ite16_Out1368356189|, ~weak$$choice2~0=~weak$$choice2~0_In1368356189, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1368356189, P1Thread1of1ForFork0_#t~ite18=|P1Thread1of1ForFork0_#t~ite18_Out1368356189|, P1Thread1of1ForFork0_#t~ite17=|P1Thread1of1ForFork0_#t~ite17_Out1368356189|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1368356189} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite18, P1Thread1of1ForFork0_#t~ite17] because there is no mapped edge [2019-12-26 23:41:06,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L770-->L771: Formula: (and (= v_~x$w_buff1~0_31 v_~x$w_buff1~0_30) (not (= 0 (mod v_~weak$$choice2~0_25 256)))) InVars {~x$w_buff1~0=v_~x$w_buff1~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork0_#t~ite19=|v_P1Thread1of1ForFork0_#t~ite19_12|, P1Thread1of1ForFork0_#t~ite20=|v_P1Thread1of1ForFork0_#t~ite20_11|, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_9|, ~x$w_buff1~0=v_~x$w_buff1~0_30, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite19, P1Thread1of1ForFork0_#t~ite20, P1Thread1of1ForFork0_#t~ite21, ~x$w_buff1~0] because there is no mapped edge [2019-12-26 23:41:06,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L771-->L771-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-928311897 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite23_Out-928311897| |P1Thread1of1ForFork0_#t~ite24_Out-928311897|) (= |P1Thread1of1ForFork0_#t~ite23_Out-928311897| ~x$w_buff0_used~0_In-928311897) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-928311897 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-928311897 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-928311897 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-928311897 256)))))) (and (= ~x$w_buff0_used~0_In-928311897 |P1Thread1of1ForFork0_#t~ite24_Out-928311897|) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite23_In-928311897| |P1Thread1of1ForFork0_#t~ite23_Out-928311897|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-928311897, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-928311897, P1Thread1of1ForFork0_#t~ite23=|P1Thread1of1ForFork0_#t~ite23_In-928311897|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-928311897, ~weak$$choice2~0=~weak$$choice2~0_In-928311897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-928311897} OutVars{P1Thread1of1ForFork0_#t~ite24=|P1Thread1of1ForFork0_#t~ite24_Out-928311897|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-928311897, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-928311897, P1Thread1of1ForFork0_#t~ite23=|P1Thread1of1ForFork0_#t~ite23_Out-928311897|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-928311897, ~weak$$choice2~0=~weak$$choice2~0_In-928311897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-928311897} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite24, P1Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-26 23:41:06,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L773-->L774: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1628468268 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_Out-1628468268 ~x$r_buff0_thd2~0_In-1628468268))) (or (and .cse0 .cse1 (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1628468268 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1628468268 256)) (and .cse2 (= 0 (mod ~x$w_buff1_used~0_In-1628468268 256))) (and .cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1628468268 256)))))) (and (not .cse1) .cse0))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1628468268, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1628468268, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1628468268, ~weak$$choice2~0=~weak$$choice2~0_In-1628468268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1628468268} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1628468268|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1628468268, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1628468268, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1628468268, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1628468268|, ~weak$$choice2~0=~weak$$choice2~0_In-1628468268, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1628468268|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1628468268} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:41:06,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L774-->L778: Formula: (and (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_12 |v_~#x~0.base_41|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_12 |v_~#x~0.offset_41|) (= (select (select |v_#memory_int_75| |v_~#x~0.base_41|) |v_~#x~0.offset_41|) v_~__unbuffered_p1_EAX~0_17) (= v_~x$r_buff1_thd2~0_56 v_~x$r_buff1_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~__unbuffered_p1_EAX$read_delayed~0_13 1)) InVars {~#x~0.offset=|v_~#x~0.offset_41|, ~#x~0.base=|v_~#x~0.base_41|, #memory_int=|v_#memory_int_75|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~#x~0.offset=|v_~#x~0.offset_41|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_13, P1Thread1of1ForFork0_#t~mem34=|v_P1Thread1of1ForFork0_#t~mem34_8|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_12, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, P1Thread1of1ForFork0_#t~ite33=|v_P1Thread1of1ForFork0_#t~ite33_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_12|, P1Thread1of1ForFork0_#t~ite32=|v_P1Thread1of1ForFork0_#t~ite32_15|, ~#x~0.base=|v_~#x~0.base_41|, #memory_int=|v_#memory_int_75|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_12, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork0_#t~ite32, P1Thread1of1ForFork0_#t~mem34, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite33] because there is no mapped edge [2019-12-26 23:41:06,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L778-->L785: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (store |v_#memory_int_46| |v_~#x~0.base_27| (store (select |v_#memory_int_46| |v_~#x~0.base_27|) |v_~#x~0.offset_27| v_~x$mem_tmp~0_4)) |v_#memory_int_45|) (not (= 0 (mod v_~x$flush_delayed~0_7 256))) (= v_~y~0_10 1)) InVars {~#x~0.offset=|v_~#x~0.offset_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_46|, ~#x~0.base=|v_~#x~0.base_27|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_27|, P1Thread1of1ForFork0_#t~mem35=|v_P1Thread1of1ForFork0_#t~mem35_5|, #memory_int=|v_#memory_int_45|, ~#x~0.base=|v_~#x~0.base_27|, P1Thread1of1ForFork0_#t~ite36=|v_P1Thread1of1ForFork0_#t~ite36_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_10} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork0_#t~mem35, #memory_int, P1Thread1of1ForFork0_#t~ite36, ~y~0] because there is no mapped edge [2019-12-26 23:41:06,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L785-2-->L785-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite39_Out-822068297| |P1Thread1of1ForFork0_#t~ite38_Out-822068297|)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-822068297 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-822068297 256)))) (or (and .cse0 (= ~x$w_buff1~0_In-822068297 |P1Thread1of1ForFork0_#t~ite38_Out-822068297|) (= |P1Thread1of1ForFork0_#t~mem37_In-822068297| |P1Thread1of1ForFork0_#t~mem37_Out-822068297|) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |P1Thread1of1ForFork0_#t~mem37_Out-822068297| |P1Thread1of1ForFork0_#t~ite38_Out-822068297|) (= (select (select |#memory_int_In-822068297| |~#x~0.base_In-822068297|) |~#x~0.offset_In-822068297|) |P1Thread1of1ForFork0_#t~mem37_Out-822068297|)))) InVars {P1Thread1of1ForFork0_#t~mem37=|P1Thread1of1ForFork0_#t~mem37_In-822068297|, ~#x~0.offset=|~#x~0.offset_In-822068297|, ~x$w_buff1~0=~x$w_buff1~0_In-822068297, ~#x~0.base=|~#x~0.base_In-822068297|, #memory_int=|#memory_int_In-822068297|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-822068297, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-822068297} OutVars{P1Thread1of1ForFork0_#t~mem37=|P1Thread1of1ForFork0_#t~mem37_Out-822068297|, ~#x~0.offset=|~#x~0.offset_In-822068297|, ~x$w_buff1~0=~x$w_buff1~0_In-822068297, ~#x~0.base=|~#x~0.base_In-822068297|, #memory_int=|#memory_int_In-822068297|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-822068297, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-822068297, P1Thread1of1ForFork0_#t~ite39=|P1Thread1of1ForFork0_#t~ite39_Out-822068297|, P1Thread1of1ForFork0_#t~ite38=|P1Thread1of1ForFork0_#t~ite38_Out-822068297|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem37, P1Thread1of1ForFork0_#t~ite39, P1Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 23:41:06,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1084524133 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1084524133 256)))) (or (and (= |P2Thread1of1ForFork1_#t~mem44_In1084524133| |P2Thread1of1ForFork1_#t~mem44_Out1084524133|) (not .cse0) (= ~x$w_buff1~0_In1084524133 |P2Thread1of1ForFork1_#t~ite45_Out1084524133|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~mem44_Out1084524133| |P2Thread1of1ForFork1_#t~ite45_Out1084524133|) (= (select (select |#memory_int_In1084524133| |~#x~0.base_In1084524133|) |~#x~0.offset_In1084524133|) |P2Thread1of1ForFork1_#t~mem44_Out1084524133|)))) InVars {~#x~0.offset=|~#x~0.offset_In1084524133|, ~x$w_buff1~0=~x$w_buff1~0_In1084524133, ~#x~0.base=|~#x~0.base_In1084524133|, #memory_int=|#memory_int_In1084524133|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1084524133, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1084524133, P2Thread1of1ForFork1_#t~mem44=|P2Thread1of1ForFork1_#t~mem44_In1084524133|} OutVars{~#x~0.offset=|~#x~0.offset_In1084524133|, P2Thread1of1ForFork1_#t~ite45=|P2Thread1of1ForFork1_#t~ite45_Out1084524133|, ~x$w_buff1~0=~x$w_buff1~0_In1084524133, ~#x~0.base=|~#x~0.base_In1084524133|, #memory_int=|#memory_int_In1084524133|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1084524133, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1084524133, P2Thread1of1ForFork1_#t~mem44=|P2Thread1of1ForFork1_#t~mem44_Out1084524133|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite45, P2Thread1of1ForFork1_#t~mem44] because there is no mapped edge [2019-12-26 23:41:06,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2050853717 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In2050853717 256) 0))) (or (and (= ~x$w_buff0_used~0_In2050853717 |P1Thread1of1ForFork0_#t~ite40_Out2050853717|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite40_Out2050853717|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2050853717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050853717} OutVars{P1Thread1of1ForFork0_#t~ite40=|P1Thread1of1ForFork0_#t~ite40_Out2050853717|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2050853717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2050853717} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 23:41:06,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-115586796 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-115586796 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-115586796 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-115586796 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite41_Out-115586796| ~x$w_buff1_used~0_In-115586796)) (and (= 0 |P1Thread1of1ForFork0_#t~ite41_Out-115586796|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-115586796, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-115586796, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-115586796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-115586796} OutVars{P1Thread1of1ForFork0_#t~ite41=|P1Thread1of1ForFork0_#t~ite41_Out-115586796|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-115586796, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-115586796, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-115586796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-115586796} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 23:41:06,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L788-->L789: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-295284655 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-295284655 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-295284655 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-295284655 ~x$r_buff0_thd2~0_In-295284655) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-295284655, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-295284655} OutVars{P1Thread1of1ForFork0_#t~ite42=|P1Thread1of1ForFork0_#t~ite42_Out-295284655|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-295284655, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-295284655} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite42, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:41:06,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1767320886 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1767320886 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1767320886 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1767320886 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite43_Out1767320886|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In1767320886 |P1Thread1of1ForFork0_#t~ite43_Out1767320886|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1767320886, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1767320886, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1767320886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1767320886} OutVars{P1Thread1of1ForFork0_#t~ite43=|P1Thread1of1ForFork0_#t~ite43_Out1767320886|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1767320886, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1767320886, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1767320886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1767320886} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 23:41:06,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork0_#t~ite43_32|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P1Thread1of1ForFork0_#t~ite43=|v_P1Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P1Thread1of1ForFork0_#t~ite43=|v_P1Thread1of1ForFork0_#t~ite43_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite43, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 23:41:06,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L750-2-->L750-5: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In2127092100 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In2127092100 256))) (.cse1 (= |P0Thread1of1ForFork2_#t~ite4_Out2127092100| |P0Thread1of1ForFork2_#t~ite5_Out2127092100|))) (or (and (= |P0Thread1of1ForFork2_#t~ite4_Out2127092100| ~x$w_buff1~0_In2127092100) (not .cse0) (= |P0Thread1of1ForFork2_#t~mem3_In2127092100| |P0Thread1of1ForFork2_#t~mem3_Out2127092100|) .cse1 (not .cse2)) (and (= |P0Thread1of1ForFork2_#t~ite4_Out2127092100| |P0Thread1of1ForFork2_#t~mem3_Out2127092100|) (= (select (select |#memory_int_In2127092100| |~#x~0.base_In2127092100|) |~#x~0.offset_In2127092100|) |P0Thread1of1ForFork2_#t~mem3_Out2127092100|) (or .cse2 .cse0) .cse1))) InVars {P0Thread1of1ForFork2_#t~mem3=|P0Thread1of1ForFork2_#t~mem3_In2127092100|, ~#x~0.offset=|~#x~0.offset_In2127092100|, ~x$w_buff1~0=~x$w_buff1~0_In2127092100, ~#x~0.base=|~#x~0.base_In2127092100|, #memory_int=|#memory_int_In2127092100|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127092100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2127092100} OutVars{P0Thread1of1ForFork2_#t~ite4=|P0Thread1of1ForFork2_#t~ite4_Out2127092100|, P0Thread1of1ForFork2_#t~mem3=|P0Thread1of1ForFork2_#t~mem3_Out2127092100|, ~#x~0.offset=|~#x~0.offset_In2127092100|, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out2127092100|, ~x$w_buff1~0=~x$w_buff1~0_In2127092100, ~#x~0.base=|~#x~0.base_In2127092100|, #memory_int=|#memory_int_In2127092100|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127092100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2127092100} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite4, P0Thread1of1ForFork2_#t~mem3, P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 23:41:06,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1216285347 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1216285347 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite6_Out1216285347| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out1216285347| ~x$w_buff0_used~0_In1216285347)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1216285347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1216285347} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1216285347, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1216285347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1216285347} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 23:41:06,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1221286460 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1221286460 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1221286460 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1221286460 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite7_Out-1221286460| 0)) (and (= |P0Thread1of1ForFork2_#t~ite7_Out-1221286460| ~x$w_buff1_used~0_In-1221286460) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1221286460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1221286460, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1221286460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1221286460} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1221286460, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1221286460|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1221286460, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1221286460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1221286460} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 23:41:06,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In947035512 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In947035512 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd1~0_Out947035512 0)) (and (= ~x$r_buff0_thd1~0_Out947035512 ~x$r_buff0_thd1~0_In947035512) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In947035512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In947035512} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out947035512, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out947035512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In947035512} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 23:41:06,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [892] [892] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2108251456 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2108251456 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In2108251456 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In2108251456 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite9_Out2108251456|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd1~0_In2108251456 |P0Thread1of1ForFork2_#t~ite9_Out2108251456|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2108251456, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2108251456, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2108251456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2108251456} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2108251456, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2108251456, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2108251456, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out2108251456|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2108251456} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:41:06,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_50 (+ v_~__unbuffered_cnt~0_51 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite9_24| v_~x$r_buff1_thd1~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_24|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_34, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 23:41:06,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L802-4-->L803: Formula: (= (store |v_#memory_int_71| |v_~#x~0.base_39| (store (select |v_#memory_int_71| |v_~#x~0.base_39|) |v_~#x~0.offset_39| |v_P2Thread1of1ForFork1_#t~ite45_10|)) |v_#memory_int_70|) InVars {~#x~0.offset=|v_~#x~0.offset_39|, P2Thread1of1ForFork1_#t~ite45=|v_P2Thread1of1ForFork1_#t~ite45_10|, #memory_int=|v_#memory_int_71|, ~#x~0.base=|v_~#x~0.base_39|} OutVars{P2Thread1of1ForFork1_#t~ite46=|v_P2Thread1of1ForFork1_#t~ite46_13|, ~#x~0.offset=|v_~#x~0.offset_39|, P2Thread1of1ForFork1_#t~ite45=|v_P2Thread1of1ForFork1_#t~ite45_9|, #memory_int=|v_#memory_int_70|, ~#x~0.base=|v_~#x~0.base_39|, P2Thread1of1ForFork1_#t~mem44=|v_P2Thread1of1ForFork1_#t~mem44_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite46, P2Thread1of1ForFork1_#t~ite45, #memory_int, P2Thread1of1ForFork1_#t~mem44] because there is no mapped edge [2019-12-26 23:41:06,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-818925099 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-818925099 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite47_Out-818925099| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite47_Out-818925099| ~x$w_buff0_used~0_In-818925099)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-818925099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-818925099} OutVars{P2Thread1of1ForFork1_#t~ite47=|P2Thread1of1ForFork1_#t~ite47_Out-818925099|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-818925099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-818925099} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite47] because there is no mapped edge [2019-12-26 23:41:06,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1236109269 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In1236109269 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1236109269 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1236109269 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1236109269 |P2Thread1of1ForFork1_#t~ite48_Out1236109269|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite48_Out1236109269| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1236109269, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1236109269, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1236109269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1236109269} OutVars{P2Thread1of1ForFork1_#t~ite48=|P2Thread1of1ForFork1_#t~ite48_Out1236109269|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1236109269, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1236109269, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1236109269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1236109269} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-26 23:41:06,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L805-->L806: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1179010153 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1179010153 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd3~0_Out-1179010153 0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_Out-1179010153 ~x$r_buff0_thd3~0_In-1179010153) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1179010153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1179010153} OutVars{P2Thread1of1ForFork1_#t~ite49=|P2Thread1of1ForFork1_#t~ite49_Out-1179010153|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_Out-1179010153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1179010153} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite49, ~x$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 23:41:06,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1092310223 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1092310223 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1092310223 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1092310223 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In1092310223 |P2Thread1of1ForFork1_#t~ite50_Out1092310223|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite50_Out1092310223|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1092310223, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1092310223, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1092310223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1092310223} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1092310223, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1092310223, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1092310223, P2Thread1of1ForFork1_#t~ite50=|P2Thread1of1ForFork1_#t~ite50_Out1092310223|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1092310223} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite50] because there is no mapped edge [2019-12-26 23:41:06,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L806-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_49 |v_P2Thread1of1ForFork1_#t~ite50_42|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork1_#t~ite50=|v_P2Thread1of1ForFork1_#t~ite50_42|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#t~ite50=|v_P2Thread1of1ForFork1_#t~ite50_41|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite50, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 23:41:06,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L833-->L835-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_22 256)) (= 0 (mod v_~x$w_buff0_used~0_133 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:41:06,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1463934898 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1463934898 256) 0))) (or (and (= |ULTIMATE.start_main_#t~mem54_Out1463934898| |ULTIMATE.start_main_#t~ite55_Out1463934898|) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~mem54_Out1463934898| (select (select |#memory_int_In1463934898| |~#x~0.base_In1463934898|) |~#x~0.offset_In1463934898|))) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~mem54_In1463934898| |ULTIMATE.start_main_#t~mem54_Out1463934898|) (= |ULTIMATE.start_main_#t~ite55_Out1463934898| ~x$w_buff1~0_In1463934898)))) InVars {ULTIMATE.start_main_#t~mem54=|ULTIMATE.start_main_#t~mem54_In1463934898|, ~#x~0.offset=|~#x~0.offset_In1463934898|, ~x$w_buff1~0=~x$w_buff1~0_In1463934898, ~#x~0.base=|~#x~0.base_In1463934898|, #memory_int=|#memory_int_In1463934898|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1463934898, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1463934898} OutVars{ULTIMATE.start_main_#t~mem54=|ULTIMATE.start_main_#t~mem54_Out1463934898|, ~#x~0.offset=|~#x~0.offset_In1463934898|, ~x$w_buff1~0=~x$w_buff1~0_In1463934898, ~#x~0.base=|~#x~0.base_In1463934898|, #memory_int=|#memory_int_In1463934898|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1463934898, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1463934898, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out1463934898|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem54, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2019-12-26 23:41:06,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L835-4-->L836: Formula: (= (store |v_#memory_int_79| |v_~#x~0.base_42| (store (select |v_#memory_int_79| |v_~#x~0.base_42|) |v_~#x~0.offset_42| |v_ULTIMATE.start_main_#t~ite55_8|)) |v_#memory_int_78|) InVars {~#x~0.offset=|v_~#x~0.offset_42|, #memory_int=|v_#memory_int_79|, ~#x~0.base=|v_~#x~0.base_42|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_8|} OutVars{ULTIMATE.start_main_#t~mem54=|v_ULTIMATE.start_main_#t~mem54_5|, ~#x~0.offset=|v_~#x~0.offset_42|, #memory_int=|v_#memory_int_78|, ~#x~0.base=|v_~#x~0.base_42|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_8|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem54, #memory_int, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2019-12-26 23:41:06,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1344914148 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1344914148 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out-1344914148| ~x$w_buff0_used~0_In-1344914148) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1344914148| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1344914148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1344914148} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1344914148, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1344914148|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1344914148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-26 23:41:06,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-542563213 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-542563213 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-542563213 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-542563213 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite58_Out-542563213|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-542563213 |ULTIMATE.start_main_#t~ite58_Out-542563213|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-542563213, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-542563213, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-542563213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-542563213} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-542563213, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-542563213|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-542563213, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-542563213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-542563213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-26 23:41:06,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L838-->L839: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1967626178 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1967626178 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd0~0_Out-1967626178 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_Out-1967626178 ~x$r_buff0_thd0~0_In-1967626178)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1967626178, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1967626178} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1967626178, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1967626178|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1967626178} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 23:41:06,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-->L843: Formula: (let ((.cse0 (= ~weak$$choice1~0_Out-362166101 |ULTIMATE.start_main_#t~nondet61_In-362166101|)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-362166101 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-362166101 256) 0)) (.cse4 (= (mod ~x$r_buff1_thd0~0_In-362166101 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-362166101 256) 0))) (or (and .cse0 (or (and (not .cse1) (not .cse2)) (and (not .cse3) (not .cse4))) (= 0 ~x$r_buff1_thd0~0_Out-362166101)) (and .cse0 (or .cse1 .cse2) (= ~x$r_buff1_thd0~0_Out-362166101 ~x$r_buff1_thd0~0_In-362166101) (or .cse4 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-362166101, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-362166101, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-362166101, ULTIMATE.start_main_#t~nondet61=|ULTIMATE.start_main_#t~nondet61_In-362166101|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-362166101} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-362166101, ~weak$$choice1~0=~weak$$choice1~0_Out-362166101, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-362166101|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-362166101, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-362166101, ULTIMATE.start_main_#t~nondet61=|ULTIMATE.start_main_#t~nondet61_Out-362166101|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-362166101} AuxVars[] AssignedVars[~weak$$choice1~0, ULTIMATE.start_main_#t~ite60, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-26 23:41:06,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L843-->L843-3: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice1~0_In1011215136 256))) (.cse1 (not (= 0 (mod ~__unbuffered_p1_EAX$read_delayed~0_In1011215136 256))))) (or (and (= |ULTIMATE.start_main_#t~mem62_Out1011215136| |ULTIMATE.start_main_#t~ite63_Out1011215136|) (not .cse0) .cse1 (= (select (select |#memory_int_In1011215136| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In1011215136) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1011215136) |ULTIMATE.start_main_#t~mem62_Out1011215136|)) (and .cse0 (= |ULTIMATE.start_main_#t~mem62_In1011215136| |ULTIMATE.start_main_#t~mem62_Out1011215136|) .cse1 (= |ULTIMATE.start_main_#t~ite63_Out1011215136| ~__unbuffered_p1_EAX~0_In1011215136)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1011215136, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In1011215136, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In1011215136, ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_In1011215136|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In1011215136, #memory_int=|#memory_int_In1011215136|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1011215136} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1011215136|, ~weak$$choice1~0=~weak$$choice1~0_In1011215136, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In1011215136, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In1011215136, ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_Out1011215136|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In1011215136, #memory_int=|#memory_int_In1011215136|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In1011215136} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~mem62] because there is no mapped edge [2019-12-26 23:41:06,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L843-3-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (let ((.cse0 (= 2 v_~__unbuffered_p0_EAX~0_31)) (.cse1 (= 1 v_~__unbuffered_p1_EAX~0_27)) (.cse2 (= v_~y~0_36 2))) (or (and (= v_~main$tmp_guard1~0_17 0) .cse0 .cse1 .cse2) (and (= v_~main$tmp_guard1~0_17 1) (or (not .cse0) (not .cse1) (not .cse2))))) (= |v_ULTIMATE.start_main_#t~ite63_28| v_~__unbuffered_p1_EAX~0_27)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~y~0=v_~y~0_36} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem62, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:41:06,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:41:06,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:41:06 BasicIcfg [2019-12-26 23:41:06,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:41:06,221 INFO L168 Benchmark]: Toolchain (without parser) took 46046.47 ms. Allocated memory was 138.9 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 100.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 889.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:06,224 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:41:06,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.05 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 153.6 MB in the end (delta: -53.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:06,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.94 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:06,229 INFO L168 Benchmark]: Boogie Preprocessor took 43.08 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:06,230 INFO L168 Benchmark]: RCFGBuilder took 906.51 ms. Allocated memory is still 202.4 MB. Free memory was 148.1 MB in the beginning and 93.1 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:06,230 INFO L168 Benchmark]: TraceAbstraction took 44236.81 ms. Allocated memory was 202.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 92.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 818.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:41:06,233 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.05 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 153.6 MB in the end (delta: -53.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.94 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.08 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 906.51 ms. Allocated memory is still 202.4 MB. Free memory was 148.1 MB in the beginning and 93.1 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44236.81 ms. Allocated memory was 202.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 92.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 818.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.1s, 192 ProgramPointsBefore, 86 ProgramPointsAfterwards, 230 TransitionsBefore, 95 TransitionsAfterwards, 19530 CoEnabledTransitionPairs, 8 FixpointIterations, 49 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 33 ChoiceCompositions, 7748 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 222 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 80972 CheckedPairsTotal, 145 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L827] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L829] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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] [L764] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 2 x$flush_delayed = weak$$choice2 [L767] EXPR 2 \read(x) [L767] 2 x$mem_tmp = x [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 \read(x) [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=1, 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] [L768] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L771] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x={5:0}, x$flush_delayed=1, 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] [L772] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 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_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=1] [L799] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=2] [L785] 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) [L802] 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_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=2] [L744] 1 __unbuffered_p0_EAX = y [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=2] [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\read(x)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=1, y=2] [L750] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 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 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5: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=2] [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 183 locations, 1 error locations. Result: UNSAFE, OverallTime: 43.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2170 SDtfs, 2487 SDslu, 3080 SDs, 0 SdLazy, 1878 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 17 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88334occurred 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: 15.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 31162 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 923 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 842 ConstructedInterpolants, 0 QuantifiedInterpolants, 98395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...