/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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:44:44,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:44:44,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:44:44,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:44:44,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:44:44,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:44:44,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:44:45,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:44:45,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:44:45,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:44:45,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:44:45,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:44:45,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:44:45,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:44:45,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:44:45,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:44:45,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:44:45,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:44:45,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:44:45,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:44:45,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:44:45,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:44:45,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:44:45,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:44:45,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:44:45,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:44:45,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:44:45,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:44:45,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:44:45,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:44:45,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:44:45,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:44:45,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:44:45,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:44:45,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:44:45,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:44:45,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:44:45,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:44:45,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:44:45,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:44:45,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:44:45,063 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 21:44:45,082 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:44:45,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:44:45,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:44:45,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:44:45,086 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:44:45,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:44:45,086 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:44:45,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:44:45,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:44:45,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:44:45,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:44:45,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:44:45,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:44:45,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:44:45,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:44:45,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:44:45,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:44:45,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:44:45,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:44:45,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:44:45,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:44:45,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:44:45,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:44:45,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:44:45,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:44:45,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:44:45,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:44:45,091 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:44:45,091 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:44:45,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:44:45,093 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:44:45,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:44:45,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:44:45,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:44:45,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:44:45,404 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:44:45,405 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:44:45,405 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2019-12-27 21:44:45,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a554c2e40/f03ddbe5720b46549496e6c296a7b014/FLAGa993c631c [2019-12-27 21:44:46,013 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:44:46,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2019-12-27 21:44:46,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a554c2e40/f03ddbe5720b46549496e6c296a7b014/FLAGa993c631c [2019-12-27 21:44:46,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a554c2e40/f03ddbe5720b46549496e6c296a7b014 [2019-12-27 21:44:46,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:44:46,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:44:46,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:44:46,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:44:46,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:44:46,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:44:46" (1/1) ... [2019-12-27 21:44:46,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9a81ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:46, skipping insertion in model container [2019-12-27 21:44:46,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:44:46" (1/1) ... [2019-12-27 21:44:46,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:44:46,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:44:46,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:44:46,949 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:44:47,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:44:47,104 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:44:47,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47 WrapperNode [2019-12-27 21:44:47,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:44:47,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:44:47,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:44:47,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:44:47,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:44:47,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:44:47,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:44:47,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:44:47,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... [2019-12-27 21:44:47,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:44:47,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:44:47,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:44:47,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:44:47,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:44:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:44:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:44:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:44:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:44:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:44:47,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:44:47,294 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:44:47,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:44:47,295 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:44:47,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:44:47,295 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:44:47,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:44:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:44:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:44:47,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:44:47,298 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 21:44:48,059 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:44:48,059 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:44:48,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:44:48 BoogieIcfgContainer [2019-12-27 21:44:48,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:44:48,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:44:48,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:44:48,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:44:48,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:44:46" (1/3) ... [2019-12-27 21:44:48,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608ad130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:44:48, skipping insertion in model container [2019-12-27 21:44:48,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:44:47" (2/3) ... [2019-12-27 21:44:48,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608ad130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:44:48, skipping insertion in model container [2019-12-27 21:44:48,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:44:48" (3/3) ... [2019-12-27 21:44:48,070 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2019-12-27 21:44:48,079 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:44:48,080 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:44:48,088 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:44:48,089 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:44:48,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,132 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,132 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,139 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,140 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,140 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,140 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,140 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,156 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,158 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,158 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,159 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,159 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,159 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,159 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,159 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,160 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,160 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,160 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,160 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,160 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,161 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,162 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,163 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,164 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,167 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,168 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,172 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,172 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,176 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,176 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,177 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,177 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,178 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,179 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,183 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,183 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,184 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:44:48,207 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:44:48,231 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:44:48,231 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:44:48,231 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:44:48,231 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:44:48,231 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:44:48,232 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:44:48,232 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:44:48,232 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:44:48,256 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-27 21:44:48,258 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 21:44:48,408 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 21:44:48,409 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:44:48,430 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:44:48,447 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-27 21:44:48,544 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-27 21:44:48,544 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:44:48,553 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:44:48,572 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:44:48,574 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:44:51,964 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 21:44:52,350 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:44:52,504 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:44:52,528 INFO L206 etLargeBlockEncoding]: Checked pairs total: 58917 [2019-12-27 21:44:52,528 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 21:44:52,532 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 21:44:54,974 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35998 states. [2019-12-27 21:44:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35998 states. [2019-12-27 21:44:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:44:54,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:54,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:54,984 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:54,989 INFO L82 PathProgramCache]: Analyzing trace with hash 457272598, now seen corresponding path program 1 times [2019-12-27 21:44:54,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:54,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799221329] [2019-12-27 21:44:54,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:55,396 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 21:44:55,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799221329] [2019-12-27 21:44:55,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:55,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:44:55,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873317580] [2019-12-27 21:44:55,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:55,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:55,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:44:55,430 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:55,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:44:55,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:44:55,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:55,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:44:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:44:55,452 INFO L87 Difference]: Start difference. First operand 35998 states. Second operand 3 states. [2019-12-27 21:44:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:44:57,136 INFO L93 Difference]: Finished difference Result 35638 states and 152392 transitions. [2019-12-27 21:44:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:44:57,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:44:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:44:57,533 INFO L225 Difference]: With dead ends: 35638 [2019-12-27 21:44:57,536 INFO L226 Difference]: Without dead ends: 34962 [2019-12-27 21:44:57,538 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 21:44:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34962 states. [2019-12-27 21:44:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34962 to 34962. [2019-12-27 21:44:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34962 states. [2019-12-27 21:44:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34962 states to 34962 states and 149636 transitions. [2019-12-27 21:44:59,529 INFO L78 Accepts]: Start accepts. Automaton has 34962 states and 149636 transitions. Word has length 9 [2019-12-27 21:44:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:44:59,530 INFO L462 AbstractCegarLoop]: Abstraction has 34962 states and 149636 transitions. [2019-12-27 21:44:59,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:44:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34962 states and 149636 transitions. [2019-12-27 21:44:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:44:59,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:44:59,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:44:59,537 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:44:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:44:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1803558014, now seen corresponding path program 1 times [2019-12-27 21:44:59,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:44:59,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11935766] [2019-12-27 21:44:59,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:44:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:44:59,621 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 21:44:59,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11935766] [2019-12-27 21:44:59,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:44:59,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:44:59,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494755156] [2019-12-27 21:44:59,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:44:59,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:44:59,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:44:59,633 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:44:59,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:44:59,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:44:59,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:44:59,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:44:59,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:44:59,670 INFO L87 Difference]: Start difference. First operand 34962 states and 149636 transitions. Second operand 5 states. [2019-12-27 21:45:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:02,137 INFO L93 Difference]: Finished difference Result 55534 states and 228696 transitions. [2019-12-27 21:45:02,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:45:02,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:45:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:02,470 INFO L225 Difference]: With dead ends: 55534 [2019-12-27 21:45:02,471 INFO L226 Difference]: Without dead ends: 55506 [2019-12-27 21:45:02,472 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 21:45:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55506 states. [2019-12-27 21:45:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55506 to 50378. [2019-12-27 21:45:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50378 states. [2019-12-27 21:45:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50378 states to 50378 states and 209880 transitions. [2019-12-27 21:45:04,774 INFO L78 Accepts]: Start accepts. Automaton has 50378 states and 209880 transitions. Word has length 15 [2019-12-27 21:45:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:04,775 INFO L462 AbstractCegarLoop]: Abstraction has 50378 states and 209880 transitions. [2019-12-27 21:45:04,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:45:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 50378 states and 209880 transitions. [2019-12-27 21:45:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:45:04,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:04,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:04,778 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1993549202, now seen corresponding path program 1 times [2019-12-27 21:45:04,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:04,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147916364] [2019-12-27 21:45:04,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:04,871 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 21:45:04,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147916364] [2019-12-27 21:45:04,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:04,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:04,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [610804099] [2019-12-27 21:45:04,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:04,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:04,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:45:04,880 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:04,881 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:04,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:04,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:04,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:04,883 INFO L87 Difference]: Start difference. First operand 50378 states and 209880 transitions. Second operand 3 states. [2019-12-27 21:45:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:05,060 INFO L93 Difference]: Finished difference Result 39514 states and 152165 transitions. [2019-12-27 21:45:05,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:05,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:45:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:05,307 INFO L225 Difference]: With dead ends: 39514 [2019-12-27 21:45:05,307 INFO L226 Difference]: Without dead ends: 39514 [2019-12-27 21:45:05,307 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 21:45:05,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39514 states. [2019-12-27 21:45:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39514 to 39514. [2019-12-27 21:45:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39514 states. [2019-12-27 21:45:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39514 states to 39514 states and 152165 transitions. [2019-12-27 21:45:08,591 INFO L78 Accepts]: Start accepts. Automaton has 39514 states and 152165 transitions. Word has length 15 [2019-12-27 21:45:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:08,591 INFO L462 AbstractCegarLoop]: Abstraction has 39514 states and 152165 transitions. [2019-12-27 21:45:08,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 39514 states and 152165 transitions. [2019-12-27 21:45:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:45:08,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:08,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:08,594 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1287515706, now seen corresponding path program 1 times [2019-12-27 21:45:08,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:08,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618299797] [2019-12-27 21:45:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:08,658 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 21:45:08,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618299797] [2019-12-27 21:45:08,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:08,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:45:08,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1793367351] [2019-12-27 21:45:08,659 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:08,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:08,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:45:08,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:08,664 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:08,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:45:08,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:08,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:45:08,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:45:08,665 INFO L87 Difference]: Start difference. First operand 39514 states and 152165 transitions. Second operand 4 states. [2019-12-27 21:45:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:08,738 INFO L93 Difference]: Finished difference Result 16395 states and 52415 transitions. [2019-12-27 21:45:08,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:45:08,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:45:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:08,772 INFO L225 Difference]: With dead ends: 16395 [2019-12-27 21:45:08,772 INFO L226 Difference]: Without dead ends: 16395 [2019-12-27 21:45:08,773 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 21:45:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2019-12-27 21:45:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16395. [2019-12-27 21:45:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16395 states. [2019-12-27 21:45:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 52415 transitions. [2019-12-27 21:45:09,084 INFO L78 Accepts]: Start accepts. Automaton has 16395 states and 52415 transitions. Word has length 16 [2019-12-27 21:45:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:09,084 INFO L462 AbstractCegarLoop]: Abstraction has 16395 states and 52415 transitions. [2019-12-27 21:45:09,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:45:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 16395 states and 52415 transitions. [2019-12-27 21:45:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:45:09,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:09,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:09,086 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:09,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash -100090776, now seen corresponding path program 1 times [2019-12-27 21:45:09,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:09,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184746232] [2019-12-27 21:45:09,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:09,153 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 21:45:09,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184746232] [2019-12-27 21:45:09,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:09,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:45:09,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1364358717] [2019-12-27 21:45:09,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:09,156 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:09,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:45:09,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:09,160 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:09,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:45:09,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:09,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:45:09,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:09,161 INFO L87 Difference]: Start difference. First operand 16395 states and 52415 transitions. Second operand 5 states. [2019-12-27 21:45:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:09,205 INFO L93 Difference]: Finished difference Result 2704 states and 6964 transitions. [2019-12-27 21:45:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:45:09,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 21:45:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:09,210 INFO L225 Difference]: With dead ends: 2704 [2019-12-27 21:45:09,210 INFO L226 Difference]: Without dead ends: 2704 [2019-12-27 21:45:09,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-12-27 21:45:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2019-12-27 21:45:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2019-12-27 21:45:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 6964 transitions. [2019-12-27 21:45:09,253 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 6964 transitions. Word has length 17 [2019-12-27 21:45:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:09,253 INFO L462 AbstractCegarLoop]: Abstraction has 2704 states and 6964 transitions. [2019-12-27 21:45:09,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:45:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 6964 transitions. [2019-12-27 21:45:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:45:09,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:09,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:09,258 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:09,258 INFO L82 PathProgramCache]: Analyzing trace with hash -482532130, now seen corresponding path program 1 times [2019-12-27 21:45:09,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:09,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595865651] [2019-12-27 21:45:09,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:09,370 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 21:45:09,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595865651] [2019-12-27 21:45:09,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:09,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:45:09,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306254229] [2019-12-27 21:45:09,372 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:09,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:09,408 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 21:45:09,409 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:09,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:45:09,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:45:09,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:45:09,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:45:09,439 INFO L87 Difference]: Start difference. First operand 2704 states and 6964 transitions. Second operand 7 states. [2019-12-27 21:45:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:09,495 INFO L93 Difference]: Finished difference Result 1223 states and 3488 transitions. [2019-12-27 21:45:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:45:09,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 21:45:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:09,498 INFO L225 Difference]: With dead ends: 1223 [2019-12-27 21:45:09,498 INFO L226 Difference]: Without dead ends: 1223 [2019-12-27 21:45:09,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:45:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-27 21:45:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1111. [2019-12-27 21:45:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-12-27 21:45:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3168 transitions. [2019-12-27 21:45:09,517 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3168 transitions. Word has length 29 [2019-12-27 21:45:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:09,517 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 3168 transitions. [2019-12-27 21:45:09,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:45:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3168 transitions. [2019-12-27 21:45:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:45:09,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:09,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:09,522 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:09,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1094731044, now seen corresponding path program 1 times [2019-12-27 21:45:09,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:09,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220888772] [2019-12-27 21:45:09,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:09,656 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 21:45:09,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220888772] [2019-12-27 21:45:09,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:09,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:45:09,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381372184] [2019-12-27 21:45:09,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:09,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:09,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 160 transitions. [2019-12-27 21:45:09,756 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:09,757 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:09,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:09,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:09,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:09,758 INFO L87 Difference]: Start difference. First operand 1111 states and 3168 transitions. Second operand 3 states. [2019-12-27 21:45:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:09,809 INFO L93 Difference]: Finished difference Result 1121 states and 3183 transitions. [2019-12-27 21:45:09,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:09,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:45:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:09,812 INFO L225 Difference]: With dead ends: 1121 [2019-12-27 21:45:09,812 INFO L226 Difference]: Without dead ends: 1121 [2019-12-27 21:45:10,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-12-27 21:45:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1115. [2019-12-27 21:45:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-12-27 21:45:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 3176 transitions. [2019-12-27 21:45:10,257 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 3176 transitions. Word has length 58 [2019-12-27 21:45:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:10,257 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 3176 transitions. [2019-12-27 21:45:10,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 3176 transitions. [2019-12-27 21:45:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:45:10,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:10,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:10,262 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:10,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:10,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1612657560, now seen corresponding path program 1 times [2019-12-27 21:45:10,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:10,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27105673] [2019-12-27 21:45:10,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:10,398 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 21:45:10,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27105673] [2019-12-27 21:45:10,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:10,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:45:10,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899929589] [2019-12-27 21:45:10,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:10,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:10,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 160 transitions. [2019-12-27 21:45:10,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:10,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:45:10,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:45:10,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:45:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:10,493 INFO L87 Difference]: Start difference. First operand 1115 states and 3176 transitions. Second operand 5 states. [2019-12-27 21:45:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:10,759 INFO L93 Difference]: Finished difference Result 1624 states and 4614 transitions. [2019-12-27 21:45:10,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:45:10,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:45:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:10,763 INFO L225 Difference]: With dead ends: 1624 [2019-12-27 21:45:10,763 INFO L226 Difference]: Without dead ends: 1624 [2019-12-27 21:45:10,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:45:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-27 21:45:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1211. [2019-12-27 21:45:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2019-12-27 21:45:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 3464 transitions. [2019-12-27 21:45:10,780 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 3464 transitions. Word has length 58 [2019-12-27 21:45:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:10,781 INFO L462 AbstractCegarLoop]: Abstraction has 1211 states and 3464 transitions. [2019-12-27 21:45:10,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:45:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 3464 transitions. [2019-12-27 21:45:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:45:10,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:10,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:10,785 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash 266171848, now seen corresponding path program 2 times [2019-12-27 21:45:10,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:10,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010323595] [2019-12-27 21:45:10,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:10,908 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 21:45:10,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010323595] [2019-12-27 21:45:10,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:10,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:45:10,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [196118000] [2019-12-27 21:45:10,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:10,926 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:11,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 200 transitions. [2019-12-27 21:45:11,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:11,073 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:45:11,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:45:11,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:45:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:45:11,074 INFO L87 Difference]: Start difference. First operand 1211 states and 3464 transitions. Second operand 8 states. [2019-12-27 21:45:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:11,723 INFO L93 Difference]: Finished difference Result 1722 states and 4826 transitions. [2019-12-27 21:45:11,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:45:11,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-27 21:45:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:11,728 INFO L225 Difference]: With dead ends: 1722 [2019-12-27 21:45:11,728 INFO L226 Difference]: Without dead ends: 1722 [2019-12-27 21:45:11,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:45:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-12-27 21:45:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1267. [2019-12-27 21:45:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2019-12-27 21:45:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 3556 transitions. [2019-12-27 21:45:11,745 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 3556 transitions. Word has length 58 [2019-12-27 21:45:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:11,745 INFO L462 AbstractCegarLoop]: Abstraction has 1267 states and 3556 transitions. [2019-12-27 21:45:11,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:45:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 3556 transitions. [2019-12-27 21:45:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:45:11,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:11,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:11,749 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1331651548, now seen corresponding path program 3 times [2019-12-27 21:45:11,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:11,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710975824] [2019-12-27 21:45:11,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:11,828 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 21:45:11,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710975824] [2019-12-27 21:45:11,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:11,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:11,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1236852563] [2019-12-27 21:45:11,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:11,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:11,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 225 transitions. [2019-12-27 21:45:11,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:11,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:11,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:11,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:11,966 INFO L87 Difference]: Start difference. First operand 1267 states and 3556 transitions. Second operand 3 states. [2019-12-27 21:45:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:11,978 INFO L93 Difference]: Finished difference Result 1227 states and 3416 transitions. [2019-12-27 21:45:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:11,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:45:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:11,980 INFO L225 Difference]: With dead ends: 1227 [2019-12-27 21:45:11,981 INFO L226 Difference]: Without dead ends: 1227 [2019-12-27 21:45:11,981 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 21:45:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-12-27 21:45:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1227. [2019-12-27 21:45:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-12-27 21:45:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 3416 transitions. [2019-12-27 21:45:11,995 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 3416 transitions. Word has length 58 [2019-12-27 21:45:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:11,996 INFO L462 AbstractCegarLoop]: Abstraction has 1227 states and 3416 transitions. [2019-12-27 21:45:11,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 3416 transitions. [2019-12-27 21:45:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:45:11,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:11,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:11,999 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:11,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1851041935, now seen corresponding path program 1 times [2019-12-27 21:45:12,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:12,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515775765] [2019-12-27 21:45:12,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:12,266 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 21:45:12,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515775765] [2019-12-27 21:45:12,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:12,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:45:12,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875599934] [2019-12-27 21:45:12,268 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:12,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:12,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 186 transitions. [2019-12-27 21:45:12,357 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:12,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:45:12,387 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:45:12,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:45:12,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:45:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:45:12,388 INFO L87 Difference]: Start difference. First operand 1227 states and 3416 transitions. Second operand 13 states. [2019-12-27 21:45:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:13,924 INFO L93 Difference]: Finished difference Result 3463 states and 8955 transitions. [2019-12-27 21:45:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 21:45:13,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-27 21:45:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:13,929 INFO L225 Difference]: With dead ends: 3463 [2019-12-27 21:45:13,930 INFO L226 Difference]: Without dead ends: 2351 [2019-12-27 21:45:13,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 21:45:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2019-12-27 21:45:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 1087. [2019-12-27 21:45:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-12-27 21:45:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 2945 transitions. [2019-12-27 21:45:13,957 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 2945 transitions. Word has length 59 [2019-12-27 21:45:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:13,957 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 2945 transitions. [2019-12-27 21:45:13,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:45:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 2945 transitions. [2019-12-27 21:45:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:45:13,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:13,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:13,965 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1986522287, now seen corresponding path program 2 times [2019-12-27 21:45:13,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:13,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650086504] [2019-12-27 21:45:13,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:14,079 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 21:45:14,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650086504] [2019-12-27 21:45:14,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:14,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:14,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1405721958] [2019-12-27 21:45:14,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:14,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:14,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 202 transitions. [2019-12-27 21:45:14,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:14,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:14,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:14,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:14,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:14,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:14,225 INFO L87 Difference]: Start difference. First operand 1087 states and 2945 transitions. Second operand 3 states. [2019-12-27 21:45:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:14,276 INFO L93 Difference]: Finished difference Result 1086 states and 2943 transitions. [2019-12-27 21:45:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:14,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:45:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:14,279 INFO L225 Difference]: With dead ends: 1086 [2019-12-27 21:45:14,280 INFO L226 Difference]: Without dead ends: 1086 [2019-12-27 21:45:14,280 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 21:45:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-12-27 21:45:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 797. [2019-12-27 21:45:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-27 21:45:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 2145 transitions. [2019-12-27 21:45:14,294 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 2145 transitions. Word has length 59 [2019-12-27 21:45:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:14,294 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 2145 transitions. [2019-12-27 21:45:14,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 2145 transitions. [2019-12-27 21:45:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:45:14,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:14,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:14,297 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:14,297 INFO L82 PathProgramCache]: Analyzing trace with hash 90440074, now seen corresponding path program 1 times [2019-12-27 21:45:14,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:14,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842507560] [2019-12-27 21:45:14,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:14,470 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 21:45:14,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842507560] [2019-12-27 21:45:14,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:14,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:45:14,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950812606] [2019-12-27 21:45:14,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:14,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:14,578 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 139 transitions. [2019-12-27 21:45:14,579 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:14,579 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:14,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:45:14,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:14,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:45:14,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:45:14,580 INFO L87 Difference]: Start difference. First operand 797 states and 2145 transitions. Second operand 6 states. [2019-12-27 21:45:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:14,659 INFO L93 Difference]: Finished difference Result 1360 states and 3388 transitions. [2019-12-27 21:45:14,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:45:14,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 21:45:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:14,661 INFO L225 Difference]: With dead ends: 1360 [2019-12-27 21:45:14,661 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 21:45:14,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:45:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 21:45:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 576. [2019-12-27 21:45:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 21:45:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1357 transitions. [2019-12-27 21:45:14,669 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1357 transitions. Word has length 60 [2019-12-27 21:45:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:14,669 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1357 transitions. [2019-12-27 21:45:14,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:45:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1357 transitions. [2019-12-27 21:45:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:45:14,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:14,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:14,671 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:14,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:14,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1091007918, now seen corresponding path program 2 times [2019-12-27 21:45:14,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:14,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828628596] [2019-12-27 21:45:14,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:45:14,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828628596] [2019-12-27 21:45:14,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:14,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:45:14,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1851802752] [2019-12-27 21:45:14,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:14,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:14,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 118 transitions. [2019-12-27 21:45:14,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:14,874 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:14,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:45:14,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:14,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:45:14,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:45:14,875 INFO L87 Difference]: Start difference. First operand 576 states and 1357 transitions. Second operand 6 states. [2019-12-27 21:45:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:14,953 INFO L93 Difference]: Finished difference Result 932 states and 2160 transitions. [2019-12-27 21:45:14,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:45:14,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 21:45:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:14,954 INFO L225 Difference]: With dead ends: 932 [2019-12-27 21:45:14,954 INFO L226 Difference]: Without dead ends: 246 [2019-12-27 21:45:14,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:45:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-27 21:45:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 214. [2019-12-27 21:45:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-27 21:45:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 369 transitions. [2019-12-27 21:45:14,958 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 369 transitions. Word has length 60 [2019-12-27 21:45:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:14,959 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 369 transitions. [2019-12-27 21:45:14,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:45:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 369 transitions. [2019-12-27 21:45:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:45:14,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:14,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:14,960 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:45:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1252624604, now seen corresponding path program 3 times [2019-12-27 21:45:14,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:14,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486573091] [2019-12-27 21:45:14,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:45:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:45:15,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:45:15,152 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:45:15,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= 0 v_~__unbuffered_cnt~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~z$r_buff1_thd3~0_18) (= v_~main$tmp_guard0~0_8 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1525~0.base_24| 1)) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1525~0.base_24|) 0) (= 0 v_~z$flush_delayed~0_16) (= 0 |v_ULTIMATE.start_main_~#t1525~0.offset_18|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd4~0_26 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1525~0.base_24|) (= 0 v_~z$w_buff1_used~0_67) (= v_~a~0_10 0) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~y~0_13 0) (= 0 v_~__unbuffered_p3_EAX~0_9) (= |v_#NULL.offset_5| 0) (= 0 v_~z$w_buff0~0_28) (= v_~z$mem_tmp~0_12 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1525~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1525~0.base_24|) |v_ULTIMATE.start_main_~#t1525~0.offset_18| 0)) |v_#memory_int_25|) (= v_~main$tmp_guard1~0_12 0) (= v_~z~0_29 0) (= 0 v_~z$r_buff1_thd0~0_46) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1525~0.base_24| 4)) (= 0 v_~z$w_buff1~0_26) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, ULTIMATE.start_main_~#t1527~0.offset=|v_ULTIMATE.start_main_~#t1527~0.offset_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_13|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_18|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_67, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_~#t1525~0.offset=|v_ULTIMATE.start_main_~#t1525~0.offset_18|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_~#t1526~0.base=|v_ULTIMATE.start_main_~#t1526~0.base_22|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ULTIMATE.start_main_~#t1525~0.base=|v_ULTIMATE.start_main_~#t1525~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t1526~0.offset=|v_ULTIMATE.start_main_~#t1526~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ULTIMATE.start_main_~#t1527~0.base=|v_ULTIMATE.start_main_~#t1527~0.base_20|, ULTIMATE.start_main_~#t1528~0.offset=|v_ULTIMATE.start_main_~#t1528~0.offset_17|, ~y~0=v_~y~0_13, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_28, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ULTIMATE.start_main_~#t1528~0.base=|v_ULTIMATE.start_main_~#t1528~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_9|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1527~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1525~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1526~0.base, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1525~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1526~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1527~0.base, ULTIMATE.start_main_~#t1528~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1528~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:45:15,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1526~0.offset_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1526~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1526~0.base_10|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1526~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1526~0.base_10|) |v_ULTIMATE.start_main_~#t1526~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1526~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1526~0.base_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1526~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1526~0.base=|v_ULTIMATE.start_main_~#t1526~0.base_10|, ULTIMATE.start_main_~#t1526~0.offset=|v_ULTIMATE.start_main_~#t1526~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1526~0.base, ULTIMATE.start_main_~#t1526~0.offset] because there is no mapped edge [2019-12-27 21:45:15,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1527~0.base_12| 1)) (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1527~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1527~0.base_12| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1527~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1527~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1527~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1527~0.base_12|) |v_ULTIMATE.start_main_~#t1527~0.offset_10| 2)) |v_#memory_int_17|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1527~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1527~0.offset=|v_ULTIMATE.start_main_~#t1527~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1527~0.base=|v_ULTIMATE.start_main_~#t1527~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1527~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1527~0.base, #length] because there is no mapped edge [2019-12-27 21:45:15,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L825-1-->L827: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1528~0.base_11| 4) |v_#length_19|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1528~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1528~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1528~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1528~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1528~0.base_11|) |v_ULTIMATE.start_main_~#t1528~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1528~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1528~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1528~0.base=|v_ULTIMATE.start_main_~#t1528~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ULTIMATE.start_main_~#t1528~0.offset=|v_ULTIMATE.start_main_~#t1528~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1528~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1528~0.offset] because there is no mapped edge [2019-12-27 21:45:15,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_19 v_~z$w_buff1~0_17) (= v_~z$w_buff0_used~0_86 1) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|) (= 2 v_~z$w_buff0~0_18) (= (mod v_~z$w_buff1_used~0_55 256) 0) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= v_~z$w_buff0_used~0_87 v_~z$w_buff1_used~0_55) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_19, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_18, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_55, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z$w_buff1~0=v_~z$w_buff1~0_17, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 21:45:15,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_5| v_P0Thread1of1ForFork3_~arg.offset_5) (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= 1 v_~x~0_9) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_P0Thread1of1ForFork3_~arg.base_5 |v_P0Thread1of1ForFork3_#in~arg.base_5|) (= 1 v_~a~0_8) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|} OutVars{~a~0=v_~a~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_5|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_5, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_5, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_5|, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 21:45:15,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] P1ENTRY-->P1EXIT: Formula: (and (= 2 v_~x~0_8) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= 1 v_~y~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_8, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 21:45:15,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-792491428 256) 0)) (.cse2 (= |P2Thread1of1ForFork1_#t~ite3_Out-792491428| |P2Thread1of1ForFork1_#t~ite4_Out-792491428|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-792491428 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite3_Out-792491428| ~z~0_In-792491428) (or .cse0 .cse1) .cse2) (and (not .cse1) (= ~z$w_buff1~0_In-792491428 |P2Thread1of1ForFork1_#t~ite3_Out-792491428|) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-792491428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-792491428, ~z$w_buff1~0=~z$w_buff1~0_In-792491428, ~z~0=~z~0_In-792491428} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out-792491428|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out-792491428|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-792491428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-792491428, ~z$w_buff1~0=~z$w_buff1~0_In-792491428, ~z~0=~z~0_In-792491428} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-27 21:45:15,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In495447552 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In495447552 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite5_Out495447552| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite5_Out495447552| ~z$w_buff0_used~0_In495447552) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In495447552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In495447552} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out495447552|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In495447552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In495447552} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:45:15,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1990253983 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1990253983 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1990253983 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1990253983 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite6_Out1990253983| ~z$w_buff1_used~0_In1990253983) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite6_Out1990253983| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1990253983, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1990253983, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1990253983, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1990253983} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out1990253983|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1990253983, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1990253983, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1990253983, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1990253983} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:45:15,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1920670761 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1920670761 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite7_Out1920670761| ~z$r_buff0_thd3~0_In1920670761)) (and (= 0 |P2Thread1of1ForFork1_#t~ite7_Out1920670761|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1920670761, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1920670761} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out1920670761|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1920670761, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1920670761} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 21:45:15,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In110729219 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In110729219 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In110729219 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In110729219 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite8_Out110729219|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite8_Out110729219| ~z$r_buff1_thd3~0_In110729219)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In110729219, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In110729219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In110729219, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In110729219} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In110729219, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In110729219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In110729219, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In110729219, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out110729219|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:45:15,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite8_8| v_~z$r_buff1_thd3~0_15) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_8|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:45:15,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-476566954 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-476566954 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite11_Out-476566954| ~z$w_buff0_used~0_In-476566954) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite11_Out-476566954| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-476566954, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-476566954} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-476566954, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-476566954, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out-476566954|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:45:15,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-998987123 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-998987123 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-998987123 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-998987123 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite12_Out-998987123|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-998987123 |P3Thread1of1ForFork2_#t~ite12_Out-998987123|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-998987123, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-998987123, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-998987123, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-998987123} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-998987123, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-998987123, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-998987123, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-998987123, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out-998987123|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:45:15,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1068550801 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1068550801 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-1068550801 ~z$r_buff0_thd4~0_In-1068550801)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-1068550801 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068550801, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1068550801} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1068550801, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out-1068550801|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1068550801} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 21:45:15,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In2094255727 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2094255727 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2094255727 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In2094255727 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite14_Out2094255727| 0)) (and (= |P3Thread1of1ForFork2_#t~ite14_Out2094255727| ~z$r_buff1_thd4~0_In2094255727) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2094255727, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2094255727, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2094255727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2094255727} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2094255727, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2094255727, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2094255727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2094255727, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out2094255727|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:45:15,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L802-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd4~0_15) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|)) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_7|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:45:15,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:45:15,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2104865693 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2104865693 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out2104865693| ~z~0_In2104865693)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out2104865693| ~z$w_buff1~0_In2104865693) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2104865693, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2104865693, ~z$w_buff1~0=~z$w_buff1~0_In2104865693, ~z~0=~z~0_In2104865693} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2104865693|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2104865693, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2104865693, ~z$w_buff1~0=~z$w_buff1~0_In2104865693, ~z~0=~z~0_In2104865693} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:45:15,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:45:15,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1020673082 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1020673082 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out1020673082|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out1020673082| ~z$w_buff0_used~0_In1020673082) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1020673082, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1020673082} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1020673082, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1020673082, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1020673082|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:45:15,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In2021448879 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In2021448879 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2021448879 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2021448879 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out2021448879| ~z$w_buff1_used~0_In2021448879) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out2021448879| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2021448879, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2021448879, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2021448879, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2021448879} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2021448879, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2021448879, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2021448879, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2021448879, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2021448879|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:45:15,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1807419488 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1807419488 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1807419488 |ULTIMATE.start_main_#t~ite23_Out1807419488|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1807419488|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1807419488, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1807419488} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1807419488, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1807419488, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1807419488|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:45:15,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-603440008 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-603440008 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-603440008 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-603440008 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-603440008| ~z$r_buff1_thd0~0_In-603440008) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite24_Out-603440008| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-603440008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-603440008, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-603440008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-603440008} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-603440008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-603440008, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-603440008, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-603440008|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-603440008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:45:15,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:45:15,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In706031240 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite45_Out706031240| ~z$r_buff1_thd0~0_In706031240) (= |ULTIMATE.start_main_#t~ite46_Out706031240| |ULTIMATE.start_main_#t~ite45_Out706031240|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In706031240 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In706031240 256) 0)) (= (mod ~z$w_buff0_used~0_In706031240 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In706031240 256)) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out706031240| ~z$r_buff1_thd0~0_In706031240) (= |ULTIMATE.start_main_#t~ite45_In706031240| |ULTIMATE.start_main_#t~ite45_Out706031240|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In706031240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In706031240, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In706031240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In706031240, ~weak$$choice2~0=~weak$$choice2~0_In706031240, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In706031240|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In706031240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In706031240, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In706031240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In706031240, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out706031240|, ~weak$$choice2~0=~weak$$choice2~0_In706031240, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out706031240|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:45:15,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L852-->L855-1: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= v_~z~0_24 v_~z$mem_tmp~0_7) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:45:15,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:45:15,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:45:15 BasicIcfg [2019-12-27 21:45:15,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:45:15,334 INFO L168 Benchmark]: Toolchain (without parser) took 29046.98 ms. Allocated memory was 139.5 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 103.5 MB in the beginning and 848.2 MB in the end (delta: -744.7 MB). Peak memory consumption was 409.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:15,335 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:45:15,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.42 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 103.2 MB in the beginning and 156.2 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:15,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.50 ms. Allocated memory is still 202.4 MB. Free memory was 156.2 MB in the beginning and 152.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:15,340 INFO L168 Benchmark]: Boogie Preprocessor took 41.04 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:15,341 INFO L168 Benchmark]: RCFGBuilder took 839.62 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 102.2 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:15,342 INFO L168 Benchmark]: TraceAbstraction took 27267.88 ms. Allocated memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.5 MB in the beginning and 848.2 MB in the end (delta: -746.6 MB). Peak memory consumption was 344.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:45:15,350 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.42 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 103.2 MB in the beginning and 156.2 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.50 ms. Allocated memory is still 202.4 MB. Free memory was 156.2 MB in the beginning and 152.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.04 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.62 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 102.2 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27267.88 ms. Allocated memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.5 MB in the beginning and 848.2 MB in the end (delta: -746.6 MB). Peak memory consumption was 344.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 206 TransitionsBefore, 102 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 161 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 58917 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L845] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L847] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L848] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1609 SDtfs, 1745 SDslu, 3602 SDs, 0 SdLazy, 1851 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50378occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 7861 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 95155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...