/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:30:41,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:30:41,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:30:41,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:30:41,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:30:41,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:30:41,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:30:41,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:30:41,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:30:41,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:30:41,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:30:41,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:30:41,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:30:41,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:30:41,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:30:41,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:30:41,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:30:41,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:30:41,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:30:41,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:30:41,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:30:41,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:30:41,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:30:41,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:30:41,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:30:41,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:30:41,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:30:41,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:30:41,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:30:41,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:30:41,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:30:41,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:30:41,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:30:41,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:30:41,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:30:41,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:30:41,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:30:41,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:30:41,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:30:41,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:30:41,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:30:41,952 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:30:41,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:30:41,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:30:41,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:30:41,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:30:41,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:30:41,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:30:41,968 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:30:41,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:30:41,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:30:41,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:30:41,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:30:41,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:30:41,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:30:41,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:30:41,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:30:41,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:30:41,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:30:41,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:30:41,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:30:41,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:30:41,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:30:41,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:30:41,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:30:41,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:30:41,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:30:41,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:30:41,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:30:41,972 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:30:41,973 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:30:41,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:30:41,973 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:30:41,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:30:42,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:30:42,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:30:42,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:30:42,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:30:42,258 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:30:42,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-27 20:30:42,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b64ae7ab/4769d6a65bae4b60b03bd52ead5f1b42/FLAGecda215f2 [2019-12-27 20:30:42,855 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:30:42,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-27 20:30:42,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b64ae7ab/4769d6a65bae4b60b03bd52ead5f1b42/FLAGecda215f2 [2019-12-27 20:30:43,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b64ae7ab/4769d6a65bae4b60b03bd52ead5f1b42 [2019-12-27 20:30:43,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:30:43,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:30:43,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:30:43,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:30:43,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:30:43,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:43,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422d76cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43, skipping insertion in model container [2019-12-27 20:30:43,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:43,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:30:43,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:30:43,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:30:43,832 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:30:43,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:30:43,978 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:30:43,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43 WrapperNode [2019-12-27 20:30:43,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:30:43,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:30:43,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:30:43,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:30:43,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:30:44,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:30:44,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:30:44,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:30:44,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (1/1) ... [2019-12-27 20:30:44,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:30:44,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:30:44,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:30:44,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:30:44,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (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-27 20:30:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:30:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:30:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:30:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:30:44,151 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:30:44,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:30:44,152 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:30:44,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:30:44,152 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:30:44,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:30:44,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:30:44,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:30:44,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:30:44,155 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:30:44,955 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:30:44,956 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:30:44,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:30:44 BoogieIcfgContainer [2019-12-27 20:30:44,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:30:44,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:30:44,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:30:44,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:30:44,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:30:43" (1/3) ... [2019-12-27 20:30:44,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f506d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:30:44, skipping insertion in model container [2019-12-27 20:30:44,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:30:43" (2/3) ... [2019-12-27 20:30:44,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f506d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:30:44, skipping insertion in model container [2019-12-27 20:30:44,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:30:44" (3/3) ... [2019-12-27 20:30:44,966 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.opt.i [2019-12-27 20:30:44,976 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:30:44,977 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:30:44,985 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:30:44,985 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:30:45,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,072 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,072 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,073 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,076 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,077 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,090 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,090 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,099 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,113 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,114 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:30:45,129 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:30:45,149 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:30:45,149 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:30:45,149 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:30:45,150 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:30:45,150 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:30:45,150 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:30:45,150 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:30:45,150 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:30:45,168 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 20:30:45,170 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 20:30:45,269 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 20:30:45,269 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:30:45,284 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:30:45,308 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 20:30:45,360 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 20:30:45,360 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:30:45,368 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:30:45,387 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 20:30:45,388 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:30:49,258 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:30:49,401 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:30:49,420 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-27 20:30:49,420 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 20:30:49,423 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 20:30:59,318 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 20:30:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 20:30:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:30:59,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:30:59,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:30:59,328 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:30:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:30:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-27 20:30:59,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:30:59,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423578769] [2019-12-27 20:30:59,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:30:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:30:59,616 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-27 20:30:59,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423578769] [2019-12-27 20:30:59,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:30:59,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:30:59,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520302043] [2019-12-27 20:30:59,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:30:59,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:30:59,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:30:59,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:30:59,642 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:30:59,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:30:59,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:30:59,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:30:59,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:30:59,660 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 20:31:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:02,962 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 20:31:02,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:31:02,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:31:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:03,540 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 20:31:03,540 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 20:31:03,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:31:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 20:31:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 20:31:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 20:31:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 20:31:10,335 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 20:31:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:10,335 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 20:31:10,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:31:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 20:31:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:31:12,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:12,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:12,772 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:12,772 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-27 20:31:12,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:12,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976410765] [2019-12-27 20:31:12,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:12,851 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-27 20:31:12,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976410765] [2019-12-27 20:31:12,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:12,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:31:12,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [725813429] [2019-12-27 20:31:12,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:12,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:12,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:31:12,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:12,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:31:12,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:31:12,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:31:12,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:31:12,861 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 20:31:13,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:13,064 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 20:31:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:31:13,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:31:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:13,184 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 20:31:13,184 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 20:31:13,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:31:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 20:31:13,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 20:31:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 20:31:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 20:31:13,775 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 20:31:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:13,775 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 20:31:13,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:31:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 20:31:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:31:13,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:13,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:13,778 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-27 20:31:13,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:13,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041703773] [2019-12-27 20:31:13,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:13,873 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-27 20:31:13,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041703773] [2019-12-27 20:31:13,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:13,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:31:13,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [674199744] [2019-12-27 20:31:13,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:13,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:13,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:31:13,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:13,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:31:13,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:31:13,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:31:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:31:13,879 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 20:31:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:14,262 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 20:31:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:31:14,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:31:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:14,352 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 20:31:14,353 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 20:31:14,353 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-27 20:31:14,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 20:31:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 20:31:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 20:31:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 20:31:15,369 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 20:31:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:15,369 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 20:31:15,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:31:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 20:31:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:31:15,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:15,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:15,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:15,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:15,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-27 20:31:15,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:15,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958008369] [2019-12-27 20:31:15,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:15,444 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-27 20:31:15,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958008369] [2019-12-27 20:31:15,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:15,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:31:15,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406472820] [2019-12-27 20:31:15,445 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:15,447 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:15,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:31:15,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:15,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:31:15,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:31:15,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:31:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:31:15,493 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 5 states. [2019-12-27 20:31:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:15,882 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 20:31:15,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:31:15,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:31:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:15,969 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 20:31:15,969 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 20:31:15,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:31:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 20:31:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 20:31:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 20:31:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 20:31:17,070 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 20:31:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:17,071 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 20:31:17,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:31:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 20:31:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:31:17,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:17,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:17,074 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:17,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-27 20:31:17,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:17,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407612526] [2019-12-27 20:31:17,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:17,154 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-27 20:31:17,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407612526] [2019-12-27 20:31:17,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:17,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:31:17,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1812982036] [2019-12-27 20:31:17,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:17,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:17,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:31:17,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:17,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:31:17,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:31:17,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:17,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:31:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:31:17,178 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 5 states. [2019-12-27 20:31:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:17,585 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 20:31:17,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:31:17,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:31:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:17,651 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 20:31:17,651 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 20:31:17,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:31:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 20:31:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 20:31:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 20:31:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 20:31:18,563 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 20:31:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:18,563 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 20:31:18,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:31:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 20:31:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:31:18,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:18,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:18,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:18,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:18,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-27 20:31:18,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:18,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313998186] [2019-12-27 20:31:18,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:18,714 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-27 20:31:18,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313998186] [2019-12-27 20:31:18,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:18,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:31:18,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [440766387] [2019-12-27 20:31:18,715 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:18,721 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:18,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 20:31:18,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:18,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:31:18,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:31:18,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:31:18,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:31:18,729 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 20:31:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:19,342 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 20:31:19,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:31:19,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:31:19,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:19,422 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 20:31:19,422 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 20:31:19,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:31:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 20:31:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 20:31:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 20:31:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 20:31:20,442 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 20:31:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:20,443 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 20:31:20,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:31:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 20:31:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:31:20,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:20,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:20,453 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:20,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:20,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-27 20:31:20,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:20,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567435622] [2019-12-27 20:31:20,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:20,526 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-27 20:31:20,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567435622] [2019-12-27 20:31:20,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:20,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:31:20,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881323871] [2019-12-27 20:31:20,527 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:20,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:20,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 20:31:20,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:20,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:31:20,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:31:20,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:31:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:31:20,538 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 20:31:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:21,121 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 20:31:21,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:31:21,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:31:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:21,203 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 20:31:21,203 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 20:31:21,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:31:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 20:31:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 20:31:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 20:31:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 20:31:22,100 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 20:31:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:22,101 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 20:31:22,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:31:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 20:31:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:31:22,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:22,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:22,111 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:22,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-27 20:31:22,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:22,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056980825] [2019-12-27 20:31:22,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:22,155 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-27 20:31:22,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056980825] [2019-12-27 20:31:22,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:22,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:31:22,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1093831576] [2019-12-27 20:31:22,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:22,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:22,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:31:22,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:22,166 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:31:22,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:31:22,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:31:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:31:22,167 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 20:31:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:22,238 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 20:31:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:31:22,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 20:31:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:22,255 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 20:31:22,255 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 20:31:22,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:31:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 20:31:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 20:31:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 20:31:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 20:31:22,419 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 20:31:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:22,420 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 20:31:22,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:31:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 20:31:22,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:31:22,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:22,435 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-27 20:31:22,435 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-27 20:31:22,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:22,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058849391] [2019-12-27 20:31:22,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:22,510 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-27 20:31:22,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058849391] [2019-12-27 20:31:22,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:22,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:31:22,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1354628952] [2019-12-27 20:31:22,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:22,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:22,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 100 transitions. [2019-12-27 20:31:22,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:22,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:31:22,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:31:22,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:22,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:31:22,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:31:22,545 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 20:31:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:22,590 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-27 20:31:22,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:31:22,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:31:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:22,610 INFO L225 Difference]: With dead ends: 11488 [2019-12-27 20:31:22,610 INFO L226 Difference]: Without dead ends: 11488 [2019-12-27 20:31:22,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:31:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-27 20:31:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-27 20:31:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-27 20:31:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-27 20:31:22,775 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-27 20:31:22,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:22,775 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-27 20:31:22,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:31:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-27 20:31:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:31:22,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:22,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:22,793 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-27 20:31:22,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:22,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117053818] [2019-12-27 20:31:22,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:22,861 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-27 20:31:22,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117053818] [2019-12-27 20:31:22,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:22,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:31:22,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273946321] [2019-12-27 20:31:22,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:22,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:22,911 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 166 transitions. [2019-12-27 20:31:22,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:22,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:31:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:31:22,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:31:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:31:22,915 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-27 20:31:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:22,990 INFO L93 Difference]: Finished difference Result 10239 states and 32168 transitions. [2019-12-27 20:31:22,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:31:22,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 20:31:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:23,007 INFO L225 Difference]: With dead ends: 10239 [2019-12-27 20:31:23,007 INFO L226 Difference]: Without dead ends: 10239 [2019-12-27 20:31:23,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:31:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10239 states. [2019-12-27 20:31:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10239 to 9735. [2019-12-27 20:31:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9735 states. [2019-12-27 20:31:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 30758 transitions. [2019-12-27 20:31:23,230 INFO L78 Accepts]: Start accepts. Automaton has 9735 states and 30758 transitions. Word has length 40 [2019-12-27 20:31:23,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:23,231 INFO L462 AbstractCegarLoop]: Abstraction has 9735 states and 30758 transitions. [2019-12-27 20:31:23,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:31:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 30758 transitions. [2019-12-27 20:31:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:31:23,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:23,245 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] [2019-12-27 20:31:23,245 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-27 20:31:23,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:23,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230259724] [2019-12-27 20:31:23,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:23,330 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-27 20:31:23,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230259724] [2019-12-27 20:31:23,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:23,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:31:23,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687691047] [2019-12-27 20:31:23,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:23,351 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:23,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 296 transitions. [2019-12-27 20:31:23,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:23,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:31:23,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:31:23,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:31:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:31:23,550 INFO L87 Difference]: Start difference. First operand 9735 states and 30758 transitions. Second operand 3 states. [2019-12-27 20:31:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:23,655 INFO L93 Difference]: Finished difference Result 12683 states and 39352 transitions. [2019-12-27 20:31:23,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:31:23,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:31:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:23,680 INFO L225 Difference]: With dead ends: 12683 [2019-12-27 20:31:23,680 INFO L226 Difference]: Without dead ends: 12683 [2019-12-27 20:31:23,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:31:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2019-12-27 20:31:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 10393. [2019-12-27 20:31:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-27 20:31:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-27 20:31:23,924 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 54 [2019-12-27 20:31:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:23,924 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-27 20:31:23,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:31:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-27 20:31:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:31:23,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:23,940 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] [2019-12-27 20:31:23,940 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:23,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-27 20:31:23,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:23,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465118143] [2019-12-27 20:31:23,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:24,074 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-27 20:31:24,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465118143] [2019-12-27 20:31:24,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:24,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:31:24,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1452726238] [2019-12-27 20:31:24,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:24,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:24,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 296 transitions. [2019-12-27 20:31:24,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:24,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:31:24,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:31:24,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:31:24,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:31:24,289 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 8 states. [2019-12-27 20:31:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:25,910 INFO L93 Difference]: Finished difference Result 39523 states and 122432 transitions. [2019-12-27 20:31:25,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:31:25,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 20:31:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:25,961 INFO L225 Difference]: With dead ends: 39523 [2019-12-27 20:31:25,962 INFO L226 Difference]: Without dead ends: 31264 [2019-12-27 20:31:25,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:31:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31264 states. [2019-12-27 20:31:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31264 to 13189. [2019-12-27 20:31:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13189 states. [2019-12-27 20:31:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 41908 transitions. [2019-12-27 20:31:26,321 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 41908 transitions. Word has length 54 [2019-12-27 20:31:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:26,322 INFO L462 AbstractCegarLoop]: Abstraction has 13189 states and 41908 transitions. [2019-12-27 20:31:26,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:31:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 41908 transitions. [2019-12-27 20:31:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:31:26,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:26,341 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] [2019-12-27 20:31:26,341 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:26,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-27 20:31:26,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:26,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118633947] [2019-12-27 20:31:26,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:26,423 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-27 20:31:26,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118633947] [2019-12-27 20:31:26,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:26,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:31:26,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339524870] [2019-12-27 20:31:26,425 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:26,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:26,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 333 transitions. [2019-12-27 20:31:26,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:26,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:31:26,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:31:26,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:31:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:31:26,599 INFO L87 Difference]: Start difference. First operand 13189 states and 41908 transitions. Second operand 7 states. [2019-12-27 20:31:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:27,002 INFO L93 Difference]: Finished difference Result 34316 states and 106692 transitions. [2019-12-27 20:31:27,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:31:27,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 20:31:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:27,041 INFO L225 Difference]: With dead ends: 34316 [2019-12-27 20:31:27,041 INFO L226 Difference]: Without dead ends: 25449 [2019-12-27 20:31:27,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:31:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25449 states. [2019-12-27 20:31:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25449 to 17200. [2019-12-27 20:31:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17200 states. [2019-12-27 20:31:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17200 states to 17200 states and 54622 transitions. [2019-12-27 20:31:27,513 INFO L78 Accepts]: Start accepts. Automaton has 17200 states and 54622 transitions. Word has length 54 [2019-12-27 20:31:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:27,513 INFO L462 AbstractCegarLoop]: Abstraction has 17200 states and 54622 transitions. [2019-12-27 20:31:27,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:31:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 17200 states and 54622 transitions. [2019-12-27 20:31:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:31:27,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:27,534 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] [2019-12-27 20:31:27,534 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 714355520, now seen corresponding path program 3 times [2019-12-27 20:31:27,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:27,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135668140] [2019-12-27 20:31:27,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:27,644 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-27 20:31:27,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135668140] [2019-12-27 20:31:27,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:27,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:31:27,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1623041747] [2019-12-27 20:31:27,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:27,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:27,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 350 transitions. [2019-12-27 20:31:27,826 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:27,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 20:31:27,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:31:27,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:27,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:31:27,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:31:27,976 INFO L87 Difference]: Start difference. First operand 17200 states and 54622 transitions. Second operand 9 states. [2019-12-27 20:31:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:29,699 INFO L93 Difference]: Finished difference Result 89167 states and 277833 transitions. [2019-12-27 20:31:29,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 20:31:29,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 20:31:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:29,825 INFO L225 Difference]: With dead ends: 89167 [2019-12-27 20:31:29,825 INFO L226 Difference]: Without dead ends: 76971 [2019-12-27 20:31:29,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 20:31:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76971 states. [2019-12-27 20:31:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76971 to 23213. [2019-12-27 20:31:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23213 states. [2019-12-27 20:31:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23213 states to 23213 states and 74466 transitions. [2019-12-27 20:31:30,810 INFO L78 Accepts]: Start accepts. Automaton has 23213 states and 74466 transitions. Word has length 54 [2019-12-27 20:31:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:30,810 INFO L462 AbstractCegarLoop]: Abstraction has 23213 states and 74466 transitions. [2019-12-27 20:31:30,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:31:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 23213 states and 74466 transitions. [2019-12-27 20:31:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:31:30,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:30,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:30,845 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash 265762130, now seen corresponding path program 4 times [2019-12-27 20:31:30,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:30,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921960643] [2019-12-27 20:31:30,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:30,957 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-27 20:31:30,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921960643] [2019-12-27 20:31:30,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:30,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:31:30,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2125405915] [2019-12-27 20:31:30,958 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:30,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:31,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 361 transitions. [2019-12-27 20:31:31,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:31,422 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 20:31:31,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:31:31,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:31:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:31:31,423 INFO L87 Difference]: Start difference. First operand 23213 states and 74466 transitions. Second operand 11 states. [2019-12-27 20:31:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:34,626 INFO L93 Difference]: Finished difference Result 83337 states and 259975 transitions. [2019-12-27 20:31:34,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 20:31:34,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 20:31:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:34,822 INFO L225 Difference]: With dead ends: 83337 [2019-12-27 20:31:34,822 INFO L226 Difference]: Without dead ends: 80157 [2019-12-27 20:31:34,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=689, Invalid=2851, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 20:31:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80157 states. [2019-12-27 20:31:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80157 to 22741. [2019-12-27 20:31:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22741 states. [2019-12-27 20:31:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22741 states to 22741 states and 73038 transitions. [2019-12-27 20:31:35,791 INFO L78 Accepts]: Start accepts. Automaton has 22741 states and 73038 transitions. Word has length 54 [2019-12-27 20:31:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:35,791 INFO L462 AbstractCegarLoop]: Abstraction has 22741 states and 73038 transitions. [2019-12-27 20:31:35,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:31:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 22741 states and 73038 transitions. [2019-12-27 20:31:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:31:35,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:35,832 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] [2019-12-27 20:31:35,832 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-27 20:31:35,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:35,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765509883] [2019-12-27 20:31:35,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:35,995 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-27 20:31:35,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765509883] [2019-12-27 20:31:35,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:35,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:31:35,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436492971] [2019-12-27 20:31:35,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:36,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:36,323 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 284 transitions. [2019-12-27 20:31:36,323 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:36,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:31:36,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:31:36,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:31:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:31:36,325 INFO L87 Difference]: Start difference. First operand 22741 states and 73038 transitions. Second operand 3 states. [2019-12-27 20:31:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:36,440 INFO L93 Difference]: Finished difference Result 22739 states and 73033 transitions. [2019-12-27 20:31:36,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:31:36,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:31:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:36,488 INFO L225 Difference]: With dead ends: 22739 [2019-12-27 20:31:36,489 INFO L226 Difference]: Without dead ends: 22739 [2019-12-27 20:31:36,489 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-27 20:31:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22739 states. [2019-12-27 20:31:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22739 to 21096. [2019-12-27 20:31:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21096 states. [2019-12-27 20:31:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21096 states to 21096 states and 68535 transitions. [2019-12-27 20:31:36,859 INFO L78 Accepts]: Start accepts. Automaton has 21096 states and 68535 transitions. Word has length 54 [2019-12-27 20:31:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:36,859 INFO L462 AbstractCegarLoop]: Abstraction has 21096 states and 68535 transitions. [2019-12-27 20:31:36,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:31:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 21096 states and 68535 transitions. [2019-12-27 20:31:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:31:36,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:36,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:36,886 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1896131244, now seen corresponding path program 1 times [2019-12-27 20:31:36,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:36,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329933] [2019-12-27 20:31:36,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:36,950 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-27 20:31:36,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329933] [2019-12-27 20:31:36,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:36,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:31:36,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1529153557] [2019-12-27 20:31:36,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:36,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:37,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 285 transitions. [2019-12-27 20:31:37,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:37,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:31:37,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:31:37,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:37,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:31:37,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:31:37,102 INFO L87 Difference]: Start difference. First operand 21096 states and 68535 transitions. Second operand 4 states. [2019-12-27 20:31:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:37,356 INFO L93 Difference]: Finished difference Result 26284 states and 82782 transitions. [2019-12-27 20:31:37,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:31:37,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 20:31:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:37,396 INFO L225 Difference]: With dead ends: 26284 [2019-12-27 20:31:37,396 INFO L226 Difference]: Without dead ends: 26284 [2019-12-27 20:31:37,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:31:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26284 states. [2019-12-27 20:31:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26284 to 16534. [2019-12-27 20:31:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16534 states. [2019-12-27 20:31:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 52346 transitions. [2019-12-27 20:31:37,868 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 52346 transitions. Word has length 55 [2019-12-27 20:31:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:37,868 INFO L462 AbstractCegarLoop]: Abstraction has 16534 states and 52346 transitions. [2019-12-27 20:31:37,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:31:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 52346 transitions. [2019-12-27 20:31:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:31:37,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:37,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:37,887 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:37,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1578077188, now seen corresponding path program 1 times [2019-12-27 20:31:37,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:37,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897258837] [2019-12-27 20:31:37,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:38,018 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-27 20:31:38,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897258837] [2019-12-27 20:31:38,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:38,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:31:38,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2026835459] [2019-12-27 20:31:38,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:38,040 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:38,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 281 transitions. [2019-12-27 20:31:38,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:38,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:31:38,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:31:38,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:38,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:31:38,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:31:38,200 INFO L87 Difference]: Start difference. First operand 16534 states and 52346 transitions. Second operand 9 states. [2019-12-27 20:31:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:39,745 INFO L93 Difference]: Finished difference Result 29391 states and 92467 transitions. [2019-12-27 20:31:39,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:31:39,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 20:31:39,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:39,809 INFO L225 Difference]: With dead ends: 29391 [2019-12-27 20:31:39,809 INFO L226 Difference]: Without dead ends: 24775 [2019-12-27 20:31:39,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:31:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24775 states. [2019-12-27 20:31:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24775 to 17142. [2019-12-27 20:31:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17142 states. [2019-12-27 20:31:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17142 states to 17142 states and 54026 transitions. [2019-12-27 20:31:40,338 INFO L78 Accepts]: Start accepts. Automaton has 17142 states and 54026 transitions. Word has length 56 [2019-12-27 20:31:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:40,338 INFO L462 AbstractCegarLoop]: Abstraction has 17142 states and 54026 transitions. [2019-12-27 20:31:40,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:31:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 17142 states and 54026 transitions. [2019-12-27 20:31:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:31:40,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:40,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:40,360 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:40,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 2 times [2019-12-27 20:31:40,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:40,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110810693] [2019-12-27 20:31:40,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:31:40,513 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-27 20:31:40,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110810693] [2019-12-27 20:31:40,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:31:40,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:31:40,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1714426362] [2019-12-27 20:31:40,515 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:31:40,530 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:31:40,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 454 transitions. [2019-12-27 20:31:40,829 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:31:40,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:31:40,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:31:40,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:31:40,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:31:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:31:40,881 INFO L87 Difference]: Start difference. First operand 17142 states and 54026 transitions. Second operand 11 states. [2019-12-27 20:31:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:31:41,946 INFO L93 Difference]: Finished difference Result 31967 states and 99390 transitions. [2019-12-27 20:31:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 20:31:41,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 20:31:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:31:41,985 INFO L225 Difference]: With dead ends: 31967 [2019-12-27 20:31:41,985 INFO L226 Difference]: Without dead ends: 25991 [2019-12-27 20:31:41,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 20:31:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25991 states. [2019-12-27 20:31:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25991 to 15962. [2019-12-27 20:31:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15962 states. [2019-12-27 20:31:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15962 states to 15962 states and 49980 transitions. [2019-12-27 20:31:42,302 INFO L78 Accepts]: Start accepts. Automaton has 15962 states and 49980 transitions. Word has length 56 [2019-12-27 20:31:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:31:42,302 INFO L462 AbstractCegarLoop]: Abstraction has 15962 states and 49980 transitions. [2019-12-27 20:31:42,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:31:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 15962 states and 49980 transitions. [2019-12-27 20:31:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:31:42,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:31:42,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:31:42,320 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:31:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:31:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 3 times [2019-12-27 20:31:42,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:31:42,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530267239] [2019-12-27 20:31:42,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:31:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:31:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:31:42,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:31:42,442 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:31:42,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_16|) |v_ULTIMATE.start_main_~#t636~0.offset_13| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd3~0_17) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= |v_ULTIMATE.start_main_~#t636~0.offset_13| 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t636~0.base_16|) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t636~0.base_16|) 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t636~0.base_16| 1)) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t636~0.base_16| 4)) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_15|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ULTIMATE.start_main_~#t636~0.offset=|v_ULTIMATE.start_main_~#t636~0.offset_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ULTIMATE.start_main_~#t636~0.base=|v_ULTIMATE.start_main_~#t636~0.base_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t638~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t638~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t636~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t636~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t637~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:31:42,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t637~0.base_11|) (= |v_ULTIMATE.start_main_~#t637~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11|) |v_ULTIMATE.start_main_~#t637~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t637~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t637~0.base_11| 0)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, #length, ULTIMATE.start_main_~#t637~0.base] because there is no mapped edge [2019-12-27 20:31:42,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out758235314| 1) (= ~y$w_buff1_used~0_Out758235314 ~y$w_buff0_used~0_In758235314) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out758235314| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out758235314) (= 1 ~y$w_buff0_used~0_Out758235314) (= P1Thread1of1ForFork1_~arg.base_Out758235314 |P1Thread1of1ForFork1_#in~arg.base_In758235314|) (= ~y$w_buff1~0_Out758235314 ~y$w_buff0~0_In758235314) (= P1Thread1of1ForFork1_~arg.offset_Out758235314 |P1Thread1of1ForFork1_#in~arg.offset_In758235314|) (= ~y$w_buff0~0_Out758235314 1) (= (mod ~y$w_buff1_used~0_Out758235314 256) 0)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In758235314, ~y$w_buff0~0=~y$w_buff0~0_In758235314, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In758235314|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In758235314|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out758235314, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out758235314, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out758235314, ~y$w_buff1~0=~y$w_buff1~0_Out758235314, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out758235314|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out758235314, ~y$w_buff0~0=~y$w_buff0~0_Out758235314, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In758235314|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In758235314|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out758235314} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:31:42,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t638~0.base_11|)) (= |v_ULTIMATE.start_main_~#t638~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t638~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11|) |v_ULTIMATE.start_main_~#t638~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t638~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t638~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t638~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:31:42,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2009431441 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-2009431441 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite33_Out-2009431441| |P2Thread1of1ForFork2_#t~ite32_Out-2009431441|))) (or (and (= ~y$w_buff1~0_In-2009431441 |P2Thread1of1ForFork2_#t~ite32_Out-2009431441|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite32_Out-2009431441| ~y~0_In-2009431441)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2009431441, ~y$w_buff1~0=~y$w_buff1~0_In-2009431441, ~y~0=~y~0_In-2009431441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2009431441} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2009431441, ~y$w_buff1~0=~y$w_buff1~0_In-2009431441, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out-2009431441|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-2009431441|, ~y~0=~y~0_In-2009431441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2009431441} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 20:31:42,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2019564244 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2019564244 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2019564244 |P1Thread1of1ForFork1_#t~ite28_Out-2019564244|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-2019564244|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019564244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2019564244} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019564244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2019564244, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-2019564244|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:31:42,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1997994796 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1997994796 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out-1997994796|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1997994796 |P2Thread1of1ForFork2_#t~ite34_Out-1997994796|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997994796, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1997994796} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1997994796|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1997994796, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1997994796} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 20:31:42,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-997511742 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-997511742 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-997511742 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-997511742 256) 0))) (or (and (= ~y$w_buff1_used~0_In-997511742 |P2Thread1of1ForFork2_#t~ite35_Out-997511742|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite35_Out-997511742| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-997511742, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-997511742, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-997511742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997511742} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-997511742|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-997511742, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-997511742, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-997511742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997511742} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 20:31:42,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1173752997 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1173752997 256)))) (or (and (= ~y$r_buff0_thd3~0_In-1173752997 |P2Thread1of1ForFork2_#t~ite36_Out-1173752997|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite36_Out-1173752997| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1173752997, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1173752997} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-1173752997|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1173752997, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1173752997} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 20:31:42,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1818231622 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1818231622 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1818231622 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1818231622 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1818231622 |P2Thread1of1ForFork2_#t~ite37_Out-1818231622|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-1818231622|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1818231622, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1818231622, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1818231622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1818231622} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1818231622|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1818231622, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1818231622, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1818231622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1818231622} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 20:31:42,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 20:31:42,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-214333205 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-214333205 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-214333205 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-214333205 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-214333205|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-214333205 |P1Thread1of1ForFork1_#t~ite29_Out-214333205|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-214333205, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-214333205, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-214333205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-214333205} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-214333205, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-214333205|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-214333205, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-214333205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-214333205} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 20:31:42,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-734833 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-734833 256)))) (or (and (= ~y$r_buff0_thd2~0_In-734833 ~y$r_buff0_thd2~0_Out-734833) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd2~0_Out-734833) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-734833, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-734833} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-734833|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-734833, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-734833} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:31:42,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-2057669882 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-2057669882 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2057669882 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2057669882 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-2057669882|)) (and (= ~y$r_buff1_thd2~0_In-2057669882 |P1Thread1of1ForFork1_#t~ite31_Out-2057669882|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2057669882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2057669882, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2057669882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2057669882} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2057669882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2057669882, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-2057669882|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2057669882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2057669882} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:31:42,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:31:42,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1306615211 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1306615211 256)))) (or (= (mod ~y$w_buff0_used~0_In1306615211 256) 0) (and (= (mod ~y$w_buff1_used~0_In1306615211 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd1~0_In1306615211 256) 0) .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out1306615211| |P0Thread1of1ForFork0_#t~ite9_Out1306615211|) (= ~y$w_buff0~0_In1306615211 |P0Thread1of1ForFork0_#t~ite8_Out1306615211|) .cse1) (and (= |P0Thread1of1ForFork0_#t~ite8_In1306615211| |P0Thread1of1ForFork0_#t~ite8_Out1306615211|) (not .cse1) (= ~y$w_buff0~0_In1306615211 |P0Thread1of1ForFork0_#t~ite9_Out1306615211|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1306615211, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1306615211, ~y$w_buff0~0=~y$w_buff0~0_In1306615211, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1306615211, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In1306615211|, ~weak$$choice2~0=~weak$$choice2~0_In1306615211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1306615211} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1306615211, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1306615211|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1306615211, ~y$w_buff0~0=~y$w_buff0~0_In1306615211, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1306615211|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1306615211, ~weak$$choice2~0=~weak$$choice2~0_In1306615211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1306615211} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:31:42,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-887048585 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out-887048585| ~y$w_buff1~0_In-887048585) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In-887048585| |P0Thread1of1ForFork0_#t~ite11_Out-887048585|)) (and (= |P0Thread1of1ForFork0_#t~ite11_Out-887048585| ~y$w_buff1~0_In-887048585) (= |P0Thread1of1ForFork0_#t~ite11_Out-887048585| |P0Thread1of1ForFork0_#t~ite12_Out-887048585|) (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-887048585 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-887048585 256))) (= (mod ~y$w_buff0_used~0_In-887048585 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-887048585 256))))) .cse0))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-887048585|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-887048585, ~y$w_buff1~0=~y$w_buff1~0_In-887048585, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-887048585, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-887048585, ~weak$$choice2~0=~weak$$choice2~0_In-887048585, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-887048585} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-887048585|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-887048585, ~y$w_buff1~0=~y$w_buff1~0_In-887048585, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-887048585, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-887048585, ~weak$$choice2~0=~weak$$choice2~0_In-887048585, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-887048585|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-887048585} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 20:31:42,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 20:31:42,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1868587729 256) 0)) (.cse4 (= |P0Thread1of1ForFork0_#t~ite24_Out1868587729| |P0Thread1of1ForFork0_#t~ite23_Out1868587729|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1868587729 256))) (.cse5 (= (mod ~weak$$choice2~0_In1868587729 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1868587729 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1868587729 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite22_In1868587729| |P0Thread1of1ForFork0_#t~ite22_Out1868587729|) (or (and (or .cse0 (and .cse1 .cse2) (and .cse3 .cse1)) .cse4 (= ~y$r_buff1_thd1~0_In1868587729 |P0Thread1of1ForFork0_#t~ite23_Out1868587729|) .cse5) (and (= |P0Thread1of1ForFork0_#t~ite24_Out1868587729| ~y$r_buff1_thd1~0_In1868587729) (= |P0Thread1of1ForFork0_#t~ite23_In1868587729| |P0Thread1of1ForFork0_#t~ite23_Out1868587729|) (not .cse5)))) (let ((.cse6 (not .cse1))) (and (= |P0Thread1of1ForFork0_#t~ite22_Out1868587729| |P0Thread1of1ForFork0_#t~ite23_Out1868587729|) (or .cse6 (not .cse3)) (= 0 |P0Thread1of1ForFork0_#t~ite22_Out1868587729|) .cse4 (or .cse6 (not .cse2)) .cse5 (not .cse0))))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In1868587729|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1868587729, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1868587729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1868587729, ~weak$$choice2~0=~weak$$choice2~0_In1868587729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1868587729, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In1868587729|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out1868587729|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1868587729, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1868587729, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1868587729, ~weak$$choice2~0=~weak$$choice2~0_In1868587729, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out1868587729|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out1868587729|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1868587729} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 20:31:42,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 20:31:42,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:31:42,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-977558847 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-977558847 256) 0))) (or (and (= ~y~0_In-977558847 |ULTIMATE.start_main_#t~ite41_Out-977558847|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-977558847| ~y$w_buff1~0_In-977558847)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-977558847, ~y~0=~y~0_In-977558847, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-977558847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-977558847} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-977558847|, ~y$w_buff1~0=~y$w_buff1~0_In-977558847, ~y~0=~y~0_In-977558847, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-977558847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-977558847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 20:31:42,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:31:42,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2019907905 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2019907905 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out2019907905| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out2019907905| ~y$w_buff0_used~0_In2019907905) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2019907905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2019907905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2019907905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2019907905, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2019907905|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:31:42,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-442832901 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-442832901 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-442832901 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-442832901 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-442832901| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-442832901| ~y$w_buff1_used~0_In-442832901)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-442832901, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-442832901, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-442832901, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-442832901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-442832901, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-442832901, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-442832901, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-442832901|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-442832901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:31:42,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-922229950 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-922229950 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-922229950| ~y$r_buff0_thd0~0_In-922229950) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-922229950|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-922229950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-922229950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-922229950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-922229950, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-922229950|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:31:42,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In2063491703 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2063491703 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2063491703 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2063491703 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out2063491703| 0)) (and (= ~y$r_buff1_thd0~0_In2063491703 |ULTIMATE.start_main_#t~ite46_Out2063491703|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2063491703, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2063491703, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2063491703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2063491703} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2063491703, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2063491703, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2063491703|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2063491703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2063491703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:31:42,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:31:42,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:31:42 BasicIcfg [2019-12-27 20:31:42,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:31:42,574 INFO L168 Benchmark]: Toolchain (without parser) took 59423.88 ms. Allocated memory was 144.7 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 101.2 MB in the beginning and 971.4 MB in the end (delta: -870.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:31:42,575 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:31:42,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.28 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 153.1 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:31:42,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.50 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:31:42,578 INFO L168 Benchmark]: Boogie Preprocessor took 45.18 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 147.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:31:42,579 INFO L168 Benchmark]: RCFGBuilder took 868.55 ms. Allocated memory is still 201.3 MB. Free memory was 147.6 MB in the beginning and 100.1 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:31:42,579 INFO L168 Benchmark]: TraceAbstraction took 57611.78 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 100.1 MB in the beginning and 971.4 MB in the end (delta: -871.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:31:42,583 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 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.28 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 153.1 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.50 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.18 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 147.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 868.55 ms. Allocated memory is still 201.3 MB. Free memory was 147.6 MB in the beginning and 100.1 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57611.78 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 100.1 MB in the beginning and 971.4 MB in the end (delta: -871.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 57.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3861 SDtfs, 6101 SDslu, 12289 SDs, 0 SdLazy, 6078 SolverSat, 318 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 120 SyntacticMatches, 50 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred 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: 17.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 213396 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 754 NumberOfCodeBlocks, 754 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 679 ConstructedInterpolants, 0 QuantifiedInterpolants, 123293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...