/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:15:07,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:15:07,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:15:07,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:15:07,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:15:07,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:15:07,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:15:07,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:15:07,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:15:07,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:15:07,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:15:07,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:15:07,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:15:07,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:15:07,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:15:07,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:15:07,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:15:07,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:15:07,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:15:07,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:15:07,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:15:07,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:15:07,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:15:07,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:15:07,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:15:07,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:15:07,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:15:07,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:15:07,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:15:07,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:15:07,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:15:07,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:15:07,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:15:07,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:15:07,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:15:07,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:15:07,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:15:07,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:15:07,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:15:07,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:15:07,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:15:07,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:15:07,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:15:07,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:15:07,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:15:07,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:15:07,280 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:15:07,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:15:07,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:15:07,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:15:07,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:15:07,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:15:07,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:15:07,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:15:07,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:15:07,282 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:15:07,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:15:07,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:15:07,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:15:07,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:15:07,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:15:07,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:15:07,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:15:07,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:15:07,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:15:07,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:15:07,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:15:07,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:15:07,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:15:07,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:15:07,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:15:07,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:15:07,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:15:07,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:15:07,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:15:07,574 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:15:07,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2019-12-18 17:15:07,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2240d83/98a814447b594873b7f8d86e67961e15/FLAG2d8459e13 [2019-12-18 17:15:08,206 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:15:08,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2019-12-18 17:15:08,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2240d83/98a814447b594873b7f8d86e67961e15/FLAG2d8459e13 [2019-12-18 17:15:08,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2240d83/98a814447b594873b7f8d86e67961e15 [2019-12-18 17:15:08,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:15:08,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:15:08,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:15:08,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:15:08,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:15:08,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:15:08" (1/1) ... [2019-12-18 17:15:08,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:08, skipping insertion in model container [2019-12-18 17:15:08,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:15:08" (1/1) ... [2019-12-18 17:15:08,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:15:08,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:15:09,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:15:09,201 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:15:09,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:15:09,357 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:15:09,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09 WrapperNode [2019-12-18 17:15:09,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:15:09,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:15:09,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:15:09,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:15:09,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:15:09,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:15:09,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:15:09,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:15:09,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (1/1) ... [2019-12-18 17:15:09,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:15:09,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:15:09,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:15:09,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:15:09,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (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-18 17:15:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:15:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:15:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:15:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:15:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:15:09,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:15:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:15:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:15:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:15:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:15:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:15:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:15:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:15:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:15:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:15:09,547 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:15:10,266 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:15:10,267 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:15:10,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:15:10 BoogieIcfgContainer [2019-12-18 17:15:10,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:15:10,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:15:10,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:15:10,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:15:10,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:15:08" (1/3) ... [2019-12-18 17:15:10,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da99c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:15:10, skipping insertion in model container [2019-12-18 17:15:10,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:09" (2/3) ... [2019-12-18 17:15:10,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da99c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:15:10, skipping insertion in model container [2019-12-18 17:15:10,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:15:10" (3/3) ... [2019-12-18 17:15:10,277 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_power.opt.i [2019-12-18 17:15:10,288 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:15:10,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:15:10,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:15:10,302 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:15:10,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,351 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,351 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,407 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,407 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,407 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,407 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,414 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,414 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,424 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,424 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,425 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,429 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,436 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,439 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,440 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,440 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:10,458 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:15:10,480 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:15:10,480 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:15:10,480 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:15:10,480 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:15:10,480 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:15:10,480 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:15:10,481 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:15:10,481 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:15:10,504 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-18 17:15:10,506 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-18 17:15:10,598 INFO L126 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-18 17:15:10,602 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:15:10,625 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 12/176 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:15:10,652 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-18 17:15:10,727 INFO L126 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-18 17:15:10,727 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:15:10,747 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 12/176 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:15:10,776 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 17:15:10,777 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:15:16,316 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:15:16,739 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-18 17:15:16,917 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-18 17:15:16,936 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74129 [2019-12-18 17:15:16,936 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 17:15:16,940 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-18 17:15:48,658 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-18 17:15:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-18 17:15:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:15:48,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:48,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:48,668 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash -74872892, now seen corresponding path program 1 times [2019-12-18 17:15:48,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:48,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334665095] [2019-12-18 17:15:48,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:48,974 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-18 17:15:48,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334665095] [2019-12-18 17:15:48,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:48,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:15:48,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568547296] [2019-12-18 17:15:48,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:48,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:48,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:49,000 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-18 17:15:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:54,650 INFO L93 Difference]: Finished difference Result 158186 states and 763682 transitions. [2019-12-18 17:15:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:54,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:15:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:55,746 INFO L225 Difference]: With dead ends: 158186 [2019-12-18 17:15:55,746 INFO L226 Difference]: Without dead ends: 149138 [2019-12-18 17:15:55,748 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-18 17:16:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149138 states. [2019-12-18 17:16:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149138 to 149138. [2019-12-18 17:16:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149138 states. [2019-12-18 17:16:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149138 states to 149138 states and 719092 transitions. [2019-12-18 17:16:12,938 INFO L78 Accepts]: Start accepts. Automaton has 149138 states and 719092 transitions. Word has length 7 [2019-12-18 17:16:12,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:12,939 INFO L462 AbstractCegarLoop]: Abstraction has 149138 states and 719092 transitions. [2019-12-18 17:16:12,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 149138 states and 719092 transitions. [2019-12-18 17:16:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:16:12,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:12,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:12,955 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash 117436716, now seen corresponding path program 1 times [2019-12-18 17:16:12,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:12,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158154770] [2019-12-18 17:16:12,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:13,040 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-18 17:16:13,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158154770] [2019-12-18 17:16:13,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:13,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:13,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959766848] [2019-12-18 17:16:13,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:13,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:13,046 INFO L87 Difference]: Start difference. First operand 149138 states and 719092 transitions. Second operand 3 states. [2019-12-18 17:16:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:13,648 INFO L93 Difference]: Finished difference Result 94514 states and 411493 transitions. [2019-12-18 17:16:13,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:13,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:16:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:14,042 INFO L225 Difference]: With dead ends: 94514 [2019-12-18 17:16:14,043 INFO L226 Difference]: Without dead ends: 94514 [2019-12-18 17:16:14,044 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-18 17:16:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94514 states. [2019-12-18 17:16:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94514 to 94514. [2019-12-18 17:16:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94514 states. [2019-12-18 17:16:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94514 states to 94514 states and 411493 transitions. [2019-12-18 17:16:23,939 INFO L78 Accepts]: Start accepts. Automaton has 94514 states and 411493 transitions. Word has length 15 [2019-12-18 17:16:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:23,939 INFO L462 AbstractCegarLoop]: Abstraction has 94514 states and 411493 transitions. [2019-12-18 17:16:23,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 94514 states and 411493 transitions. [2019-12-18 17:16:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:16:23,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:23,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:23,943 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash 860387736, now seen corresponding path program 1 times [2019-12-18 17:16:23,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:23,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118860306] [2019-12-18 17:16:23,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:24,056 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-18 17:16:24,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118860306] [2019-12-18 17:16:24,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:24,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:24,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331403496] [2019-12-18 17:16:24,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:24,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:24,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:24,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:24,063 INFO L87 Difference]: Start difference. First operand 94514 states and 411493 transitions. Second operand 4 states. [2019-12-18 17:16:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:26,126 INFO L93 Difference]: Finished difference Result 147815 states and 617388 transitions. [2019-12-18 17:16:26,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:26,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:16:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:26,733 INFO L225 Difference]: With dead ends: 147815 [2019-12-18 17:16:26,734 INFO L226 Difference]: Without dead ends: 147703 [2019-12-18 17:16:26,734 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-18 17:16:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147703 states. [2019-12-18 17:16:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147703 to 135599. [2019-12-18 17:16:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135599 states. [2019-12-18 17:16:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135599 states to 135599 states and 571971 transitions. [2019-12-18 17:16:38,164 INFO L78 Accepts]: Start accepts. Automaton has 135599 states and 571971 transitions. Word has length 15 [2019-12-18 17:16:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:38,164 INFO L462 AbstractCegarLoop]: Abstraction has 135599 states and 571971 transitions. [2019-12-18 17:16:38,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 135599 states and 571971 transitions. [2019-12-18 17:16:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:16:38,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:38,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:38,170 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1758547198, now seen corresponding path program 1 times [2019-12-18 17:16:38,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:38,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923580559] [2019-12-18 17:16:38,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:38,247 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-18 17:16:38,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923580559] [2019-12-18 17:16:38,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:38,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:38,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116237673] [2019-12-18 17:16:38,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:38,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:38,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:38,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:38,249 INFO L87 Difference]: Start difference. First operand 135599 states and 571971 transitions. Second operand 4 states. [2019-12-18 17:16:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:38,416 INFO L93 Difference]: Finished difference Result 37047 states and 132608 transitions. [2019-12-18 17:16:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:16:38,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:16:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:38,523 INFO L225 Difference]: With dead ends: 37047 [2019-12-18 17:16:38,523 INFO L226 Difference]: Without dead ends: 37047 [2019-12-18 17:16:38,524 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-18 17:16:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2019-12-18 17:16:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 37047. [2019-12-18 17:16:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37047 states. [2019-12-18 17:16:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37047 states to 37047 states and 132608 transitions. [2019-12-18 17:16:40,332 INFO L78 Accepts]: Start accepts. Automaton has 37047 states and 132608 transitions. Word has length 16 [2019-12-18 17:16:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:40,333 INFO L462 AbstractCegarLoop]: Abstraction has 37047 states and 132608 transitions. [2019-12-18 17:16:40,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37047 states and 132608 transitions. [2019-12-18 17:16:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:16:40,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:40,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:40,336 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash -293201311, now seen corresponding path program 1 times [2019-12-18 17:16:40,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:40,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143500059] [2019-12-18 17:16:40,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:40,400 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-18 17:16:40,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143500059] [2019-12-18 17:16:40,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:40,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:40,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056495675] [2019-12-18 17:16:40,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:40,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:40,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:40,402 INFO L87 Difference]: Start difference. First operand 37047 states and 132608 transitions. Second operand 4 states. [2019-12-18 17:16:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:40,835 INFO L93 Difference]: Finished difference Result 48238 states and 170644 transitions. [2019-12-18 17:16:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:40,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:16:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:40,931 INFO L225 Difference]: With dead ends: 48238 [2019-12-18 17:16:40,932 INFO L226 Difference]: Without dead ends: 48227 [2019-12-18 17:16:40,932 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-18 17:16:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48227 states. [2019-12-18 17:16:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48227 to 42563. [2019-12-18 17:16:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42563 states. [2019-12-18 17:16:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42563 states to 42563 states and 151744 transitions. [2019-12-18 17:16:43,124 INFO L78 Accepts]: Start accepts. Automaton has 42563 states and 151744 transitions. Word has length 16 [2019-12-18 17:16:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:43,124 INFO L462 AbstractCegarLoop]: Abstraction has 42563 states and 151744 transitions. [2019-12-18 17:16:43,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 42563 states and 151744 transitions. [2019-12-18 17:16:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:16:43,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:43,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:43,127 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash -293081279, now seen corresponding path program 1 times [2019-12-18 17:16:43,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:43,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017046805] [2019-12-18 17:16:43,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:43,230 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-18 17:16:43,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017046805] [2019-12-18 17:16:43,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:43,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:43,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122142974] [2019-12-18 17:16:43,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:43,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:43,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:43,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:43,233 INFO L87 Difference]: Start difference. First operand 42563 states and 151744 transitions. Second operand 4 states. [2019-12-18 17:16:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:43,616 INFO L93 Difference]: Finished difference Result 52709 states and 186086 transitions. [2019-12-18 17:16:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:43,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:16:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:43,735 INFO L225 Difference]: With dead ends: 52709 [2019-12-18 17:16:43,735 INFO L226 Difference]: Without dead ends: 52698 [2019-12-18 17:16:43,736 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-18 17:16:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52698 states. [2019-12-18 17:16:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52698 to 42470. [2019-12-18 17:16:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42470 states. [2019-12-18 17:16:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42470 states to 42470 states and 151203 transitions. [2019-12-18 17:16:44,574 INFO L78 Accepts]: Start accepts. Automaton has 42470 states and 151203 transitions. Word has length 16 [2019-12-18 17:16:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:44,575 INFO L462 AbstractCegarLoop]: Abstraction has 42470 states and 151203 transitions. [2019-12-18 17:16:44,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 42470 states and 151203 transitions. [2019-12-18 17:16:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:16:44,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:44,591 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] [2019-12-18 17:16:44,591 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:44,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash 127408811, now seen corresponding path program 1 times [2019-12-18 17:16:44,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:44,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143460110] [2019-12-18 17:16:44,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:44,712 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-18 17:16:44,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143460110] [2019-12-18 17:16:44,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:44,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:44,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503738970] [2019-12-18 17:16:44,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:16:44,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:16:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:44,714 INFO L87 Difference]: Start difference. First operand 42470 states and 151203 transitions. Second operand 5 states. [2019-12-18 17:16:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:47,640 INFO L93 Difference]: Finished difference Result 61996 states and 217115 transitions. [2019-12-18 17:16:47,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:16:47,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 17:16:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:47,778 INFO L225 Difference]: With dead ends: 61996 [2019-12-18 17:16:47,778 INFO L226 Difference]: Without dead ends: 61973 [2019-12-18 17:16:47,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:16:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61973 states. [2019-12-18 17:16:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61973 to 45286. [2019-12-18 17:16:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45286 states. [2019-12-18 17:16:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45286 states to 45286 states and 161233 transitions. [2019-12-18 17:16:48,743 INFO L78 Accepts]: Start accepts. Automaton has 45286 states and 161233 transitions. Word has length 24 [2019-12-18 17:16:48,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:48,744 INFO L462 AbstractCegarLoop]: Abstraction has 45286 states and 161233 transitions. [2019-12-18 17:16:48,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:16:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 45286 states and 161233 transitions. [2019-12-18 17:16:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:16:49,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:49,168 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] [2019-12-18 17:16:49,168 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:49,168 INFO L82 PathProgramCache]: Analyzing trace with hash 127528843, now seen corresponding path program 1 times [2019-12-18 17:16:49,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:49,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733153561] [2019-12-18 17:16:49,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:49,253 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-18 17:16:49,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733153561] [2019-12-18 17:16:49,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:49,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:49,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903681887] [2019-12-18 17:16:49,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:16:49,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:16:49,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:49,255 INFO L87 Difference]: Start difference. First operand 45286 states and 161233 transitions. Second operand 5 states. [2019-12-18 17:16:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:49,979 INFO L93 Difference]: Finished difference Result 63893 states and 223312 transitions. [2019-12-18 17:16:49,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:16:49,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 17:16:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:50,114 INFO L225 Difference]: With dead ends: 63893 [2019-12-18 17:16:50,115 INFO L226 Difference]: Without dead ends: 63870 [2019-12-18 17:16:50,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:16:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-18 17:16:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 41796. [2019-12-18 17:16:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41796 states. [2019-12-18 17:16:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41796 states to 41796 states and 148592 transitions. [2019-12-18 17:16:51,041 INFO L78 Accepts]: Start accepts. Automaton has 41796 states and 148592 transitions. Word has length 24 [2019-12-18 17:16:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:51,041 INFO L462 AbstractCegarLoop]: Abstraction has 41796 states and 148592 transitions. [2019-12-18 17:16:51,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:16:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 41796 states and 148592 transitions. [2019-12-18 17:16:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:16:51,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:51,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:51,569 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2134071175, now seen corresponding path program 1 times [2019-12-18 17:16:51,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:51,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118765380] [2019-12-18 17:16:51,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:51,620 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-18 17:16:51,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118765380] [2019-12-18 17:16:51,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:51,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:16:51,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102889882] [2019-12-18 17:16:51,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:16:51,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:51,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:16:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:16:51,622 INFO L87 Difference]: Start difference. First operand 41796 states and 148592 transitions. Second operand 5 states. [2019-12-18 17:16:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:51,783 INFO L93 Difference]: Finished difference Result 21524 states and 77465 transitions. [2019-12-18 17:16:51,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:51,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 17:16:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:51,847 INFO L225 Difference]: With dead ends: 21524 [2019-12-18 17:16:51,848 INFO L226 Difference]: Without dead ends: 21524 [2019-12-18 17:16:51,848 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-18 17:16:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21524 states. [2019-12-18 17:16:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21524 to 21220. [2019-12-18 17:16:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21220 states. [2019-12-18 17:16:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21220 states to 21220 states and 76433 transitions. [2019-12-18 17:16:52,394 INFO L78 Accepts]: Start accepts. Automaton has 21220 states and 76433 transitions. Word has length 28 [2019-12-18 17:16:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:52,395 INFO L462 AbstractCegarLoop]: Abstraction has 21220 states and 76433 transitions. [2019-12-18 17:16:52,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:16:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 21220 states and 76433 transitions. [2019-12-18 17:16:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:16:52,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:52,432 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] [2019-12-18 17:16:52,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash -16126003, now seen corresponding path program 1 times [2019-12-18 17:16:52,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:52,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157190974] [2019-12-18 17:16:52,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:52,501 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-18 17:16:52,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157190974] [2019-12-18 17:16:52,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:52,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:52,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580555925] [2019-12-18 17:16:52,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:52,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:52,503 INFO L87 Difference]: Start difference. First operand 21220 states and 76433 transitions. Second operand 4 states. [2019-12-18 17:16:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:52,651 INFO L93 Difference]: Finished difference Result 34004 states and 122814 transitions. [2019-12-18 17:16:52,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:16:52,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 17:16:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:52,686 INFO L225 Difference]: With dead ends: 34004 [2019-12-18 17:16:52,686 INFO L226 Difference]: Without dead ends: 18095 [2019-12-18 17:16:52,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 17:16:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18095 states. [2019-12-18 17:16:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18095 to 17989. [2019-12-18 17:16:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17989 states. [2019-12-18 17:16:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17989 states to 17989 states and 64168 transitions. [2019-12-18 17:16:52,994 INFO L78 Accepts]: Start accepts. Automaton has 17989 states and 64168 transitions. Word has length 42 [2019-12-18 17:16:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:52,995 INFO L462 AbstractCegarLoop]: Abstraction has 17989 states and 64168 transitions. [2019-12-18 17:16:52,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17989 states and 64168 transitions. [2019-12-18 17:16:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:16:53,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:53,025 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] [2019-12-18 17:16:53,025 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash 932410289, now seen corresponding path program 2 times [2019-12-18 17:16:53,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:53,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506570295] [2019-12-18 17:16:53,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:53,099 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-18 17:16:53,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506570295] [2019-12-18 17:16:53,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:53,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:53,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927655944] [2019-12-18 17:16:53,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:53,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:53,101 INFO L87 Difference]: Start difference. First operand 17989 states and 64168 transitions. Second operand 4 states. [2019-12-18 17:16:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:53,215 INFO L93 Difference]: Finished difference Result 25858 states and 88081 transitions. [2019-12-18 17:16:53,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:16:53,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 17:16:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:53,248 INFO L225 Difference]: With dead ends: 25858 [2019-12-18 17:16:53,248 INFO L226 Difference]: Without dead ends: 18303 [2019-12-18 17:16:53,249 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-18 17:16:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18303 states. [2019-12-18 17:16:53,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18303 to 18207. [2019-12-18 17:16:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18207 states. [2019-12-18 17:16:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18207 states to 18207 states and 64042 transitions. [2019-12-18 17:16:53,722 INFO L78 Accepts]: Start accepts. Automaton has 18207 states and 64042 transitions. Word has length 42 [2019-12-18 17:16:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:53,723 INFO L462 AbstractCegarLoop]: Abstraction has 18207 states and 64042 transitions. [2019-12-18 17:16:53,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 18207 states and 64042 transitions. [2019-12-18 17:16:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:16:53,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:53,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:53,748 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 10474927, now seen corresponding path program 3 times [2019-12-18 17:16:53,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:53,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692410456] [2019-12-18 17:16:53,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:16:53,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692410456] [2019-12-18 17:16:53,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:53,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:16:53,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224793750] [2019-12-18 17:16:53,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:16:53,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:16:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:16:53,835 INFO L87 Difference]: Start difference. First operand 18207 states and 64042 transitions. Second operand 6 states. [2019-12-18 17:16:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:53,948 INFO L93 Difference]: Finished difference Result 16970 states and 60901 transitions. [2019-12-18 17:16:53,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:16:53,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 17:16:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:53,977 INFO L225 Difference]: With dead ends: 16970 [2019-12-18 17:16:53,978 INFO L226 Difference]: Without dead ends: 13359 [2019-12-18 17:16:53,978 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-18 17:16:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13359 states. [2019-12-18 17:16:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13359 to 12959. [2019-12-18 17:16:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12959 states. [2019-12-18 17:16:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12959 states to 12959 states and 47493 transitions. [2019-12-18 17:16:54,216 INFO L78 Accepts]: Start accepts. Automaton has 12959 states and 47493 transitions. Word has length 42 [2019-12-18 17:16:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:54,216 INFO L462 AbstractCegarLoop]: Abstraction has 12959 states and 47493 transitions. [2019-12-18 17:16:54,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:16:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 12959 states and 47493 transitions. [2019-12-18 17:16:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:16:54,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:54,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:54,237 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash -888538317, now seen corresponding path program 1 times [2019-12-18 17:16:54,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:54,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682200591] [2019-12-18 17:16:54,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:54,311 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-18 17:16:54,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682200591] [2019-12-18 17:16:54,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:54,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:54,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422624405] [2019-12-18 17:16:54,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:54,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:54,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:54,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:54,313 INFO L87 Difference]: Start difference. First operand 12959 states and 47493 transitions. Second operand 4 states. [2019-12-18 17:16:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:54,404 INFO L93 Difference]: Finished difference Result 16679 states and 59939 transitions. [2019-12-18 17:16:54,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:16:54,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 17:16:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:54,413 INFO L225 Difference]: With dead ends: 16679 [2019-12-18 17:16:54,414 INFO L226 Difference]: Without dead ends: 4031 [2019-12-18 17:16:54,414 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-18 17:16:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-12-18 17:16:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 4031. [2019-12-18 17:16:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-12-18 17:16:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 13323 transitions. [2019-12-18 17:16:54,484 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 13323 transitions. Word has length 57 [2019-12-18 17:16:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:54,484 INFO L462 AbstractCegarLoop]: Abstraction has 4031 states and 13323 transitions. [2019-12-18 17:16:54,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 13323 transitions. [2019-12-18 17:16:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:16:54,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:54,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:54,489 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:54,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:54,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1824422047, now seen corresponding path program 2 times [2019-12-18 17:16:54,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:54,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448372050] [2019-12-18 17:16:54,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:54,578 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-18 17:16:54,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448372050] [2019-12-18 17:16:54,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:54,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:16:54,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299346647] [2019-12-18 17:16:54,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:16:54,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:54,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:16:54,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:16:54,583 INFO L87 Difference]: Start difference. First operand 4031 states and 13323 transitions. Second operand 7 states. [2019-12-18 17:16:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:54,844 INFO L93 Difference]: Finished difference Result 8074 states and 26146 transitions. [2019-12-18 17:16:54,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:16:54,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:16:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:54,856 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 17:16:54,856 INFO L226 Difference]: Without dead ends: 5854 [2019-12-18 17:16:54,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:16:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-18 17:16:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5208. [2019-12-18 17:16:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5208 states. [2019-12-18 17:16:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 17102 transitions. [2019-12-18 17:16:54,987 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 17102 transitions. Word has length 57 [2019-12-18 17:16:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:54,987 INFO L462 AbstractCegarLoop]: Abstraction has 5208 states and 17102 transitions. [2019-12-18 17:16:54,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:16:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 17102 transitions. [2019-12-18 17:16:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:16:54,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:54,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:54,996 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1398547123, now seen corresponding path program 3 times [2019-12-18 17:16:54,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:54,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222721831] [2019-12-18 17:16:54,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:55,073 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-18 17:16:55,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222721831] [2019-12-18 17:16:55,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:55,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:16:55,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595673410] [2019-12-18 17:16:55,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:16:55,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:16:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:16:55,075 INFO L87 Difference]: Start difference. First operand 5208 states and 17102 transitions. Second operand 7 states. [2019-12-18 17:16:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:55,345 INFO L93 Difference]: Finished difference Result 9670 states and 31030 transitions. [2019-12-18 17:16:55,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:16:55,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:16:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:55,360 INFO L225 Difference]: With dead ends: 9670 [2019-12-18 17:16:55,361 INFO L226 Difference]: Without dead ends: 7088 [2019-12-18 17:16:55,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:16:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-18 17:16:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 6224. [2019-12-18 17:16:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2019-12-18 17:16:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 20237 transitions. [2019-12-18 17:16:55,499 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 20237 transitions. Word has length 57 [2019-12-18 17:16:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:55,500 INFO L462 AbstractCegarLoop]: Abstraction has 6224 states and 20237 transitions. [2019-12-18 17:16:55,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:16:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 20237 transitions. [2019-12-18 17:16:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:16:55,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:55,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:55,509 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash -182184551, now seen corresponding path program 4 times [2019-12-18 17:16:55,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:55,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507364241] [2019-12-18 17:16:55,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:55,670 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-18 17:16:55,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507364241] [2019-12-18 17:16:55,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:55,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:16:55,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093667943] [2019-12-18 17:16:55,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:16:55,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:55,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:16:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:16:55,676 INFO L87 Difference]: Start difference. First operand 6224 states and 20237 transitions. Second operand 9 states. [2019-12-18 17:16:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:57,679 INFO L93 Difference]: Finished difference Result 45824 states and 151598 transitions. [2019-12-18 17:16:57,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 17:16:57,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:16:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:57,777 INFO L225 Difference]: With dead ends: 45824 [2019-12-18 17:16:57,777 INFO L226 Difference]: Without dead ends: 36272 [2019-12-18 17:16:57,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 17:16:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36272 states. [2019-12-18 17:16:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36272 to 8997. [2019-12-18 17:16:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2019-12-18 17:16:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 29720 transitions. [2019-12-18 17:16:58,139 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 29720 transitions. Word has length 57 [2019-12-18 17:16:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:58,139 INFO L462 AbstractCegarLoop]: Abstraction has 8997 states and 29720 transitions. [2019-12-18 17:16:58,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:16:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 29720 transitions. [2019-12-18 17:16:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:16:58,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:58,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:58,151 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1662360063, now seen corresponding path program 5 times [2019-12-18 17:16:58,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:58,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702978596] [2019-12-18 17:16:58,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:58,248 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-18 17:16:58,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702978596] [2019-12-18 17:16:58,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:58,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:16:58,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378946325] [2019-12-18 17:16:58,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:16:58,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:58,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:16:58,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:16:58,251 INFO L87 Difference]: Start difference. First operand 8997 states and 29720 transitions. Second operand 9 states. [2019-12-18 17:16:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:59,758 INFO L93 Difference]: Finished difference Result 41251 states and 134371 transitions. [2019-12-18 17:16:59,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 17:16:59,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:16:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:59,817 INFO L225 Difference]: With dead ends: 41251 [2019-12-18 17:16:59,817 INFO L226 Difference]: Without dead ends: 33787 [2019-12-18 17:16:59,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 17:16:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33787 states. [2019-12-18 17:17:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33787 to 9093. [2019-12-18 17:17:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9093 states. [2019-12-18 17:17:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 30186 transitions. [2019-12-18 17:17:00,268 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 30186 transitions. Word has length 57 [2019-12-18 17:17:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:00,268 INFO L462 AbstractCegarLoop]: Abstraction has 9093 states and 30186 transitions. [2019-12-18 17:17:00,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:17:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 30186 transitions. [2019-12-18 17:17:00,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:17:00,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:00,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:00,284 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:00,285 INFO L82 PathProgramCache]: Analyzing trace with hash 955367681, now seen corresponding path program 6 times [2019-12-18 17:17:00,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:00,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046398588] [2019-12-18 17:17:00,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:17:00,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046398588] [2019-12-18 17:17:00,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:00,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:17:00,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942765750] [2019-12-18 17:17:00,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:17:00,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:17:00,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:17:00,404 INFO L87 Difference]: Start difference. First operand 9093 states and 30186 transitions. Second operand 3 states. [2019-12-18 17:17:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:00,454 INFO L93 Difference]: Finished difference Result 9091 states and 30181 transitions. [2019-12-18 17:17:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:17:00,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 17:17:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:00,474 INFO L225 Difference]: With dead ends: 9091 [2019-12-18 17:17:00,474 INFO L226 Difference]: Without dead ends: 9091 [2019-12-18 17:17:00,475 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-18 17:17:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2019-12-18 17:17:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 9091. [2019-12-18 17:17:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9091 states. [2019-12-18 17:17:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9091 states to 9091 states and 30181 transitions. [2019-12-18 17:17:00,691 INFO L78 Accepts]: Start accepts. Automaton has 9091 states and 30181 transitions. Word has length 57 [2019-12-18 17:17:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:00,691 INFO L462 AbstractCegarLoop]: Abstraction has 9091 states and 30181 transitions. [2019-12-18 17:17:00,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:17:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 9091 states and 30181 transitions. [2019-12-18 17:17:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:17:00,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:00,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:00,707 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2044839876, now seen corresponding path program 1 times [2019-12-18 17:17:00,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:00,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624794458] [2019-12-18 17:17:00,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:00,801 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-18 17:17:00,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624794458] [2019-12-18 17:17:00,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:00,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:17:00,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074172396] [2019-12-18 17:17:00,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:17:00,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:17:00,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:17:00,803 INFO L87 Difference]: Start difference. First operand 9091 states and 30181 transitions. Second operand 3 states. [2019-12-18 17:17:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:00,849 INFO L93 Difference]: Finished difference Result 8322 states and 26789 transitions. [2019-12-18 17:17:00,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:17:00,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:17:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:00,866 INFO L225 Difference]: With dead ends: 8322 [2019-12-18 17:17:00,866 INFO L226 Difference]: Without dead ends: 8322 [2019-12-18 17:17:00,866 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-18 17:17:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-18 17:17:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 7922. [2019-12-18 17:17:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7922 states. [2019-12-18 17:17:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 25358 transitions. [2019-12-18 17:17:00,990 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 25358 transitions. Word has length 58 [2019-12-18 17:17:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:00,991 INFO L462 AbstractCegarLoop]: Abstraction has 7922 states and 25358 transitions. [2019-12-18 17:17:00,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:17:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 25358 transitions. [2019-12-18 17:17:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:00,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:00,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:01,000 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1949196794, now seen corresponding path program 1 times [2019-12-18 17:17:01,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:01,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967661820] [2019-12-18 17:17:01,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:01,218 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-18 17:17:01,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967661820] [2019-12-18 17:17:01,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:01,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:01,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532477646] [2019-12-18 17:17:01,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:17:01,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:01,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:17:01,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:17:01,221 INFO L87 Difference]: Start difference. First operand 7922 states and 25358 transitions. Second operand 10 states. [2019-12-18 17:17:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:02,429 INFO L93 Difference]: Finished difference Result 13172 states and 41555 transitions. [2019-12-18 17:17:02,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:17:02,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 17:17:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:02,445 INFO L225 Difference]: With dead ends: 13172 [2019-12-18 17:17:02,446 INFO L226 Difference]: Without dead ends: 9622 [2019-12-18 17:17:02,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:17:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2019-12-18 17:17:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 8338. [2019-12-18 17:17:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8338 states. [2019-12-18 17:17:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8338 states to 8338 states and 26488 transitions. [2019-12-18 17:17:02,581 INFO L78 Accepts]: Start accepts. Automaton has 8338 states and 26488 transitions. Word has length 59 [2019-12-18 17:17:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:02,581 INFO L462 AbstractCegarLoop]: Abstraction has 8338 states and 26488 transitions. [2019-12-18 17:17:02,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:17:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 8338 states and 26488 transitions. [2019-12-18 17:17:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:02,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:02,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:02,591 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1854145516, now seen corresponding path program 2 times [2019-12-18 17:17:02,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:02,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516837238] [2019-12-18 17:17:02,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:02,757 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-18 17:17:02,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516837238] [2019-12-18 17:17:02,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:02,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:02,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981664813] [2019-12-18 17:17:02,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:17:02,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:02,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:17:02,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:17:02,760 INFO L87 Difference]: Start difference. First operand 8338 states and 26488 transitions. Second operand 10 states. [2019-12-18 17:17:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:04,038 INFO L93 Difference]: Finished difference Result 13004 states and 40435 transitions. [2019-12-18 17:17:04,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:17:04,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 17:17:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:04,054 INFO L225 Difference]: With dead ends: 13004 [2019-12-18 17:17:04,054 INFO L226 Difference]: Without dead ends: 10294 [2019-12-18 17:17:04,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:17:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10294 states. [2019-12-18 17:17:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10294 to 8538. [2019-12-18 17:17:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8538 states. [2019-12-18 17:17:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 27032 transitions. [2019-12-18 17:17:04,259 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 27032 transitions. Word has length 59 [2019-12-18 17:17:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:04,259 INFO L462 AbstractCegarLoop]: Abstraction has 8538 states and 27032 transitions. [2019-12-18 17:17:04,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:17:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 27032 transitions. [2019-12-18 17:17:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:04,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:04,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:04,269 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1277650624, now seen corresponding path program 3 times [2019-12-18 17:17:04,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:04,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028339639] [2019-12-18 17:17:04,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:04,449 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-18 17:17:04,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028339639] [2019-12-18 17:17:04,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:04,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:17:04,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232596746] [2019-12-18 17:17:04,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:17:04,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:04,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:17:04,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:17:04,451 INFO L87 Difference]: Start difference. First operand 8538 states and 27032 transitions. Second operand 11 states. [2019-12-18 17:17:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:05,954 INFO L93 Difference]: Finished difference Result 12388 states and 38418 transitions. [2019-12-18 17:17:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:17:05,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 17:17:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:05,975 INFO L225 Difference]: With dead ends: 12388 [2019-12-18 17:17:05,975 INFO L226 Difference]: Without dead ends: 9914 [2019-12-18 17:17:05,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:17:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2019-12-18 17:17:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8234. [2019-12-18 17:17:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8234 states. [2019-12-18 17:17:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8234 states to 8234 states and 26156 transitions. [2019-12-18 17:17:06,120 INFO L78 Accepts]: Start accepts. Automaton has 8234 states and 26156 transitions. Word has length 59 [2019-12-18 17:17:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:06,120 INFO L462 AbstractCegarLoop]: Abstraction has 8234 states and 26156 transitions. [2019-12-18 17:17:06,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:17:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 8234 states and 26156 transitions. [2019-12-18 17:17:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:06,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:06,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 17:17:06,129 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -794252350, now seen corresponding path program 4 times [2019-12-18 17:17:06,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:06,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882677583] [2019-12-18 17:17:06,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:06,267 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-18 17:17:06,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882677583] [2019-12-18 17:17:06,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:06,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:06,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739521249] [2019-12-18 17:17:06,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:17:06,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:06,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:17:06,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:17:06,271 INFO L87 Difference]: Start difference. First operand 8234 states and 26156 transitions. Second operand 10 states. [2019-12-18 17:17:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:07,658 INFO L93 Difference]: Finished difference Result 12750 states and 39363 transitions. [2019-12-18 17:17:07,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:17:07,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 17:17:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:07,677 INFO L225 Difference]: With dead ends: 12750 [2019-12-18 17:17:07,677 INFO L226 Difference]: Without dead ends: 10860 [2019-12-18 17:17:07,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:17:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2019-12-18 17:17:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 8686. [2019-12-18 17:17:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8686 states. [2019-12-18 17:17:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8686 states to 8686 states and 27304 transitions. [2019-12-18 17:17:07,821 INFO L78 Accepts]: Start accepts. Automaton has 8686 states and 27304 transitions. Word has length 59 [2019-12-18 17:17:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:07,821 INFO L462 AbstractCegarLoop]: Abstraction has 8686 states and 27304 transitions. [2019-12-18 17:17:07,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:17:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 8686 states and 27304 transitions. [2019-12-18 17:17:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:07,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:07,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:07,834 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1655179634, now seen corresponding path program 5 times [2019-12-18 17:17:07,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:07,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194143006] [2019-12-18 17:17:07,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:08,263 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-18 17:17:08,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194143006] [2019-12-18 17:17:08,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:08,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:17:08,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278204023] [2019-12-18 17:17:08,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 17:17:08,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 17:17:08,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:17:08,265 INFO L87 Difference]: Start difference. First operand 8686 states and 27304 transitions. Second operand 15 states. [2019-12-18 17:17:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:11,110 INFO L93 Difference]: Finished difference Result 12149 states and 37222 transitions. [2019-12-18 17:17:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 17:17:11,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-18 17:17:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:11,129 INFO L225 Difference]: With dead ends: 12149 [2019-12-18 17:17:11,130 INFO L226 Difference]: Without dead ends: 11815 [2019-12-18 17:17:11,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=413, Invalid=2343, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 17:17:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2019-12-18 17:17:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 9940. [2019-12-18 17:17:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9940 states. [2019-12-18 17:17:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9940 states to 9940 states and 30979 transitions. [2019-12-18 17:17:11,291 INFO L78 Accepts]: Start accepts. Automaton has 9940 states and 30979 transitions. Word has length 59 [2019-12-18 17:17:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:11,291 INFO L462 AbstractCegarLoop]: Abstraction has 9940 states and 30979 transitions. [2019-12-18 17:17:11,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 17:17:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 9940 states and 30979 transitions. [2019-12-18 17:17:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:11,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:11,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:11,303 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash -838073842, now seen corresponding path program 6 times [2019-12-18 17:17:11,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:11,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379437506] [2019-12-18 17:17:11,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:11,903 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-18 17:17:11,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379437506] [2019-12-18 17:17:11,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:11,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 17:17:11,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582996606] [2019-12-18 17:17:11,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 17:17:11,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:11,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 17:17:11,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:17:11,905 INFO L87 Difference]: Start difference. First operand 9940 states and 30979 transitions. Second operand 17 states. [2019-12-18 17:17:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:15,182 INFO L93 Difference]: Finished difference Result 12228 states and 37260 transitions. [2019-12-18 17:17:15,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 17:17:15,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 17:17:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:15,201 INFO L225 Difference]: With dead ends: 12228 [2019-12-18 17:17:15,201 INFO L226 Difference]: Without dead ends: 11706 [2019-12-18 17:17:15,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 17:17:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11706 states. [2019-12-18 17:17:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11706 to 9880. [2019-12-18 17:17:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9880 states. [2019-12-18 17:17:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9880 states to 9880 states and 30772 transitions. [2019-12-18 17:17:15,359 INFO L78 Accepts]: Start accepts. Automaton has 9880 states and 30772 transitions. Word has length 59 [2019-12-18 17:17:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:15,360 INFO L462 AbstractCegarLoop]: Abstraction has 9880 states and 30772 transitions. [2019-12-18 17:17:15,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 17:17:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9880 states and 30772 transitions. [2019-12-18 17:17:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:15,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:15,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:15,370 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash -823849930, now seen corresponding path program 7 times [2019-12-18 17:17:15,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:15,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873061205] [2019-12-18 17:17:15,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:15,948 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-18 17:17:15,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873061205] [2019-12-18 17:17:15,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:15,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:17:15,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595313295] [2019-12-18 17:17:15,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:17:15,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:17:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:17:15,949 INFO L87 Difference]: Start difference. First operand 9880 states and 30772 transitions. Second operand 16 states. [2019-12-18 17:17:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:18,699 INFO L93 Difference]: Finished difference Result 13299 states and 40115 transitions. [2019-12-18 17:17:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 17:17:18,705 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-18 17:17:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:18,723 INFO L225 Difference]: With dead ends: 13299 [2019-12-18 17:17:18,724 INFO L226 Difference]: Without dead ends: 12948 [2019-12-18 17:17:18,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=294, Invalid=1346, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 17:17:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12948 states. [2019-12-18 17:17:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12948 to 10578. [2019-12-18 17:17:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-18 17:17:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 32889 transitions. [2019-12-18 17:17:18,897 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 32889 transitions. Word has length 59 [2019-12-18 17:17:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:18,897 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 32889 transitions. [2019-12-18 17:17:18,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:17:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 32889 transitions. [2019-12-18 17:17:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:18,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:18,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:18,909 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1656101628, now seen corresponding path program 8 times [2019-12-18 17:17:18,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:18,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229293850] [2019-12-18 17:17:18,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:19,082 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-18 17:17:19,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229293850] [2019-12-18 17:17:19,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:19,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:17:19,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402115394] [2019-12-18 17:17:19,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:17:19,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:17:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:17:19,084 INFO L87 Difference]: Start difference. First operand 10578 states and 32889 transitions. Second operand 11 states. [2019-12-18 17:17:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:19,815 INFO L93 Difference]: Finished difference Result 13436 states and 41494 transitions. [2019-12-18 17:17:19,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 17:17:19,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 17:17:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:19,837 INFO L225 Difference]: With dead ends: 13436 [2019-12-18 17:17:19,837 INFO L226 Difference]: Without dead ends: 13126 [2019-12-18 17:17:19,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:17:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13126 states. [2019-12-18 17:17:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13126 to 11666. [2019-12-18 17:17:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11666 states. [2019-12-18 17:17:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11666 states to 11666 states and 36250 transitions. [2019-12-18 17:17:20,017 INFO L78 Accepts]: Start accepts. Automaton has 11666 states and 36250 transitions. Word has length 59 [2019-12-18 17:17:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:20,017 INFO L462 AbstractCegarLoop]: Abstraction has 11666 states and 36250 transitions. [2019-12-18 17:17:20,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:17:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 11666 states and 36250 transitions. [2019-12-18 17:17:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:20,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:20,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:20,029 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:20,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:20,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1821759876, now seen corresponding path program 9 times [2019-12-18 17:17:20,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:20,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679003978] [2019-12-18 17:17:20,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:20,173 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-18 17:17:20,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679003978] [2019-12-18 17:17:20,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:20,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:17:20,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77399936] [2019-12-18 17:17:20,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:17:20,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:20,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:17:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:17:20,174 INFO L87 Difference]: Start difference. First operand 11666 states and 36250 transitions. Second operand 11 states. [2019-12-18 17:17:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:20,859 INFO L93 Difference]: Finished difference Result 12790 states and 39210 transitions. [2019-12-18 17:17:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:17:20,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 17:17:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:20,876 INFO L225 Difference]: With dead ends: 12790 [2019-12-18 17:17:20,876 INFO L226 Difference]: Without dead ends: 10184 [2019-12-18 17:17:20,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:17:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10184 states. [2019-12-18 17:17:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10184 to 9250. [2019-12-18 17:17:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-18 17:17:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 28915 transitions. [2019-12-18 17:17:21,099 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 28915 transitions. Word has length 59 [2019-12-18 17:17:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:21,099 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 28915 transitions. [2019-12-18 17:17:21,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:17:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 28915 transitions. [2019-12-18 17:17:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:21,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:21,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:21,109 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1556260520, now seen corresponding path program 10 times [2019-12-18 17:17:21,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:21,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506916576] [2019-12-18 17:17:21,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:21,541 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-18 17:17:21,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506916576] [2019-12-18 17:17:21,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:21,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:17:21,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235076188] [2019-12-18 17:17:21,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:17:21,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:17:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:17:21,543 INFO L87 Difference]: Start difference. First operand 9250 states and 28915 transitions. Second operand 16 states. [2019-12-18 17:17:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:24,147 INFO L93 Difference]: Finished difference Result 10833 states and 33103 transitions. [2019-12-18 17:17:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 17:17:24,148 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-18 17:17:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:24,165 INFO L225 Difference]: With dead ends: 10833 [2019-12-18 17:17:24,165 INFO L226 Difference]: Without dead ends: 10633 [2019-12-18 17:17:24,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=2111, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 17:17:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10633 states. [2019-12-18 17:17:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10633 to 9110. [2019-12-18 17:17:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9110 states. [2019-12-18 17:17:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9110 states to 9110 states and 28542 transitions. [2019-12-18 17:17:24,310 INFO L78 Accepts]: Start accepts. Automaton has 9110 states and 28542 transitions. Word has length 59 [2019-12-18 17:17:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:24,310 INFO L462 AbstractCegarLoop]: Abstraction has 9110 states and 28542 transitions. [2019-12-18 17:17:24,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:17:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9110 states and 28542 transitions. [2019-12-18 17:17:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:24,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:24,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:24,319 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash -765256248, now seen corresponding path program 11 times [2019-12-18 17:17:24,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:24,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28906597] [2019-12-18 17:17:24,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:17:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:17:24,426 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:17:24,426 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:17:24,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$r_buff1_thd4~0_204) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~main$tmp_guard1~0_50 0) (= v_~a~0_15 0) (= 0 v_~y$w_buff0~0_524) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t941~0.base_26| 1)) (= 0 v_~y$r_buff0_thd3~0_184) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff0_thd4~0_132) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t941~0.base_26| 4) |v_#length_29|) (= v_~y$w_buff0_used~0_906 0) (= |v_#NULL.offset_3| 0) (= v_~weak$$choice2~0_152 0) (= v_~y$r_buff1_thd0~0_180 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t941~0.base_26| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t941~0.base_26|) |v_ULTIMATE.start_main_~#t941~0.offset_17| 0)) |v_#memory_int_27|) (= 0 v_~__unbuffered_p0_EAX~0_69) (= 0 v_~y$r_buff0_thd2~0_313) (= v_~y~0_171 0) (= v_~x~0_48 0) (= v_~y$mem_tmp~0_33 0) (= 0 v_~__unbuffered_p1_EAX~0_59) (= 0 v_~__unbuffered_p3_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_47) (= 0 |v_ULTIMATE.start_main_~#t941~0.offset_17|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t941~0.base_26|) (= 0 v_~weak$$choice0~0_21) (= (select .cse0 |v_ULTIMATE.start_main_~#t941~0.base_26|) 0) (= 0 v_~__unbuffered_p2_EAX~0_124) (= 0 v_~y$flush_delayed~0_62) (= 0 v_~y$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_20|) (= v_~y$w_buff1~0_331 0) (= v_~z~0_40 0) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~y$r_buff1_thd2~0_274) (= v_~__unbuffered_cnt~0_218 0) (= v_~y$r_buff0_thd1~0_33 0) (= v_~b~0_43 0) (= 0 v_~y$r_buff1_thd3~0_153) (= v_~y$w_buff1_used~0_620 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_97|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_200|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_15, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_69, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_153, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_59, ULTIMATE.start_main_~#t941~0.offset=|v_ULTIMATE.start_main_~#t941~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_33, ULTIMATE.start_main_~#t941~0.base=|v_ULTIMATE.start_main_~#t941~0.base_26|, ~y$flush_delayed~0=v_~y$flush_delayed~0_62, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_47, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_124, ULTIMATE.start_main_~#t944~0.base=|v_ULTIMATE.start_main_~#t944~0.base_24|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_28|, ULTIMATE.start_main_~#t943~0.base=|v_ULTIMATE.start_main_~#t943~0.base_26|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_331, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_313, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_218, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ULTIMATE.start_main_~#t942~0.offset=|v_ULTIMATE.start_main_~#t942~0.offset_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_40|, ULTIMATE.start_main_~#t942~0.base=|v_ULTIMATE.start_main_~#t942~0.base_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_524, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_184, ~y~0=v_~y~0_171, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t943~0.offset=|v_ULTIMATE.start_main_~#t943~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_47, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_274, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_~#t944~0.offset=|v_ULTIMATE.start_main_~#t944~0.offset_17|, ~b~0=v_~b~0_43, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_152, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t941~0.offset, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t941~0.base, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t944~0.base, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t943~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t942~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t942~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t943~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t944~0.offset, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:17:24,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L850-1-->L852: Formula: (and (= |v_ULTIMATE.start_main_~#t942~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t942~0.base_12|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t942~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t942~0.base_12|) |v_ULTIMATE.start_main_~#t942~0.offset_11| 1))) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t942~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t942~0.base_12| 4)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t942~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t942~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t942~0.offset=|v_ULTIMATE.start_main_~#t942~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t942~0.base=|v_ULTIMATE.start_main_~#t942~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t942~0.offset, #length, ULTIMATE.start_main_~#t942~0.base] because there is no mapped edge [2019-12-18 17:17:24,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L852-1-->L854: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t943~0.base_13|)) (= |v_ULTIMATE.start_main_~#t943~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t943~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t943~0.base_13|) |v_ULTIMATE.start_main_~#t943~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t943~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t943~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t943~0.base_13|) 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t943~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t943~0.offset=|v_ULTIMATE.start_main_~#t943~0.offset_11|, ULTIMATE.start_main_~#t943~0.base=|v_ULTIMATE.start_main_~#t943~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t943~0.offset, ULTIMATE.start_main_~#t943~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 17:17:24,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L854-1-->L856: Formula: (and (= |v_ULTIMATE.start_main_~#t944~0.offset_10| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t944~0.base_12| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t944~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t944~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t944~0.base_12|) |v_ULTIMATE.start_main_~#t944~0.offset_10| 3)) |v_#memory_int_21|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t944~0.base_12| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t944~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t944~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t944~0.offset=|v_ULTIMATE.start_main_~#t944~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t944~0.base=|v_ULTIMATE.start_main_~#t944~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t944~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t944~0.base] because there is no mapped edge [2019-12-18 17:17:24,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~z~0_12 v_~__unbuffered_p2_EAX~0_13) (= v_~y$r_buff0_thd0~0_41 v_~y$r_buff1_thd0~0_36) (= v_~y$r_buff0_thd3~0_35 v_~y$r_buff1_thd3~0_31) (= v_~y$r_buff0_thd4~0_32 v_~y$r_buff1_thd4~0_28) (= v_~y$r_buff1_thd1~0_9 v_~y$r_buff0_thd1~0_9) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48 0)) (= v_~y$r_buff0_thd2~0_103 v_~y$r_buff1_thd2~0_52) (= v_~y$r_buff0_thd3~0_34 1)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~z~0=v_~z~0_12} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_34, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~z~0=v_~z~0_12, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:17:24,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_20 1) (= v_~x~0_26 v_~__unbuffered_p0_EAX~0_24) (= |v_P0Thread1of1ForFork1_#in~arg.base_18| v_P0Thread1of1ForFork1_~arg.base_18) (= v_P0Thread1of1ForFork1_~arg.offset_18 |v_P0Thread1of1ForFork1_#in~arg.offset_18|) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~b~0=v_~b~0_20, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_18} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 17:17:24,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out-47735896| |P3Thread1of1ForFork0_#t~ite32_Out-47735896|)) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-47735896 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-47735896 256)))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-47735896 |P3Thread1of1ForFork0_#t~ite32_Out-47735896|) (not .cse2)) (and .cse0 (= ~y~0_In-47735896 |P3Thread1of1ForFork0_#t~ite32_Out-47735896|) (or .cse1 .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-47735896, ~y$w_buff1~0=~y$w_buff1~0_In-47735896, ~y~0=~y~0_In-47735896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47735896} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-47735896, ~y$w_buff1~0=~y$w_buff1~0_In-47735896, ~y~0=~y~0_In-47735896, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-47735896|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-47735896|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47735896} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 17:17:24,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1592882323 256))) (.cse0 (= (mod ~y$r_buff0_thd4~0_In1592882323 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out1592882323| ~y$w_buff0_used~0_In1592882323)) (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1592882323|) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1592882323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592882323} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1592882323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592882323, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1592882323|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 17:17:24,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1096502918 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1096502918 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1096502918 |P2Thread1of1ForFork3_#t~ite28_Out1096502918|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out1096502918|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1096502918, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1096502918} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1096502918, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1096502918, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1096502918|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 17:17:24,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-781630561 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-781630561 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-781630561 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In-781630561 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-781630561|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-781630561 |P3Thread1of1ForFork0_#t~ite35_Out-781630561|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-781630561, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-781630561, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-781630561, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-781630561} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-781630561, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-781630561, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-781630561, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-781630561|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-781630561} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 17:17:24,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-815774038 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-815774038 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-815774038 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-815774038 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite29_Out-815774038| ~y$w_buff1_used~0_In-815774038) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-815774038|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-815774038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-815774038, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-815774038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-815774038} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-815774038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-815774038, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-815774038, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-815774038|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-815774038} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 17:17:24,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1475381694 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1475381694 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1475381694 ~y$r_buff0_thd3~0_In1475381694)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out1475381694)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1475381694, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1475381694} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1475381694|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1475381694, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1475381694} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:17:24,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1134206574 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1134206574 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1134206574 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1134206574 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out-1134206574| ~y$r_buff1_thd3~0_In-1134206574)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1134206574| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1134206574, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1134206574, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1134206574, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1134206574} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1134206574, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1134206574, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1134206574, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1134206574|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1134206574} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 17:17:24,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_46) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_46, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:17:24,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2120770618 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2120770618| ~y$w_buff0~0_In-2120770618) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In-2120770618| |P1Thread1of1ForFork2_#t~ite8_Out-2120770618|)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-2120770618| ~y$w_buff0~0_In-2120770618) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2120770618 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-2120770618 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2120770618 256)) (and (= (mod ~y$r_buff1_thd2~0_In-2120770618 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite9_Out-2120770618| |P1Thread1of1ForFork2_#t~ite8_Out-2120770618|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120770618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120770618, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-2120770618|, ~y$w_buff0~0=~y$w_buff0~0_In-2120770618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120770618, ~weak$$choice2~0=~weak$$choice2~0_In-2120770618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120770618} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120770618, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2120770618|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120770618, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-2120770618|, ~y$w_buff0~0=~y$w_buff0~0_In-2120770618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120770618, ~weak$$choice2~0=~weak$$choice2~0_In-2120770618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120770618} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:17:24,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1594924618 256) 0))) (or (and (= ~y$w_buff1~0_In-1594924618 |P1Thread1of1ForFork2_#t~ite12_Out-1594924618|) (= |P1Thread1of1ForFork2_#t~ite11_In-1594924618| |P1Thread1of1ForFork2_#t~ite11_Out-1594924618|) (not .cse0)) (and (= ~y$w_buff1~0_In-1594924618 |P1Thread1of1ForFork2_#t~ite11_Out-1594924618|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1594924618 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1594924618 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1594924618 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1594924618 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1594924618| |P1Thread1of1ForFork2_#t~ite11_Out-1594924618|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1594924618, ~y$w_buff1~0=~y$w_buff1~0_In-1594924618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1594924618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1594924618, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1594924618|, ~weak$$choice2~0=~weak$$choice2~0_In-1594924618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1594924618} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1594924618, ~y$w_buff1~0=~y$w_buff1~0_In-1594924618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1594924618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1594924618, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1594924618|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1594924618|, ~weak$$choice2~0=~weak$$choice2~0_In-1594924618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1594924618} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:17:24,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_11|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 17:17:24,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1384729426 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out1384729426| |P1Thread1of1ForFork2_#t~ite24_Out1384729426|) (= |P1Thread1of1ForFork2_#t~ite23_Out1384729426| ~y$r_buff1_thd2~0_In1384729426) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1384729426 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1384729426 256)) (and (= (mod ~y$r_buff1_thd2~0_In1384729426 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In1384729426 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite24_Out1384729426| ~y$r_buff1_thd2~0_In1384729426) (= |P1Thread1of1ForFork2_#t~ite23_In1384729426| |P1Thread1of1ForFork2_#t~ite23_Out1384729426|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1384729426, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1384729426, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1384729426, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1384729426|, ~weak$$choice2~0=~weak$$choice2~0_In1384729426, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1384729426} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1384729426, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1384729426, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1384729426, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1384729426|, ~weak$$choice2~0=~weak$$choice2~0_In1384729426, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1384729426|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1384729426} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 17:17:24,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= v_~y~0_26 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_26, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 17:17:24,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1008983733 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1008983733 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In1008983733 |P3Thread1of1ForFork0_#t~ite36_Out1008983733|)) (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out1008983733|) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1008983733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1008983733} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1008983733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1008983733, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1008983733|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 17:17:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-419754275 256))) (.cse3 (= (mod ~y$r_buff0_thd4~0_In-419754275 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-419754275 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In-419754275 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out-419754275| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite37_Out-419754275| ~y$r_buff1_thd4~0_In-419754275)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-419754275, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-419754275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-419754275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-419754275} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-419754275, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-419754275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-419754275, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-419754275|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-419754275} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 17:17:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_146 (+ v_~__unbuffered_cnt~0_147 1)) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_66| v_~y$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_66|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_141, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_65|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:17:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= v_~main$tmp_guard0~0_12 1) (= 4 v_~__unbuffered_cnt~0_38)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:17:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In486236519 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In486236519 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out486236519| ~y$w_buff1~0_In486236519) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out486236519| ~y~0_In486236519) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In486236519, ~y~0=~y~0_In486236519, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In486236519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In486236519} OutVars{~y$w_buff1~0=~y$w_buff1~0_In486236519, ~y~0=~y~0_In486236519, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out486236519|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In486236519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In486236519} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:17:24,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:17:24,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1910514713 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1910514713 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1910514713| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1910514713| ~y$w_buff0_used~0_In1910514713)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1910514713, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1910514713} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1910514713, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1910514713, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1910514713|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:17:24,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-1496335737 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1496335737 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1496335737 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1496335737 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1496335737 |ULTIMATE.start_main_#t~ite45_Out-1496335737|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1496335737|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1496335737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1496335737, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1496335737, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1496335737} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1496335737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1496335737, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1496335737, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1496335737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1496335737} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:17:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1222921742 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1222921742 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1222921742| ~y$r_buff0_thd0~0_In-1222921742)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1222921742| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222921742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1222921742} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222921742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1222921742, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1222921742|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 17:17:24,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-482845833 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-482845833 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-482845833 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-482845833 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out-482845833|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-482845833 |ULTIMATE.start_main_#t~ite47_Out-482845833|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-482845833, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-482845833, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-482845833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-482845833} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-482845833, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-482845833, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-482845833|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-482845833, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-482845833} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 17:17:24,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p3_EBX~0_23) (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~y$r_buff1_thd0~0_137 |v_ULTIMATE.start_main_#t~ite47_48|) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_92) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 1 v_~__unbuffered_p3_EAX~0_23) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:17:24,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:17:24 BasicIcfg [2019-12-18 17:17:24,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:17:24,541 INFO L168 Benchmark]: Toolchain (without parser) took 136024.35 ms. Allocated memory was 143.7 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 98.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 17:17:24,544 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 17:17:24,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.28 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.0 MB in the beginning and 154.5 MB in the end (delta: -56.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:17:24,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.47 ms. Allocated memory is still 201.3 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:17:24,546 INFO L168 Benchmark]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:17:24,547 INFO L168 Benchmark]: RCFGBuilder took 792.38 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.5 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:17:24,547 INFO L168 Benchmark]: TraceAbstraction took 134269.99 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 17:17:24,559 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.47 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.28 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.0 MB in the beginning and 154.5 MB in the end (delta: -56.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.47 ms. Allocated memory is still 201.3 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.38 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.5 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134269.99 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 183 ProgramPointsBefore, 88 ProgramPointsAfterwards, 211 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 7374 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74129 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t941, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t942, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t943, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t944, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b 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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EAX = y VAL [\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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 133.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5598 SDtfs, 10435 SDslu, 21692 SDs, 0 SdLazy, 17271 SolverSat, 720 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 37 SyntacticMatches, 22 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3490 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160086occurred 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: 49.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 138424 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1336 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1248 ConstructedInterpolants, 0 QuantifiedInterpolants, 313708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...