/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:51:13,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:51:13,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:51:13,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:51:13,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:51:13,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:51:13,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:51:13,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:51:13,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:51:13,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:51:13,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:51:13,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:51:13,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:51:13,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:51:13,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:51:13,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:51:13,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:51:13,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:51:13,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:51:13,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:51:13,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:51:13,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:51:13,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:51:13,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:51:13,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:51:13,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:51:13,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:51:13,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:51:13,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:51:13,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:51:13,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:51:13,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:51:13,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:51:13,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:51:13,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:51:13,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:51:13,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:51:13,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:51:13,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:51:13,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:51:14,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:51:14,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:51:14,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:51:14,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:51:14,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:51:14,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:51:14,018 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:51:14,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:51:14,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:51:14,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:51:14,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:51:14,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:51:14,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:51:14,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:51:14,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:51:14,020 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:51:14,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:51:14,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:51:14,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:51:14,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:51:14,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:51:14,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:51:14,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:51:14,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:51:14,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:51:14,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:51:14,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:51:14,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:51:14,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:51:14,023 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:51:14,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:51:14,023 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:51:14,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:51:14,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:51:14,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:51:14,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:51:14,371 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:51:14,371 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:51:14,372 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_rmo.oepc.i [2019-12-27 18:51:14,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bb98983/f62f28be90cf44ea870bf314c362d862/FLAG755d1eb91 [2019-12-27 18:51:14,951 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:51:14,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_rmo.oepc.i [2019-12-27 18:51:14,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bb98983/f62f28be90cf44ea870bf314c362d862/FLAG755d1eb91 [2019-12-27 18:51:15,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68bb98983/f62f28be90cf44ea870bf314c362d862 [2019-12-27 18:51:15,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:51:15,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:51:15,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:51:15,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:51:15,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:51:15,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:51:15" (1/1) ... [2019-12-27 18:51:15,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:15, skipping insertion in model container [2019-12-27 18:51:15,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:51:15" (1/1) ... [2019-12-27 18:51:15,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:51:15,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:51:15,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:51:16,013 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:51:16,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:51:16,195 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:51:16,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16 WrapperNode [2019-12-27 18:51:16,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:51:16,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:51:16,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:51:16,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:51:16,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:51:16,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:51:16,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:51:16,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:51:16,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (1/1) ... [2019-12-27 18:51:16,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:51:16,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:51:16,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:51:16,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:51:16,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (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 18:51:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:51:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:51:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:51:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:51:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:51:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:51:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:51:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:51:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:51:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:51:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:51:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:51:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:51:16,384 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 18:51:17,065 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:51:17,066 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:51:17,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:51:17 BoogieIcfgContainer [2019-12-27 18:51:17,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:51:17,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:51:17,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:51:17,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:51:17,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:51:15" (1/3) ... [2019-12-27 18:51:17,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f972224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:51:17, skipping insertion in model container [2019-12-27 18:51:17,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:16" (2/3) ... [2019-12-27 18:51:17,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f972224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:51:17, skipping insertion in model container [2019-12-27 18:51:17,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:51:17" (3/3) ... [2019-12-27 18:51:17,077 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_rmo.oepc.i [2019-12-27 18:51:17,088 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:51:17,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:51:17,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:51:17,098 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:51:17,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,178 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,178 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,179 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,179 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,179 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,197 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,203 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,204 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,204 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:51:17,224 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:51:17,248 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:51:17,248 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:51:17,248 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:51:17,248 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:51:17,249 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:51:17,249 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:51:17,249 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:51:17,249 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:51:17,267 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-27 18:51:17,269 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 18:51:17,359 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 18:51:17,360 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:51:17,374 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 18:51:17,395 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 18:51:17,441 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 18:51:17,441 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:51:17,447 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 18:51:17,461 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 18:51:17,462 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:51:22,206 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:51:22,330 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:51:22,531 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-27 18:51:22,531 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 18:51:22,535 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-27 18:51:23,443 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-27 18:51:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-27 18:51:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 18:51:23,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:23,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:51:23,453 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:23,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:23,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-27 18:51:23,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:23,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40884622] [2019-12-27 18:51:23,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:23,743 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 18:51:23,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40884622] [2019-12-27 18:51:23,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:23,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:51:23,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [434999227] [2019-12-27 18:51:23,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:23,750 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:23,765 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 18:51:23,765 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:23,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:51:23,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:51:23,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:51:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:51:23,854 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-27 18:51:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:24,178 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-27 18:51:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:51:24,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 18:51:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:24,414 INFO L225 Difference]: With dead ends: 13722 [2019-12-27 18:51:24,416 INFO L226 Difference]: Without dead ends: 12214 [2019-12-27 18:51:24,418 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 18:51:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-27 18:51:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-27 18:51:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-27 18:51:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-27 18:51:25,236 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-27 18:51:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:25,237 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-27 18:51:25,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:51:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-27 18:51:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:51:25,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:25,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:51:25,250 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-27 18:51:25,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:25,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4988774] [2019-12-27 18:51:25,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:25,418 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 18:51:25,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4988774] [2019-12-27 18:51:25,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:25,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:51:25,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1501596211] [2019-12-27 18:51:25,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:25,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:25,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:51:25,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:25,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:51:25,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:51:25,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:25,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:51:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:51:25,431 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-27 18:51:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:26,009 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-12-27 18:51:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:51:26,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:51:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:26,110 INFO L225 Difference]: With dead ends: 18446 [2019-12-27 18:51:26,110 INFO L226 Difference]: Without dead ends: 18390 [2019-12-27 18:51:26,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:51:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-12-27 18:51:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-12-27 18:51:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-27 18:51:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-12-27 18:51:27,859 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-12-27 18:51:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:27,859 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-12-27 18:51:27,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:51:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-12-27 18:51:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 18:51:27,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:27,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:51:27,865 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-27 18:51:27,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:27,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318150699] [2019-12-27 18:51:27,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:28,011 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 18:51:28,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318150699] [2019-12-27 18:51:28,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:28,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:51:28,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729311950] [2019-12-27 18:51:28,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:28,017 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:28,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 18:51:28,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:28,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:51:28,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:51:28,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:51:28,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:51:28,097 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 7 states. [2019-12-27 18:51:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:28,643 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-12-27 18:51:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:51:28,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 18:51:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:28,750 INFO L225 Difference]: With dead ends: 24000 [2019-12-27 18:51:28,751 INFO L226 Difference]: Without dead ends: 23924 [2019-12-27 18:51:28,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:51:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-27 18:51:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-12-27 18:51:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-12-27 18:51:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-12-27 18:51:29,646 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-12-27 18:51:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:29,647 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-12-27 18:51:29,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:51:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-12-27 18:51:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:51:29,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:29,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:51:29,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:29,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:29,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-12-27 18:51:29,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:29,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304895935] [2019-12-27 18:51:29,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:30,416 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 18:51:30,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304895935] [2019-12-27 18:51:30,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:30,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:51:30,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732642196] [2019-12-27 18:51:30,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:30,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:30,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 18:51:30,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:30,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:51:30,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:51:30,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:51:30,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:51:30,426 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-12-27 18:51:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:30,523 INFO L93 Difference]: Finished difference Result 20167 states and 74853 transitions. [2019-12-27 18:51:30,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:51:30,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:51:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:30,645 INFO L225 Difference]: With dead ends: 20167 [2019-12-27 18:51:30,645 INFO L226 Difference]: Without dead ends: 20167 [2019-12-27 18:51:30,646 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 18:51:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20167 states. [2019-12-27 18:51:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20167 to 20167. [2019-12-27 18:51:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20167 states. [2019-12-27 18:51:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20167 states to 20167 states and 74853 transitions. [2019-12-27 18:51:31,543 INFO L78 Accepts]: Start accepts. Automaton has 20167 states and 74853 transitions. Word has length 18 [2019-12-27 18:51:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:31,544 INFO L462 AbstractCegarLoop]: Abstraction has 20167 states and 74853 transitions. [2019-12-27 18:51:31,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:51:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 20167 states and 74853 transitions. [2019-12-27 18:51:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:51:31,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:31,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:51:31,559 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash -292292173, now seen corresponding path program 1 times [2019-12-27 18:51:31,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:31,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158731577] [2019-12-27 18:51:31,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:31,651 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 18:51:31,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158731577] [2019-12-27 18:51:31,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:31,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:51:31,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [646069425] [2019-12-27 18:51:31,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:31,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:31,660 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:51:31,661 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:31,661 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:51:31,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:51:31,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:31,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:51:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:51:31,663 INFO L87 Difference]: Start difference. First operand 20167 states and 74853 transitions. Second operand 3 states. [2019-12-27 18:51:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:31,796 INFO L93 Difference]: Finished difference Result 19155 states and 70209 transitions. [2019-12-27 18:51:31,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:51:31,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 18:51:31,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:31,856 INFO L225 Difference]: With dead ends: 19155 [2019-12-27 18:51:31,856 INFO L226 Difference]: Without dead ends: 19155 [2019-12-27 18:51:31,856 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 18:51:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19155 states. [2019-12-27 18:51:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19155 to 18891. [2019-12-27 18:51:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18891 states. [2019-12-27 18:51:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18891 states to 18891 states and 69309 transitions. [2019-12-27 18:51:32,609 INFO L78 Accepts]: Start accepts. Automaton has 18891 states and 69309 transitions. Word has length 19 [2019-12-27 18:51:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:32,609 INFO L462 AbstractCegarLoop]: Abstraction has 18891 states and 69309 transitions. [2019-12-27 18:51:32,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:51:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 18891 states and 69309 transitions. [2019-12-27 18:51:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:51:32,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:32,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:51:32,618 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-12-27 18:51:32,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:32,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669859488] [2019-12-27 18:51:32,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:32,694 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 18:51:32,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669859488] [2019-12-27 18:51:32,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:32,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:51:32,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1752132608] [2019-12-27 18:51:32,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:32,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:32,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 27 transitions. [2019-12-27 18:51:32,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:32,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:51:32,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:51:32,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:32,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:51:32,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:51:32,702 INFO L87 Difference]: Start difference. First operand 18891 states and 69309 transitions. Second operand 5 states. [2019-12-27 18:51:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:32,771 INFO L93 Difference]: Finished difference Result 3080 states and 9315 transitions. [2019-12-27 18:51:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:51:32,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:51:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:32,776 INFO L225 Difference]: With dead ends: 3080 [2019-12-27 18:51:32,776 INFO L226 Difference]: Without dead ends: 2014 [2019-12-27 18:51:32,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:51:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-12-27 18:51:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2019-12-27 18:51:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 18:51:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5324 transitions. [2019-12-27 18:51:32,814 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 5324 transitions. Word has length 19 [2019-12-27 18:51:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:32,814 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 5324 transitions. [2019-12-27 18:51:32,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:51:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 5324 transitions. [2019-12-27 18:51:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:51:32,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:32,818 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 18:51:32,818 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:32,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-27 18:51:32,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:32,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463702406] [2019-12-27 18:51:32,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:32,863 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 18:51:32,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463702406] [2019-12-27 18:51:32,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:32,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:51:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5615354] [2019-12-27 18:51:32,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:32,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:32,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 18:51:32,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:32,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:51:32,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:51:32,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:32,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:51:32,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:51:32,922 INFO L87 Difference]: Start difference. First operand 2014 states and 5324 transitions. Second operand 5 states. [2019-12-27 18:51:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:33,002 INFO L93 Difference]: Finished difference Result 2850 states and 7274 transitions. [2019-12-27 18:51:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:51:33,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 18:51:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:33,007 INFO L225 Difference]: With dead ends: 2850 [2019-12-27 18:51:33,007 INFO L226 Difference]: Without dead ends: 2850 [2019-12-27 18:51:33,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:51:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-12-27 18:51:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2110. [2019-12-27 18:51:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-12-27 18:51:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 5466 transitions. [2019-12-27 18:51:33,070 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 5466 transitions. Word has length 29 [2019-12-27 18:51:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:33,071 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 5466 transitions. [2019-12-27 18:51:33,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:51:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 5466 transitions. [2019-12-27 18:51:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:51:33,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:33,075 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 18:51:33,075 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:33,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:33,076 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-27 18:51:33,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:33,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236934123] [2019-12-27 18:51:33,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:33,191 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 18:51:33,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236934123] [2019-12-27 18:51:33,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:33,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:51:33,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [158171590] [2019-12-27 18:51:33,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:33,198 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:33,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 18:51:33,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:33,271 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:51:33,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:51:33,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:33,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:51:33,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:51:33,273 INFO L87 Difference]: Start difference. First operand 2110 states and 5466 transitions. Second operand 8 states. [2019-12-27 18:51:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:33,742 INFO L93 Difference]: Finished difference Result 3354 states and 8440 transitions. [2019-12-27 18:51:33,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:51:33,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 18:51:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:33,747 INFO L225 Difference]: With dead ends: 3354 [2019-12-27 18:51:33,747 INFO L226 Difference]: Without dead ends: 3346 [2019-12-27 18:51:33,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:51:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-27 18:51:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2160. [2019-12-27 18:51:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-12-27 18:51:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5592 transitions. [2019-12-27 18:51:33,788 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5592 transitions. Word has length 29 [2019-12-27 18:51:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:33,789 INFO L462 AbstractCegarLoop]: Abstraction has 2160 states and 5592 transitions. [2019-12-27 18:51:33,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:51:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5592 transitions. [2019-12-27 18:51:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:51:33,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:33,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:51:33,793 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash 804701306, now seen corresponding path program 1 times [2019-12-27 18:51:33,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:33,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305203435] [2019-12-27 18:51:33,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:33,833 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 18:51:33,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305203435] [2019-12-27 18:51:33,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:33,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:51:33,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1830510573] [2019-12-27 18:51:33,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:33,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:33,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 49 transitions. [2019-12-27 18:51:33,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:33,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:51:33,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:51:33,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:33,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:51:33,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:51:33,852 INFO L87 Difference]: Start difference. First operand 2160 states and 5592 transitions. Second operand 3 states. [2019-12-27 18:51:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:33,872 INFO L93 Difference]: Finished difference Result 3414 states and 8503 transitions. [2019-12-27 18:51:33,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:51:33,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 18:51:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:33,876 INFO L225 Difference]: With dead ends: 3414 [2019-12-27 18:51:33,877 INFO L226 Difference]: Without dead ends: 2182 [2019-12-27 18:51:33,877 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 18:51:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-12-27 18:51:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2154. [2019-12-27 18:51:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-12-27 18:51:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 5480 transitions. [2019-12-27 18:51:33,912 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 5480 transitions. Word has length 30 [2019-12-27 18:51:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:33,913 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 5480 transitions. [2019-12-27 18:51:33,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:51:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 5480 transitions. [2019-12-27 18:51:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:51:33,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:33,916 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] [2019-12-27 18:51:33,916 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1852558596, now seen corresponding path program 2 times [2019-12-27 18:51:33,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:33,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125460455] [2019-12-27 18:51:33,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:51:33,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125460455] [2019-12-27 18:51:33,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:33,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:51:33,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [703148786] [2019-12-27 18:51:33,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:33,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:34,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 57 transitions. [2019-12-27 18:51:34,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:34,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:51:34,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:51:34,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:51:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:51:34,029 INFO L87 Difference]: Start difference. First operand 2154 states and 5480 transitions. Second operand 7 states. [2019-12-27 18:51:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:34,218 INFO L93 Difference]: Finished difference Result 1372 states and 3607 transitions. [2019-12-27 18:51:34,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:51:34,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-27 18:51:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:34,221 INFO L225 Difference]: With dead ends: 1372 [2019-12-27 18:51:34,221 INFO L226 Difference]: Without dead ends: 1154 [2019-12-27 18:51:34,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:51:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-12-27 18:51:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1142. [2019-12-27 18:51:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-12-27 18:51:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 3029 transitions. [2019-12-27 18:51:34,238 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 3029 transitions. Word has length 30 [2019-12-27 18:51:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:34,238 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 3029 transitions. [2019-12-27 18:51:34,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:51:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 3029 transitions. [2019-12-27 18:51:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 18:51:34,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:34,241 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] [2019-12-27 18:51:34,242 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash 909005426, now seen corresponding path program 1 times [2019-12-27 18:51:34,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:34,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636645288] [2019-12-27 18:51:34,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:34,287 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 18:51:34,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636645288] [2019-12-27 18:51:34,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:34,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:51:34,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [12411837] [2019-12-27 18:51:34,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:34,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:34,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 121 transitions. [2019-12-27 18:51:34,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:34,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:51:34,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:51:34,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:51:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:51:34,350 INFO L87 Difference]: Start difference. First operand 1142 states and 3029 transitions. Second operand 3 states. [2019-12-27 18:51:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:34,381 INFO L93 Difference]: Finished difference Result 1340 states and 3414 transitions. [2019-12-27 18:51:34,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:51:34,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-27 18:51:34,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:34,384 INFO L225 Difference]: With dead ends: 1340 [2019-12-27 18:51:34,384 INFO L226 Difference]: Without dead ends: 1340 [2019-12-27 18:51:34,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 18:51:34,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-12-27 18:51:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1192. [2019-12-27 18:51:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-27 18:51:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3078 transitions. [2019-12-27 18:51:34,400 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3078 transitions. Word has length 45 [2019-12-27 18:51:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:34,400 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 3078 transitions. [2019-12-27 18:51:34,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:51:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3078 transitions. [2019-12-27 18:51:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 18:51:34,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:34,403 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] [2019-12-27 18:51:34,403 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:34,403 INFO L82 PathProgramCache]: Analyzing trace with hash -928078620, now seen corresponding path program 1 times [2019-12-27 18:51:34,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:34,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254844550] [2019-12-27 18:51:34,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:51:34,489 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 18:51:34,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254844550] [2019-12-27 18:51:34,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:51:34,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:51:34,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417569637] [2019-12-27 18:51:34,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:51:34,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:51:34,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 123 transitions. [2019-12-27 18:51:34,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:51:34,552 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:51:34,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:51:34,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:51:34,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:51:34,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:51:34,553 INFO L87 Difference]: Start difference. First operand 1192 states and 3078 transitions. Second operand 7 states. [2019-12-27 18:51:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:51:34,793 INFO L93 Difference]: Finished difference Result 3208 states and 8220 transitions. [2019-12-27 18:51:34,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:51:34,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 18:51:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:51:34,797 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 18:51:34,797 INFO L226 Difference]: Without dead ends: 2140 [2019-12-27 18:51:34,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:51:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-27 18:51:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1336. [2019-12-27 18:51:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-27 18:51:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3428 transitions. [2019-12-27 18:51:34,841 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3428 transitions. Word has length 45 [2019-12-27 18:51:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:51:34,841 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3428 transitions. [2019-12-27 18:51:34,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:51:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3428 transitions. [2019-12-27 18:51:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 18:51:34,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:51:34,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:51:34,845 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:51:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:51:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 2 times [2019-12-27 18:51:34,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:51:34,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455280721] [2019-12-27 18:51:34,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:51:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:51:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:51:34,940 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:51:34,940 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:51:34,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2589~0.offset_22|) (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31|) |v_ULTIMATE.start_main_~#t2589~0.offset_22| 0))) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31|)) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2589~0.base_31| 4)) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2589~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31| 1) |v_#valid_66|) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2589~0.base=|v_ULTIMATE.start_main_~#t2589~0.base_31|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_31|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_23|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2589~0.offset=|v_ULTIMATE.start_main_~#t2589~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2591~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2589~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2589~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2591~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2590~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:51:34,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2590~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2590~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2590~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2590~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10|) |v_ULTIMATE.start_main_~#t2590~0.offset_9| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2590~0.base] because there is no mapped edge [2019-12-27 18:51:34,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2591~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11|) |v_ULTIMATE.start_main_~#t2591~0.offset_10| 2))) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2591~0.offset_10| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2591~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2591~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2591~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2591~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 18:51:34,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= 0 (mod v_~y$w_buff1_used~0_71 256)) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_16) (= v_P2Thread1of1ForFork2_~arg.offset_16 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| 1) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_16, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_16, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:51:34,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_10 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_10 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_10, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_10} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 18:51:34,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1916213607 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1916213607| |P1Thread1of1ForFork1_#t~ite8_Out-1916213607|) (= ~y$w_buff0~0_In-1916213607 |P1Thread1of1ForFork1_#t~ite8_Out-1916213607|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1916213607 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1916213607 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1916213607 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1916213607 256)))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-1916213607| |P1Thread1of1ForFork1_#t~ite8_Out-1916213607|) (= ~y$w_buff0~0_In-1916213607 |P1Thread1of1ForFork1_#t~ite9_Out-1916213607|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1916213607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916213607, ~y$w_buff0~0=~y$w_buff0~0_In-1916213607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1916213607, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-1916213607|, ~weak$$choice2~0=~weak$$choice2~0_In-1916213607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1916213607} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1916213607, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916213607, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1916213607|, ~y$w_buff0~0=~y$w_buff0~0_In-1916213607, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1916213607, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-1916213607|, ~weak$$choice2~0=~weak$$choice2~0_In-1916213607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1916213607} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 18:51:34,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In721688455 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In721688455| |P1Thread1of1ForFork1_#t~ite14_Out721688455|) (= |P1Thread1of1ForFork1_#t~ite15_Out721688455| ~y$w_buff0_used~0_In721688455) (not .cse0)) (and (= ~y$w_buff0_used~0_In721688455 |P1Thread1of1ForFork1_#t~ite14_Out721688455|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In721688455 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In721688455 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In721688455 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In721688455 256))))) (= |P1Thread1of1ForFork1_#t~ite15_Out721688455| |P1Thread1of1ForFork1_#t~ite14_Out721688455|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In721688455, ~y$w_buff0_used~0=~y$w_buff0_used~0_In721688455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In721688455, ~weak$$choice2~0=~weak$$choice2~0_In721688455, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In721688455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In721688455} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In721688455, ~y$w_buff0_used~0=~y$w_buff0_used~0_In721688455, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In721688455, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out721688455|, ~weak$$choice2~0=~weak$$choice2~0_In721688455, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out721688455|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In721688455} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:51:34,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_16|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 18:51:34,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1672643886 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1672643886 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out1672643886|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1672643886 |P2Thread1of1ForFork2_#t~ite28_Out1672643886|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1672643886, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1672643886} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1672643886, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1672643886, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1672643886|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 18:51:34,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 18:51:34,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In1086671793 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1086671793 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1086671793 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1086671793 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1086671793|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1086671793 |P2Thread1of1ForFork2_#t~ite29_Out1086671793|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1086671793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1086671793, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1086671793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1086671793} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1086671793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1086671793, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1086671793, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1086671793|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1086671793} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 18:51:34,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-65909122 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-65909122 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-65909122) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-65909122 ~y$r_buff0_thd3~0_Out-65909122)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-65909122, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-65909122} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-65909122, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-65909122|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-65909122} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 18:51:34,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In782869223 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In782869223 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In782869223 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In782869223 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out782869223|)) (and (= ~y$r_buff1_thd3~0_In782869223 |P2Thread1of1ForFork2_#t~ite31_Out782869223|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In782869223, ~y$w_buff0_used~0=~y$w_buff0_used~0_In782869223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In782869223, ~y$w_buff1_used~0=~y$w_buff1_used~0_In782869223} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In782869223, ~y$w_buff0_used~0=~y$w_buff0_used~0_In782869223, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out782869223|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In782869223, ~y$w_buff1_used~0=~y$w_buff1_used~0_In782869223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 18:51:34,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_38| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_37|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:51:34,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:51:34,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1183453860 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1183453860 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-1183453860 |ULTIMATE.start_main_#t~ite35_Out-1183453860|)) (and (= ~y$w_buff1~0_In-1183453860 |ULTIMATE.start_main_#t~ite35_Out-1183453860|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1183453860, ~y~0=~y~0_In-1183453860, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1183453860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1183453860} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1183453860, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1183453860|, ~y~0=~y~0_In-1183453860, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1183453860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1183453860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 18:51:34,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 18:51:34,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In749460834 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In749460834 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out749460834|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In749460834 |ULTIMATE.start_main_#t~ite37_Out749460834|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In749460834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In749460834} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In749460834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In749460834, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out749460834|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 18:51:34,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1303104891 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1303104891 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1303104891 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1303104891 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1303104891| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite38_Out-1303104891| ~y$w_buff1_used~0_In-1303104891)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1303104891, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1303104891, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1303104891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1303104891} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1303104891, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1303104891, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1303104891|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1303104891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1303104891} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 18:51:34,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In876712897 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In876712897 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out876712897|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In876712897 |ULTIMATE.start_main_#t~ite39_Out876712897|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In876712897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In876712897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In876712897, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out876712897|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In876712897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 18:51:34,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In181527277 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In181527277 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In181527277 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In181527277 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out181527277|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite40_Out181527277| ~y$r_buff1_thd0~0_In181527277) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In181527277, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In181527277, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In181527277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In181527277} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out181527277|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In181527277, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In181527277, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In181527277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In181527277} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 18:51:34,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:51:35,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:51:35 BasicIcfg [2019-12-27 18:51:35,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:51:35,053 INFO L168 Benchmark]: Toolchain (without parser) took 19765.83 ms. Allocated memory was 147.8 MB in the beginning and 865.6 MB in the end (delta: 717.8 MB). Free memory was 104.0 MB in the beginning and 690.7 MB in the end (delta: -586.7 MB). Peak memory consumption was 131.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:51:35,054 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 123.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 18:51:35,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 908.02 ms. Allocated memory was 147.8 MB in the beginning and 206.0 MB in the end (delta: 58.2 MB). Free memory was 103.6 MB in the beginning and 158.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:51:35,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.62 ms. Allocated memory is still 206.0 MB. Free memory was 158.3 MB in the beginning and 155.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:51:35,056 INFO L168 Benchmark]: Boogie Preprocessor took 36.04 ms. Allocated memory is still 206.0 MB. Free memory was 155.7 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:51:35,057 INFO L168 Benchmark]: RCFGBuilder took 761.82 ms. Allocated memory is still 206.0 MB. Free memory was 153.7 MB in the beginning and 110.4 MB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:51:35,057 INFO L168 Benchmark]: TraceAbstraction took 17982.41 ms. Allocated memory was 206.0 MB in the beginning and 865.6 MB in the end (delta: 659.6 MB). Free memory was 109.7 MB in the beginning and 690.7 MB in the end (delta: -581.0 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:51:35,062 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.18 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 123.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 908.02 ms. Allocated memory was 147.8 MB in the beginning and 206.0 MB in the end (delta: 58.2 MB). Free memory was 103.6 MB in the beginning and 158.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.62 ms. Allocated memory is still 206.0 MB. Free memory was 158.3 MB in the beginning and 155.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.04 ms. Allocated memory is still 206.0 MB. Free memory was 155.7 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.82 ms. Allocated memory is still 206.0 MB. Free memory was 153.7 MB in the beginning and 110.4 MB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17982.41 ms. Allocated memory was 206.0 MB in the beginning and 865.6 MB in the end (delta: 659.6 MB). Free memory was 109.7 MB in the beginning and 690.7 MB in the end (delta: -581.0 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2591, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1327 SDtfs, 1551 SDslu, 2592 SDs, 0 SdLazy, 1012 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20292occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 8494 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 23716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...