/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:18:14,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:18:14,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:18:14,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:18:14,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:18:14,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:18:14,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:18:14,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:18:14,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:18:14,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:18:14,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:18:14,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:18:14,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:18:14,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:18:14,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:18:14,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:18:14,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:18:14,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:18:14,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:18:14,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:18:14,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:18:14,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:18:14,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:18:14,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:18:14,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:18:14,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:18:14,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:18:14,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:18:14,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:18:14,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:18:14,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:18:14,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:18:14,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:18:14,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:18:14,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:18:14,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:18:14,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:18:14,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:18:14,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:18:14,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:18:14,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:18:14,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:18:14,282 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:18:14,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:18:14,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:18:14,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:18:14,284 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:18:14,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:18:14,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:18:14,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:18:14,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:18:14,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:18:14,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:18:14,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:18:14,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:18:14,286 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:18:14,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:18:14,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:18:14,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:18:14,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:18:14,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:18:14,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:18:14,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:18:14,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:18:14,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:18:14,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:18:14,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:18:14,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:18:14,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:18:14,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:18:14,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:18:14,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:18:14,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:18:14,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:18:14,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:18:14,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:18:14,632 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:18:14,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i [2019-12-27 06:18:14,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046d2a091/e8444a9bf55b49d3b2dd70e02ceaf818/FLAGa263bf1ec [2019-12-27 06:18:15,234 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:18:15,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i [2019-12-27 06:18:15,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046d2a091/e8444a9bf55b49d3b2dd70e02ceaf818/FLAGa263bf1ec [2019-12-27 06:18:15,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046d2a091/e8444a9bf55b49d3b2dd70e02ceaf818 [2019-12-27 06:18:15,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:18:15,544 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:18:15,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:18:15,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:18:15,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:18:15,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:18:15" (1/1) ... [2019-12-27 06:18:15,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4981dbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:15, skipping insertion in model container [2019-12-27 06:18:15,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:18:15" (1/1) ... [2019-12-27 06:18:15,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:18:15,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:18:16,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:18:16,199 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:18:16,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:18:16,354 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:18:16,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16 WrapperNode [2019-12-27 06:18:16,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:18:16,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:18:16,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:18:16,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:18:16,364 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:18:16" (1/1) ... [2019-12-27 06:18:16,385 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:18:16" (1/1) ... [2019-12-27 06:18:16,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:18:16,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:18:16,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:18:16,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:18:16,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16" (1/1) ... [2019-12-27 06:18:16,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16" (1/1) ... [2019-12-27 06:18:16,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16" (1/1) ... [2019-12-27 06:18:16,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16" (1/1) ... [2019-12-27 06:18:16,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16" (1/1) ... [2019-12-27 06:18:16,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16" (1/1) ... [2019-12-27 06:18:16,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16" (1/1) ... [2019-12-27 06:18:16,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:18:16,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:18:16,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:18:16,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:18:16,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18: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 06:18:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:18:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:18:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:18:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:18:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:18:16,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:18:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:18:16,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:18:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:18:16,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:18:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:18:16,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:18:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:18:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:18:16,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:18:16,538 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 06:18:17,265 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:18:17,265 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:18:17,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:18:17 BoogieIcfgContainer [2019-12-27 06:18:17,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:18:17,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:18:17,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:18:17,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:18:17,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:18:15" (1/3) ... [2019-12-27 06:18:17,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a2239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:18:17, skipping insertion in model container [2019-12-27 06:18:17,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:18:16" (2/3) ... [2019-12-27 06:18:17,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a2239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:18:17, skipping insertion in model container [2019-12-27 06:18:17,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:18:17" (3/3) ... [2019-12-27 06:18:17,276 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt.i [2019-12-27 06:18:17,287 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:18:17,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:18:17,296 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:18:17,297 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:18:17,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,379 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,379 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,380 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,380 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,380 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,380 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,381 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,381 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,381 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,381 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,382 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,383 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,384 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,385 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,413 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,415 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,422 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,423 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,424 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,426 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:18:17,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:18:17,456 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:18:17,456 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:18:17,456 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:18:17,456 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:18:17,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:18:17,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:18:17,457 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:18:17,457 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:18:17,474 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-27 06:18:17,476 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-27 06:18:17,572 INFO L132 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-27 06:18:17,573 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:18:17,590 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:18:17,612 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-27 06:18:17,663 INFO L132 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-27 06:18:17,663 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:18:17,670 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:18:17,686 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 06:18:17,688 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:18:21,129 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-27 06:18:21,339 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 06:18:21,448 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 06:18:21,793 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-27 06:18:21,953 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-27 06:18:21,974 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-27 06:18:21,975 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 06:18:21,978 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 88 transitions [2019-12-27 06:18:23,685 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 28162 states. [2019-12-27 06:18:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 28162 states. [2019-12-27 06:18:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:18:23,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:23,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:23,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1869145816, now seen corresponding path program 1 times [2019-12-27 06:18:23,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:23,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030210491] [2019-12-27 06:18:23,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:23,986 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 06:18:23,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030210491] [2019-12-27 06:18:23,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:23,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:18:23,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891195065] [2019-12-27 06:18:23,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:23,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:24,012 INFO L87 Difference]: Start difference. First operand 28162 states. Second operand 3 states. [2019-12-27 06:18:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:25,214 INFO L93 Difference]: Finished difference Result 27042 states and 118144 transitions. [2019-12-27 06:18:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:25,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:18:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:25,427 INFO L225 Difference]: With dead ends: 27042 [2019-12-27 06:18:25,428 INFO L226 Difference]: Without dead ends: 25430 [2019-12-27 06:18:25,429 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 06:18:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25430 states. [2019-12-27 06:18:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25430 to 25430. [2019-12-27 06:18:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25430 states. [2019-12-27 06:18:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25430 states to 25430 states and 110948 transitions. [2019-12-27 06:18:27,952 INFO L78 Accepts]: Start accepts. Automaton has 25430 states and 110948 transitions. Word has length 9 [2019-12-27 06:18:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:27,953 INFO L462 AbstractCegarLoop]: Abstraction has 25430 states and 110948 transitions. [2019-12-27 06:18:27,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 25430 states and 110948 transitions. [2019-12-27 06:18:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:18:27,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:27,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:27,969 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:27,970 INFO L82 PathProgramCache]: Analyzing trace with hash 508644198, now seen corresponding path program 1 times [2019-12-27 06:18:27,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:27,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770294592] [2019-12-27 06:18:27,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:28,068 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 06:18:28,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770294592] [2019-12-27 06:18:28,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:28,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:18:28,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442161794] [2019-12-27 06:18:28,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:28,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:28,072 INFO L87 Difference]: Start difference. First operand 25430 states and 110948 transitions. Second operand 3 states. [2019-12-27 06:18:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:28,315 INFO L93 Difference]: Finished difference Result 20327 states and 82470 transitions. [2019-12-27 06:18:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:28,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:18:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:28,421 INFO L225 Difference]: With dead ends: 20327 [2019-12-27 06:18:28,421 INFO L226 Difference]: Without dead ends: 20327 [2019-12-27 06:18:28,422 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 06:18:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-27 06:18:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 20327. [2019-12-27 06:18:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20327 states. [2019-12-27 06:18:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20327 states to 20327 states and 82470 transitions. [2019-12-27 06:18:29,389 INFO L78 Accepts]: Start accepts. Automaton has 20327 states and 82470 transitions. Word has length 15 [2019-12-27 06:18:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:29,390 INFO L462 AbstractCegarLoop]: Abstraction has 20327 states and 82470 transitions. [2019-12-27 06:18:29,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20327 states and 82470 transitions. [2019-12-27 06:18:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:18:29,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:29,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:29,394 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2079616136, now seen corresponding path program 1 times [2019-12-27 06:18:29,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:29,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491827655] [2019-12-27 06:18:29,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:29,512 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 06:18:29,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491827655] [2019-12-27 06:18:29,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:29,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:29,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757285880] [2019-12-27 06:18:29,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:18:29,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:29,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:18:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:29,519 INFO L87 Difference]: Start difference. First operand 20327 states and 82470 transitions. Second operand 4 states. [2019-12-27 06:18:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:29,604 INFO L93 Difference]: Finished difference Result 9376 states and 32306 transitions. [2019-12-27 06:18:29,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:18:29,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:18:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:29,628 INFO L225 Difference]: With dead ends: 9376 [2019-12-27 06:18:29,628 INFO L226 Difference]: Without dead ends: 9376 [2019-12-27 06:18:29,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2019-12-27 06:18:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 9376. [2019-12-27 06:18:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9376 states. [2019-12-27 06:18:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 32306 transitions. [2019-12-27 06:18:29,886 INFO L78 Accepts]: Start accepts. Automaton has 9376 states and 32306 transitions. Word has length 16 [2019-12-27 06:18:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:29,887 INFO L462 AbstractCegarLoop]: Abstraction has 9376 states and 32306 transitions. [2019-12-27 06:18:29,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:18:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9376 states and 32306 transitions. [2019-12-27 06:18:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:18:29,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:29,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:29,889 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:29,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:29,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1317832872, now seen corresponding path program 1 times [2019-12-27 06:18:29,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:29,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854647155] [2019-12-27 06:18:29,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:30,194 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 06:18:30,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854647155] [2019-12-27 06:18:30,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:30,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:18:30,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086470558] [2019-12-27 06:18:30,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:18:30,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:18:30,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:18:30,196 INFO L87 Difference]: Start difference. First operand 9376 states and 32306 transitions. Second operand 5 states. [2019-12-27 06:18:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:30,257 INFO L93 Difference]: Finished difference Result 2757 states and 8603 transitions. [2019-12-27 06:18:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:18:30,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 06:18:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:30,265 INFO L225 Difference]: With dead ends: 2757 [2019-12-27 06:18:30,265 INFO L226 Difference]: Without dead ends: 2757 [2019-12-27 06:18:30,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:18:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-12-27 06:18:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2019-12-27 06:18:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-12-27 06:18:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 8603 transitions. [2019-12-27 06:18:30,333 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 8603 transitions. Word has length 17 [2019-12-27 06:18:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:30,333 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 8603 transitions. [2019-12-27 06:18:30,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:18:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 8603 transitions. [2019-12-27 06:18:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:18:30,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:30,337 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 06:18:30,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1770422545, now seen corresponding path program 1 times [2019-12-27 06:18:30,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:30,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477458486] [2019-12-27 06:18:30,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:30,409 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 06:18:30,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477458486] [2019-12-27 06:18:30,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:30,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:30,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878847694] [2019-12-27 06:18:30,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:30,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:30,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:30,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:30,411 INFO L87 Difference]: Start difference. First operand 2757 states and 8603 transitions. Second operand 3 states. [2019-12-27 06:18:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:30,474 INFO L93 Difference]: Finished difference Result 3817 states and 11533 transitions. [2019-12-27 06:18:30,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:30,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 06:18:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:30,482 INFO L225 Difference]: With dead ends: 3817 [2019-12-27 06:18:30,482 INFO L226 Difference]: Without dead ends: 3817 [2019-12-27 06:18:30,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2019-12-27 06:18:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3073. [2019-12-27 06:18:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-12-27 06:18:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 9503 transitions. [2019-12-27 06:18:30,559 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 9503 transitions. Word has length 18 [2019-12-27 06:18:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:30,559 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 9503 transitions. [2019-12-27 06:18:30,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 9503 transitions. [2019-12-27 06:18:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:18:30,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:30,562 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 06:18:30,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1770543166, now seen corresponding path program 1 times [2019-12-27 06:18:30,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:30,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640010211] [2019-12-27 06:18:30,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:30,623 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 06:18:30,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640010211] [2019-12-27 06:18:30,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:30,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:18:30,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035417696] [2019-12-27 06:18:30,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:18:30,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:18:30,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:30,626 INFO L87 Difference]: Start difference. First operand 3073 states and 9503 transitions. Second operand 4 states. [2019-12-27 06:18:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:30,801 INFO L93 Difference]: Finished difference Result 3911 states and 11810 transitions. [2019-12-27 06:18:30,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:18:30,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 06:18:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:30,809 INFO L225 Difference]: With dead ends: 3911 [2019-12-27 06:18:30,809 INFO L226 Difference]: Without dead ends: 3911 [2019-12-27 06:18:30,810 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 06:18:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2019-12-27 06:18:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3703. [2019-12-27 06:18:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3703 states. [2019-12-27 06:18:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 11360 transitions. [2019-12-27 06:18:30,890 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 11360 transitions. Word has length 18 [2019-12-27 06:18:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:30,890 INFO L462 AbstractCegarLoop]: Abstraction has 3703 states and 11360 transitions. [2019-12-27 06:18:30,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:18:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 11360 transitions. [2019-12-27 06:18:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:18:30,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:30,893 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 06:18:30,893 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:30,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:30,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1634843704, now seen corresponding path program 1 times [2019-12-27 06:18:30,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:30,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637299351] [2019-12-27 06:18:30,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:18:30,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637299351] [2019-12-27 06:18:30,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:30,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:18:30,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202172173] [2019-12-27 06:18:30,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:18:30,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:18:30,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:30,948 INFO L87 Difference]: Start difference. First operand 3703 states and 11360 transitions. Second operand 4 states. [2019-12-27 06:18:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:31,123 INFO L93 Difference]: Finished difference Result 4550 states and 13714 transitions. [2019-12-27 06:18:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:18:31,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 06:18:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:31,132 INFO L225 Difference]: With dead ends: 4550 [2019-12-27 06:18:31,133 INFO L226 Difference]: Without dead ends: 4550 [2019-12-27 06:18:31,133 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 06:18:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-12-27 06:18:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 3814. [2019-12-27 06:18:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3814 states. [2019-12-27 06:18:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 11697 transitions. [2019-12-27 06:18:31,216 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 11697 transitions. Word has length 18 [2019-12-27 06:18:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:31,216 INFO L462 AbstractCegarLoop]: Abstraction has 3814 states and 11697 transitions. [2019-12-27 06:18:31,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:18:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 11697 transitions. [2019-12-27 06:18:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:18:31,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:31,228 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] [2019-12-27 06:18:31,229 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash 736675489, now seen corresponding path program 1 times [2019-12-27 06:18:31,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:31,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437669525] [2019-12-27 06:18:31,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:31,306 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 06:18:31,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437669525] [2019-12-27 06:18:31,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:31,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:18:31,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002298643] [2019-12-27 06:18:31,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:18:31,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:18:31,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:18:31,308 INFO L87 Difference]: Start difference. First operand 3814 states and 11697 transitions. Second operand 6 states. [2019-12-27 06:18:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:31,376 INFO L93 Difference]: Finished difference Result 2862 states and 9250 transitions. [2019-12-27 06:18:31,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:18:31,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 06:18:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:31,383 INFO L225 Difference]: With dead ends: 2862 [2019-12-27 06:18:31,383 INFO L226 Difference]: Without dead ends: 2862 [2019-12-27 06:18:31,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:18:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-12-27 06:18:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2702. [2019-12-27 06:18:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2019-12-27 06:18:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 8770 transitions. [2019-12-27 06:18:31,441 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 8770 transitions. Word has length 32 [2019-12-27 06:18:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:31,441 INFO L462 AbstractCegarLoop]: Abstraction has 2702 states and 8770 transitions. [2019-12-27 06:18:31,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:18:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 8770 transitions. [2019-12-27 06:18:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:18:31,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:31,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:31,450 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1388771925, now seen corresponding path program 1 times [2019-12-27 06:18:31,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:31,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382597955] [2019-12-27 06:18:31,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:31,535 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 06:18:31,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382597955] [2019-12-27 06:18:31,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:31,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:31,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449576741] [2019-12-27 06:18:31,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:18:31,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:31,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:18:31,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:31,541 INFO L87 Difference]: Start difference. First operand 2702 states and 8770 transitions. Second operand 4 states. [2019-12-27 06:18:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:31,660 INFO L93 Difference]: Finished difference Result 3792 states and 11773 transitions. [2019-12-27 06:18:31,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:18:31,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 06:18:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:31,665 INFO L225 Difference]: With dead ends: 3792 [2019-12-27 06:18:31,665 INFO L226 Difference]: Without dead ends: 2430 [2019-12-27 06:18:31,666 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 06:18:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2019-12-27 06:18:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430. [2019-12-27 06:18:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2430 states. [2019-12-27 06:18:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 7765 transitions. [2019-12-27 06:18:31,712 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 7765 transitions. Word has length 47 [2019-12-27 06:18:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:31,712 INFO L462 AbstractCegarLoop]: Abstraction has 2430 states and 7765 transitions. [2019-12-27 06:18:31,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:18:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 7765 transitions. [2019-12-27 06:18:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:18:31,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:31,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:31,720 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash -564374207, now seen corresponding path program 2 times [2019-12-27 06:18:31,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:31,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948329939] [2019-12-27 06:18:31,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:31,804 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 06:18:31,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948329939] [2019-12-27 06:18:31,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:31,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:18:31,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106226044] [2019-12-27 06:18:31,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:18:31,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:18:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:18:31,806 INFO L87 Difference]: Start difference. First operand 2430 states and 7765 transitions. Second operand 6 states. [2019-12-27 06:18:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:32,035 INFO L93 Difference]: Finished difference Result 6744 states and 21570 transitions. [2019-12-27 06:18:32,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:18:32,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 06:18:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:32,044 INFO L225 Difference]: With dead ends: 6744 [2019-12-27 06:18:32,045 INFO L226 Difference]: Without dead ends: 4374 [2019-12-27 06:18:32,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:18:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4374 states. [2019-12-27 06:18:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4374 to 2716. [2019-12-27 06:18:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-27 06:18:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8680 transitions. [2019-12-27 06:18:32,115 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8680 transitions. Word has length 47 [2019-12-27 06:18:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:32,115 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8680 transitions. [2019-12-27 06:18:32,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:18:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8680 transitions. [2019-12-27 06:18:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:18:32,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:32,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:32,125 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash -760514239, now seen corresponding path program 3 times [2019-12-27 06:18:32,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:32,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652038147] [2019-12-27 06:18:32,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:32,211 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 06:18:32,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652038147] [2019-12-27 06:18:32,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:32,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:32,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450536240] [2019-12-27 06:18:32,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:18:32,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:32,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:18:32,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:32,214 INFO L87 Difference]: Start difference. First operand 2716 states and 8680 transitions. Second operand 4 states. [2019-12-27 06:18:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:32,245 INFO L93 Difference]: Finished difference Result 3334 states and 10072 transitions. [2019-12-27 06:18:32,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:18:32,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 06:18:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:32,250 INFO L225 Difference]: With dead ends: 3334 [2019-12-27 06:18:32,250 INFO L226 Difference]: Without dead ends: 1966 [2019-12-27 06:18:32,250 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 06:18:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-27 06:18:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2019-12-27 06:18:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-27 06:18:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 5635 transitions. [2019-12-27 06:18:32,285 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 5635 transitions. Word has length 47 [2019-12-27 06:18:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:32,285 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 5635 transitions. [2019-12-27 06:18:32,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:18:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 5635 transitions. [2019-12-27 06:18:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:18:32,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:32,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:32,291 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 860461867, now seen corresponding path program 4 times [2019-12-27 06:18:32,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:32,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300399877] [2019-12-27 06:18:32,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:32,361 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 06:18:32,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300399877] [2019-12-27 06:18:32,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:32,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:32,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301889965] [2019-12-27 06:18:32,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:18:32,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:32,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:18:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:18:32,363 INFO L87 Difference]: Start difference. First operand 1966 states and 5635 transitions. Second operand 4 states. [2019-12-27 06:18:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:32,387 INFO L93 Difference]: Finished difference Result 2394 states and 6598 transitions. [2019-12-27 06:18:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:18:32,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 06:18:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:32,388 INFO L225 Difference]: With dead ends: 2394 [2019-12-27 06:18:32,388 INFO L226 Difference]: Without dead ends: 476 [2019-12-27 06:18:32,389 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 06:18:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-27 06:18:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-12-27 06:18:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 06:18:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1048 transitions. [2019-12-27 06:18:32,396 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1048 transitions. Word has length 47 [2019-12-27 06:18:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:32,396 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1048 transitions. [2019-12-27 06:18:32,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:18:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1048 transitions. [2019-12-27 06:18:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:18:32,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:32,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:32,398 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:32,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1346667599, now seen corresponding path program 5 times [2019-12-27 06:18:32,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:32,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519258162] [2019-12-27 06:18:32,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:32,607 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 06:18:32,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519258162] [2019-12-27 06:18:32,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:32,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:18:32,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004531530] [2019-12-27 06:18:32,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:18:32,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:32,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:18:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:18:32,613 INFO L87 Difference]: Start difference. First operand 476 states and 1048 transitions. Second operand 8 states. [2019-12-27 06:18:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:33,071 INFO L93 Difference]: Finished difference Result 728 states and 1476 transitions. [2019-12-27 06:18:33,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:18:33,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-27 06:18:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:33,073 INFO L225 Difference]: With dead ends: 728 [2019-12-27 06:18:33,073 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 06:18:33,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:18:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 06:18:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 601. [2019-12-27 06:18:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-27 06:18:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1249 transitions. [2019-12-27 06:18:33,083 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1249 transitions. Word has length 47 [2019-12-27 06:18:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:33,083 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1249 transitions. [2019-12-27 06:18:33,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:18:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1249 transitions. [2019-12-27 06:18:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:18:33,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:33,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:33,085 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2120805973, now seen corresponding path program 1 times [2019-12-27 06:18:33,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:33,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282174635] [2019-12-27 06:18:33,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:33,125 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 06:18:33,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282174635] [2019-12-27 06:18:33,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:33,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:18:33,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473503479] [2019-12-27 06:18:33,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:33,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:33,127 INFO L87 Difference]: Start difference. First operand 601 states and 1249 transitions. Second operand 3 states. [2019-12-27 06:18:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:33,160 INFO L93 Difference]: Finished difference Result 668 states and 1300 transitions. [2019-12-27 06:18:33,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:33,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 06:18:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:33,162 INFO L225 Difference]: With dead ends: 668 [2019-12-27 06:18:33,162 INFO L226 Difference]: Without dead ends: 668 [2019-12-27 06:18:33,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-12-27 06:18:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 588. [2019-12-27 06:18:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-27 06:18:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1158 transitions. [2019-12-27 06:18:33,170 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1158 transitions. Word has length 47 [2019-12-27 06:18:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:33,171 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1158 transitions. [2019-12-27 06:18:33,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1158 transitions. [2019-12-27 06:18:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:18:33,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:33,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:33,172 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:33,173 INFO L82 PathProgramCache]: Analyzing trace with hash 153801761, now seen corresponding path program 6 times [2019-12-27 06:18:33,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:33,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349648883] [2019-12-27 06:18:33,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:18:33,240 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 06:18:33,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349648883] [2019-12-27 06:18:33,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:18:33,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:18:33,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973360761] [2019-12-27 06:18:33,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:18:33,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:18:33,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:18:33,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:18:33,242 INFO L87 Difference]: Start difference. First operand 588 states and 1158 transitions. Second operand 3 states. [2019-12-27 06:18:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:18:33,256 INFO L93 Difference]: Finished difference Result 586 states and 1153 transitions. [2019-12-27 06:18:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:18:33,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 06:18:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:18:33,257 INFO L225 Difference]: With dead ends: 586 [2019-12-27 06:18:33,258 INFO L226 Difference]: Without dead ends: 586 [2019-12-27 06:18:33,258 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 06:18:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-27 06:18:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 504. [2019-12-27 06:18:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-27 06:18:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 999 transitions. [2019-12-27 06:18:33,265 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 999 transitions. Word has length 47 [2019-12-27 06:18:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:18:33,265 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 999 transitions. [2019-12-27 06:18:33,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:18:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 999 transitions. [2019-12-27 06:18:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:18:33,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:18:33,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:18:33,267 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:18:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:18:33,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309809, now seen corresponding path program 1 times [2019-12-27 06:18:33,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:18:33,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185431772] [2019-12-27 06:18:33,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:18:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:18:33,427 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:18:33,427 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:18:33,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_83| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~a~0_9) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~main$tmp_guard1~0_18 0) (< 0 |v_#StackHeapBarrier_23|) (= 0 v_~weak$$choice0~0_9) (= 0 v_~z$r_buff1_thd1~0_11) (= v_~b~0_10 0) (= v_~main$tmp_guard0~0_9 0) (= v_~z$mem_tmp~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= v_~z~0_22 0) (= |v_#NULL.offset_3| 0) (= v_~z$r_buff0_thd4~0_29 0) (= 0 v_~z$w_buff1_used~0_58) (= (select .cse0 |v_ULTIMATE.start_main_~#t949~0.base_29|) 0) (= 0 v_~z$r_buff1_thd2~0_11) (= 0 |v_ULTIMATE.start_main_~#t949~0.offset_22|) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= v_~z$r_buff0_thd2~0_11 0) (= 0 v_~z$r_buff1_thd4~0_21) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#valid_81| (store .cse0 |v_ULTIMATE.start_main_~#t949~0.base_29| 1)) (= 0 v_~z$flush_delayed~0_14) (= v_~z$r_buff0_thd3~0_70 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t949~0.base_29|) (= |v_#length_33| (store |v_#length_34| |v_ULTIMATE.start_main_~#t949~0.base_29| 4)) (= 0 v_~z$r_buff1_thd0~0_19) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~__unbuffered_p3_EBX~0_13) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$w_buff0_used~0_95 0) (= v_~z$r_buff0_thd1~0_11 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~z$r_buff1_thd3~0_42) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t949~0.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t949~0.base_29|) |v_ULTIMATE.start_main_~#t949~0.offset_22| 0)) |v_#memory_int_31|) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_p3_EAX~0_13) (= 0 v_~z$w_buff0~0_25) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_32|, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_11|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_24|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_13, #length=|v_#length_33|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ULTIMATE.start_main_~#t949~0.offset=|v_ULTIMATE.start_main_~#t949~0.offset_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_~#t949~0.base=|v_ULTIMATE.start_main_~#t949~0.base_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_19|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_10, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_13, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_24|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ~b~0=v_~b~0_10, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_31|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t951~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t949~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t949~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t950~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t952~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t952~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t951~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:18:33,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L845-1-->L847: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t950~0.base_12| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12|)) (= |v_ULTIMATE.start_main_~#t950~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t950~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t950~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12|) |v_ULTIMATE.start_main_~#t950~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t950~0.offset] because there is no mapped edge [2019-12-27 06:18:33,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L847-1-->L849: Formula: (and (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13| 1) |v_#valid_54|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13|)) (= |v_ULTIMATE.start_main_~#t951~0.offset_11| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13|) |v_ULTIMATE.start_main_~#t951~0.offset_11| 2))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t951~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t951~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t951~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t951~0.offset, #length, ULTIMATE.start_main_~#t951~0.base] because there is no mapped edge [2019-12-27 06:18:33,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L849-1-->L851: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t952~0.base_10| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10|) |v_ULTIMATE.start_main_~#t952~0.offset_9| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t952~0.base_10|) (= |v_ULTIMATE.start_main_~#t952~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t952~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t952~0.base, #length, ULTIMATE.start_main_~#t952~0.offset] because there is no mapped edge [2019-12-27 06:18:33,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd0~0_14 v_~z$r_buff1_thd0~0_10) (= v_~z$r_buff1_thd2~0_3 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_21) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (= 1 v_~a~0_3) (= v_~__unbuffered_p3_EAX~0_5 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_4)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:18:33,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= 1 v_~b~0_7) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~b~0=v_~b~0_7, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 06:18:33,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= 1 v_~x~0_6) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p1_EAX~0_5 v_~y~0_6) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_6} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_6, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 06:18:33,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1828272897 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In1828272897| |P2Thread1of1ForFork1_#t~ite8_Out1828272897|) (= ~z$w_buff0~0_In1828272897 |P2Thread1of1ForFork1_#t~ite9_Out1828272897|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite8_Out1828272897| ~z$w_buff0~0_In1828272897) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1828272897 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1828272897 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1828272897 256))) (and (= 0 (mod ~z$w_buff1_used~0_In1828272897 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite8_Out1828272897| |P2Thread1of1ForFork1_#t~ite9_Out1828272897|) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1828272897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1828272897, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1828272897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1828272897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1828272897, ~weak$$choice2~0=~weak$$choice2~0_In1828272897, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1828272897|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1828272897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1828272897, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1828272897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1828272897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1828272897, ~weak$$choice2~0=~weak$$choice2~0_In1828272897, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1828272897|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1828272897|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:18:33,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_24, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 06:18:33,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (= v_~z~0_16 v_~z$mem_tmp~0_5) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:18:33,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1384525760 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1384525760 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out1384525760|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1384525760 |P3Thread1of1ForFork2_#t~ite28_Out1384525760|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1384525760, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1384525760} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1384525760|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1384525760, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1384525760} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 06:18:33,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In-137881180 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-137881180 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-137881180 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-137881180 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-137881180|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-137881180 |P3Thread1of1ForFork2_#t~ite29_Out-137881180|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-137881180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137881180, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-137881180, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-137881180} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-137881180|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-137881180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137881180, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-137881180, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-137881180} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:18:33,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-761533657 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-761533657 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-761533657 ~z$r_buff0_thd4~0_In-761533657)) (and (= 0 ~z$r_buff0_thd4~0_Out-761533657) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-761533657, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-761533657} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-761533657, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-761533657, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-761533657|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 06:18:33,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-702794409 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-702794409 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-702794409 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-702794409 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out-702794409| 0)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out-702794409| ~z$r_buff1_thd4~0_In-702794409) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-702794409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-702794409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-702794409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-702794409} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-702794409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-702794409, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-702794409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-702794409, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-702794409|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:18:33,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_15) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:18:33,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:18:33,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2071295572 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2071295572 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In2071295572 |ULTIMATE.start_main_#t~ite36_Out2071295572|)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In2071295572 |ULTIMATE.start_main_#t~ite36_Out2071295572|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2071295572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2071295572, ~z$w_buff1~0=~z$w_buff1~0_In2071295572, ~z~0=~z~0_In2071295572} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2071295572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2071295572, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2071295572|, ~z$w_buff1~0=~z$w_buff1~0_In2071295572, ~z~0=~z~0_In2071295572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:18:33,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 06:18:33,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1473223420 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1473223420 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1473223420|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1473223420 |ULTIMATE.start_main_#t~ite38_Out1473223420|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1473223420, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1473223420} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1473223420, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1473223420, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1473223420|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:18:33,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In2115322667 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2115322667 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2115322667 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2115322667 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out2115322667| ~z$w_buff1_used~0_In2115322667) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out2115322667| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2115322667, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2115322667, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2115322667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2115322667} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2115322667, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2115322667|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2115322667, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2115322667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2115322667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:18:33,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In691213621 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In691213621 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out691213621|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In691213621 |ULTIMATE.start_main_#t~ite40_Out691213621|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In691213621, ~z$w_buff0_used~0=~z$w_buff0_used~0_In691213621} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In691213621, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out691213621|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In691213621} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:18:33,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In840610902 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In840610902 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In840610902 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In840610902 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out840610902| ~z$r_buff1_thd0~0_In840610902) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite41_Out840610902|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In840610902, ~z$w_buff0_used~0=~z$w_buff0_used~0_In840610902, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In840610902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In840610902} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out840610902|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In840610902, ~z$w_buff0_used~0=~z$w_buff0_used~0_In840610902, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In840610902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In840610902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 06:18:33,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p0_EAX~0_9 0) (= 1 v_~__unbuffered_p3_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_14 0) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_14) (= 0 v_~__unbuffered_p3_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:18:33,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:18:33 BasicIcfg [2019-12-27 06:18:33,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:18:33,545 INFO L168 Benchmark]: Toolchain (without parser) took 18001.49 ms. Allocated memory was 144.2 MB in the beginning and 954.2 MB in the end (delta: 810.0 MB). Free memory was 100.2 MB in the beginning and 660.0 MB in the end (delta: -559.8 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:33,546 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:18:33,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.36 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 155.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:33,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.65 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:33,548 INFO L168 Benchmark]: Boogie Preprocessor took 41.71 ms. Allocated memory is still 201.9 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:33,549 INFO L168 Benchmark]: RCFGBuilder took 807.08 ms. Allocated memory is still 201.9 MB. Free memory was 150.4 MB in the beginning and 104.3 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:33,549 INFO L168 Benchmark]: TraceAbstraction took 16275.06 ms. Allocated memory was 201.9 MB in the beginning and 954.2 MB in the end (delta: 752.4 MB). Free memory was 103.6 MB in the beginning and 660.0 MB in the end (delta: -556.5 MB). Peak memory consumption was 195.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:18:33,553 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.20 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.36 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 155.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.65 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.71 ms. Allocated memory is still 201.9 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 807.08 ms. Allocated memory is still 201.9 MB. Free memory was 150.4 MB in the beginning and 104.3 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16275.06 ms. Allocated memory was 201.9 MB in the beginning and 954.2 MB in the end (delta: 752.4 MB). Free memory was 103.6 MB in the beginning and 660.0 MB in the end (delta: -556.5 MB). Peak memory consumption was 195.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 171 ProgramPointsBefore, 80 ProgramPointsAfterwards, 193 TransitionsBefore, 88 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 5370 VarBasedMoverChecksPositive, 132 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1859 SDtfs, 1907 SDslu, 2774 SDs, 0 SdLazy, 911 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 3795 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 54663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...