/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:54:29,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:54:29,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:54:29,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:54:29,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:54:29,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:54:29,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:54:29,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:54:29,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:54:29,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:54:29,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:54:29,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:54:29,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:54:29,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:54:29,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:54:29,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:54:29,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:54:29,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:54:29,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:54:29,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:54:29,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:54:29,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:54:29,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:54:29,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:54:29,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:54:29,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:54:29,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:54:29,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:54:29,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:54:29,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:54:29,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:54:29,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:54:29,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:54:29,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:54:29,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:54:29,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:54:29,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:54:29,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:54:29,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:54:29,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:54:29,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:54:29,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:54:29,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:54:29,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:54:29,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:54:29,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:54:29,241 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:54:29,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:54:29,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:54:29,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:54:29,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:54:29,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:54:29,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:54:29,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:54:29,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:54:29,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:54:29,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:54:29,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:54:29,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:54:29,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:54:29,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:54:29,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:54:29,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:54:29,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:54:29,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:54:29,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:54:29,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:54:29,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:54:29,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:54:29,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:54:29,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:54:29,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:54:29,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:54:29,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:54:29,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:54:29,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:54:29,526 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:54:29,528 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-26 21:54:29,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0810c2d/5e48dd85b99740fb9499fd12a8a139f6/FLAGa6bb02690 [2019-12-26 21:54:30,195 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:54:30,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-26 21:54:30,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0810c2d/5e48dd85b99740fb9499fd12a8a139f6/FLAGa6bb02690 [2019-12-26 21:54:30,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0810c2d/5e48dd85b99740fb9499fd12a8a139f6 [2019-12-26 21:54:30,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:54:30,421 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:54:30,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:54:30,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:54:30,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:54:30,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:54:30" (1/1) ... [2019-12-26 21:54:30,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:30, skipping insertion in model container [2019-12-26 21:54:30,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:54:30" (1/1) ... [2019-12-26 21:54:30,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:54:30,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:54:31,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:54:31,024 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:54:31,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:54:31,194 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:54:31,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31 WrapperNode [2019-12-26 21:54:31,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:54:31,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:54:31,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:54:31,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:54:31,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:54:31,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:54:31,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:54:31,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:54:31,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (1/1) ... [2019-12-26 21:54:31,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:54:31,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:54:31,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:54:31,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:54:31,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (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-26 21:54:31,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:54:31,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:54:31,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:54:31,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:54:31,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:54:31,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:54:31,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:54:31,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:54:31,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:54:31,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:54:31,392 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 21:54:31,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 21:54:31,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:54:31,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:54:31,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:54:31,395 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:54:32,117 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:54:32,117 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:54:32,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:54:32 BoogieIcfgContainer [2019-12-26 21:54:32,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:54:32,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:54:32,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:54:32,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:54:32,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:54:30" (1/3) ... [2019-12-26 21:54:32,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13525347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:54:32, skipping insertion in model container [2019-12-26 21:54:32,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:31" (2/3) ... [2019-12-26 21:54:32,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13525347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:54:32, skipping insertion in model container [2019-12-26 21:54:32,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:54:32" (3/3) ... [2019-12-26 21:54:32,127 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_power.opt.i [2019-12-26 21:54:32,138 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:54:32,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:54:32,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:54:32,152 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:54:32,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,263 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,264 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,271 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,271 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,271 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,281 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,281 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,285 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,292 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,294 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,298 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,298 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,302 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:32,324 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 21:54:32,340 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:54:32,340 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:54:32,340 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:54:32,340 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:54:32,340 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:54:32,340 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:54:32,340 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:54:32,341 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:54:32,363 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-26 21:54:32,370 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 21:54:32,502 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 21:54:32,502 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:54:32,522 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 21:54:32,545 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 21:54:32,625 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 21:54:32,625 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:54:32,638 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 21:54:32,665 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-26 21:54:32,666 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:54:37,803 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-26 21:54:38,671 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 21:54:38,829 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 21:54:38,985 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-26 21:54:38,985 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-26 21:54:38,989 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-26 21:55:12,491 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-26 21:55:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-26 21:55:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:55:12,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:55:12,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:55:12,499 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-26 21:55:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:55:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-26 21:55:12,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:55:12,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143494065] [2019-12-26 21:55:12,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:55:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:55:12,753 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-26 21:55:12,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143494065] [2019-12-26 21:55:12,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:55:12,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:55:12,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462162726] [2019-12-26 21:55:12,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:55:12,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:55:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:55:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:55:12,778 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-26 21:55:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:55:15,187 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-26 21:55:15,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:55:15,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:55:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:55:21,326 INFO L225 Difference]: With dead ends: 158998 [2019-12-26 21:55:21,326 INFO L226 Difference]: Without dead ends: 149254 [2019-12-26 21:55:21,328 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-26 21:55:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-26 21:55:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-26 21:55:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-26 21:55:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-26 21:55:30,910 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-26 21:55:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:55:30,911 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-26 21:55:30,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:55:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-26 21:55:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:55:30,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:55:30,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:55:30,923 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-26 21:55:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:55:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-26 21:55:30,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:55:30,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834413121] [2019-12-26 21:55:30,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:55:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:55:31,029 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-26 21:55:31,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834413121] [2019-12-26 21:55:31,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:55:31,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:55:31,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317942745] [2019-12-26 21:55:31,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:55:31,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:55:31,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:55:31,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:55:31,033 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-26 21:55:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:55:37,027 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-26 21:55:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:55:37,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 21:55:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:55:37,305 INFO L225 Difference]: With dead ends: 94546 [2019-12-26 21:55:37,305 INFO L226 Difference]: Without dead ends: 94546 [2019-12-26 21:55:37,306 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-26 21:55:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-26 21:55:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-26 21:55:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-26 21:55:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-26 21:55:45,462 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-26 21:55:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:55:45,462 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-26 21:55:45,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:55:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-26 21:55:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:55:45,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:55:45,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:55:45,466 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-26 21:55:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:55:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-26 21:55:45,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:55:45,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462510281] [2019-12-26 21:55:45,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:55:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:55:45,558 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-26 21:55:45,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462510281] [2019-12-26 21:55:45,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:55:45,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:55:45,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299651123] [2019-12-26 21:55:45,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:55:45,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:55:45,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:55:45,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:55:45,561 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-26 21:55:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:55:47,408 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-26 21:55:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:55:47,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 21:55:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:55:48,225 INFO L225 Difference]: With dead ends: 144639 [2019-12-26 21:55:48,226 INFO L226 Difference]: Without dead ends: 144527 [2019-12-26 21:55:48,226 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-26 21:55:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-26 21:55:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-26 21:55:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-26 21:55:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-26 21:55:59,633 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-26 21:55:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:55:59,634 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-26 21:55:59,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:55:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-26 21:55:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:55:59,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:55:59,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:55:59,639 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-26 21:55:59,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:55:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-26 21:55:59,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:55:59,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055216753] [2019-12-26 21:55:59,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:55:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:55:59,696 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-26 21:55:59,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055216753] [2019-12-26 21:55:59,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:55:59,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:55:59,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395553105] [2019-12-26 21:55:59,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:55:59,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:55:59,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:55:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:55:59,699 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 4 states. [2019-12-26 21:56:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:00,894 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-26 21:56:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:56:00,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:56:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:00,999 INFO L225 Difference]: With dead ends: 37161 [2019-12-26 21:56:00,999 INFO L226 Difference]: Without dead ends: 37161 [2019-12-26 21:56:01,000 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-26 21:56:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-26 21:56:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-26 21:56:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-26 21:56:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-26 21:56:01,690 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-26 21:56:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:01,690 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-26 21:56:01,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:56:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-26 21:56:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:56:01,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:01,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:01,694 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-26 21:56:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-26 21:56:01,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:01,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156172920] [2019-12-26 21:56:01,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:01,772 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-26 21:56:01,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156172920] [2019-12-26 21:56:01,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:01,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:56:01,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792919800] [2019-12-26 21:56:01,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:56:01,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:01,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:56:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:56:01,775 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 5 states. [2019-12-26 21:56:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:02,316 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-26 21:56:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:56:02,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:56:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:02,429 INFO L225 Difference]: With dead ends: 54896 [2019-12-26 21:56:02,429 INFO L226 Difference]: Without dead ends: 54878 [2019-12-26 21:56:02,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:56:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-26 21:56:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-26 21:56:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-26 21:56:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-26 21:56:04,454 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-26 21:56:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:04,454 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-26 21:56:04,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:56:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-26 21:56:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 21:56:04,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:04,474 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-26 21:56:04,474 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-26 21:56:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-26 21:56:04,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:04,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438900919] [2019-12-26 21:56:04,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:04,560 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-26 21:56:04,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438900919] [2019-12-26 21:56:04,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:04,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:56:04,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693548332] [2019-12-26 21:56:04,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:56:04,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:56:04,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:56:04,563 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 6 states. [2019-12-26 21:56:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:05,631 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-26 21:56:05,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:56:05,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 21:56:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:05,760 INFO L225 Difference]: With dead ends: 65283 [2019-12-26 21:56:05,761 INFO L226 Difference]: Without dead ends: 65253 [2019-12-26 21:56:05,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:56:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-26 21:56:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-26 21:56:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-26 21:56:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-26 21:56:09,622 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-26 21:56:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:09,623 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-26 21:56:09,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:56:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-26 21:56:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:56:09,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:09,652 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-26 21:56:09,652 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-26 21:56:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:09,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-26 21:56:09,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:09,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410281475] [2019-12-26 21:56:09,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:09,716 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-26 21:56:09,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410281475] [2019-12-26 21:56:09,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:09,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:56:09,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570605956] [2019-12-26 21:56:09,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:56:09,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:56:09,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:56:09,718 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 5 states. [2019-12-26 21:56:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:09,843 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-26 21:56:09,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:56:09,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:56:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:09,886 INFO L225 Difference]: With dead ends: 23301 [2019-12-26 21:56:09,886 INFO L226 Difference]: Without dead ends: 23301 [2019-12-26 21:56:09,886 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-26 21:56:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-26 21:56:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-26 21:56:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-26 21:56:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-26 21:56:10,290 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-26 21:56:10,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:10,290 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-26 21:56:10,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:56:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-26 21:56:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 21:56:10,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:10,331 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-26 21:56:10,331 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-26 21:56:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:10,332 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-26 21:56:10,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:10,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581482417] [2019-12-26 21:56:10,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:10,399 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-26 21:56:10,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581482417] [2019-12-26 21:56:10,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:10,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:56:10,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386105916] [2019-12-26 21:56:10,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:56:10,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:10,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:56:10,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:10,401 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 3 states. [2019-12-26 21:56:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:10,536 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-26 21:56:10,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:56:10,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-26 21:56:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:10,577 INFO L225 Difference]: With dead ends: 34696 [2019-12-26 21:56:10,577 INFO L226 Difference]: Without dead ends: 23444 [2019-12-26 21:56:10,577 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-26 21:56:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-26 21:56:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-26 21:56:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-26 21:56:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-26 21:56:11,389 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-26 21:56:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:11,390 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-26 21:56:11,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-26 21:56:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 21:56:11,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:11,427 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] [2019-12-26 21:56:11,427 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-26 21:56:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-26 21:56:11,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:11,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528924566] [2019-12-26 21:56:11,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:11,514 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-26 21:56:11,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528924566] [2019-12-26 21:56:11,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:11,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:56:11,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071688503] [2019-12-26 21:56:11,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:56:11,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:11,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:56:11,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:56:11,518 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 6 states. [2019-12-26 21:56:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:11,670 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-26 21:56:11,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:56:11,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-26 21:56:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:11,693 INFO L225 Difference]: With dead ends: 21758 [2019-12-26 21:56:11,693 INFO L226 Difference]: Without dead ends: 11194 [2019-12-26 21:56:11,693 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-26 21:56:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-26 21:56:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-26 21:56:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-26 21:56:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-26 21:56:11,877 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-26 21:56:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:11,878 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-26 21:56:11,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:56:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-26 21:56:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:11,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:11,896 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-26 21:56:11,896 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-26 21:56:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:11,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-26 21:56:11,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:11,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939285124] [2019-12-26 21:56:11,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:11,955 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-26 21:56:11,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939285124] [2019-12-26 21:56:11,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:11,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:56:11,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096874643] [2019-12-26 21:56:11,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:56:11,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:11,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:56:11,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:11,959 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-26 21:56:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:12,067 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-26 21:56:12,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:56:12,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-26 21:56:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:12,103 INFO L225 Difference]: With dead ends: 14554 [2019-12-26 21:56:12,103 INFO L226 Difference]: Without dead ends: 14554 [2019-12-26 21:56:12,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-26 21:56:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-26 21:56:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-26 21:56:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-26 21:56:12,473 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-26 21:56:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:12,474 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-26 21:56:12,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-26 21:56:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:12,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:12,494 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-26 21:56:12,494 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-26 21:56:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-26 21:56:12,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:12,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600017836] [2019-12-26 21:56:12,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:12,627 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-26 21:56:12,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600017836] [2019-12-26 21:56:12,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:12,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:56:12,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260299135] [2019-12-26 21:56:12,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:56:12,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:12,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:56:12,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:56:12,630 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 4 states. [2019-12-26 21:56:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:12,729 INFO L93 Difference]: Finished difference Result 21477 states and 67702 transitions. [2019-12-26 21:56:12,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:56:12,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-26 21:56:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:12,749 INFO L225 Difference]: With dead ends: 21477 [2019-12-26 21:56:12,750 INFO L226 Difference]: Without dead ends: 9937 [2019-12-26 21:56:12,750 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-26 21:56:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-12-26 21:56:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2019-12-26 21:56:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9937 states. [2019-12-26 21:56:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 31212 transitions. [2019-12-26 21:56:12,926 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 31212 transitions. Word has length 57 [2019-12-26 21:56:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:12,926 INFO L462 AbstractCegarLoop]: Abstraction has 9937 states and 31212 transitions. [2019-12-26 21:56:12,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:56:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 31212 transitions. [2019-12-26 21:56:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:12,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:12,938 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-26 21:56:12,938 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-26 21:56:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-26 21:56:12,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:12,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059651278] [2019-12-26 21:56:12,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:13,026 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-26 21:56:13,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059651278] [2019-12-26 21:56:13,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:13,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:56:13,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734469288] [2019-12-26 21:56:13,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:56:13,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:13,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:56:13,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:56:13,029 INFO L87 Difference]: Start difference. First operand 9937 states and 31212 transitions. Second operand 7 states. [2019-12-26 21:56:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:13,650 INFO L93 Difference]: Finished difference Result 26843 states and 84141 transitions. [2019-12-26 21:56:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:56:13,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 21:56:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:13,680 INFO L225 Difference]: With dead ends: 26843 [2019-12-26 21:56:13,680 INFO L226 Difference]: Without dead ends: 20587 [2019-12-26 21:56:13,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:56:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20587 states. [2019-12-26 21:56:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20587 to 12177. [2019-12-26 21:56:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-12-26 21:56:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 38516 transitions. [2019-12-26 21:56:13,938 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 38516 transitions. Word has length 57 [2019-12-26 21:56:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:13,938 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 38516 transitions. [2019-12-26 21:56:13,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:56:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 38516 transitions. [2019-12-26 21:56:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:13,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:13,958 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-26 21:56:13,958 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-26 21:56:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:13,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-26 21:56:13,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:13,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559670572] [2019-12-26 21:56:13,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:14,052 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-26 21:56:14,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559670572] [2019-12-26 21:56:14,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:14,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:56:14,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97468019] [2019-12-26 21:56:14,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:56:14,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:14,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:56:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:56:14,055 INFO L87 Difference]: Start difference. First operand 12177 states and 38516 transitions. Second operand 7 states. [2019-12-26 21:56:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:14,558 INFO L93 Difference]: Finished difference Result 33666 states and 104259 transitions. [2019-12-26 21:56:14,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:56:14,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 21:56:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:14,609 INFO L225 Difference]: With dead ends: 33666 [2019-12-26 21:56:14,609 INFO L226 Difference]: Without dead ends: 24086 [2019-12-26 21:56:14,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:56:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2019-12-26 21:56:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 15349. [2019-12-26 21:56:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15349 states. [2019-12-26 21:56:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 48528 transitions. [2019-12-26 21:56:14,959 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 48528 transitions. Word has length 57 [2019-12-26 21:56:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:14,959 INFO L462 AbstractCegarLoop]: Abstraction has 15349 states and 48528 transitions. [2019-12-26 21:56:14,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:56:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 48528 transitions. [2019-12-26 21:56:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:14,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:14,983 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-26 21:56:14,984 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-26 21:56:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-26 21:56:14,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:14,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350064840] [2019-12-26 21:56:14,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:15,138 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-26 21:56:15,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350064840] [2019-12-26 21:56:15,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:15,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:56:15,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503827833] [2019-12-26 21:56:15,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:56:15,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:15,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:56:15,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:56:15,140 INFO L87 Difference]: Start difference. First operand 15349 states and 48528 transitions. Second operand 8 states. [2019-12-26 21:56:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:16,069 INFO L93 Difference]: Finished difference Result 34932 states and 106981 transitions. [2019-12-26 21:56:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:56:16,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-26 21:56:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:16,118 INFO L225 Difference]: With dead ends: 34932 [2019-12-26 21:56:16,118 INFO L226 Difference]: Without dead ends: 32668 [2019-12-26 21:56:16,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:56:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2019-12-26 21:56:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 15407. [2019-12-26 21:56:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2019-12-26 21:56:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 48800 transitions. [2019-12-26 21:56:16,620 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 48800 transitions. Word has length 57 [2019-12-26 21:56:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:16,620 INFO L462 AbstractCegarLoop]: Abstraction has 15407 states and 48800 transitions. [2019-12-26 21:56:16,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:56:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 48800 transitions. [2019-12-26 21:56:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:16,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:16,637 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-26 21:56:16,637 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-26 21:56:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash -979581959, now seen corresponding path program 5 times [2019-12-26 21:56:16,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:16,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065283080] [2019-12-26 21:56:16,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:16,731 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-26 21:56:16,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065283080] [2019-12-26 21:56:16,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:16,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:56:16,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75001923] [2019-12-26 21:56:16,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:56:16,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:56:16,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:56:16,733 INFO L87 Difference]: Start difference. First operand 15407 states and 48800 transitions. Second operand 9 states. [2019-12-26 21:56:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:18,103 INFO L93 Difference]: Finished difference Result 48430 states and 148036 transitions. [2019-12-26 21:56:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:56:18,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 21:56:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:18,173 INFO L225 Difference]: With dead ends: 48430 [2019-12-26 21:56:18,174 INFO L226 Difference]: Without dead ends: 46166 [2019-12-26 21:56:18,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:56:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46166 states. [2019-12-26 21:56:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46166 to 15428. [2019-12-26 21:56:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2019-12-26 21:56:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 48880 transitions. [2019-12-26 21:56:18,663 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 48880 transitions. Word has length 57 [2019-12-26 21:56:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:18,664 INFO L462 AbstractCegarLoop]: Abstraction has 15428 states and 48880 transitions. [2019-12-26 21:56:18,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:56:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 48880 transitions. [2019-12-26 21:56:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:18,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:18,681 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-26 21:56:18,681 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-26 21:56:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:18,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2032569873, now seen corresponding path program 6 times [2019-12-26 21:56:18,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:18,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776993972] [2019-12-26 21:56:18,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:18,788 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-26 21:56:18,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776993972] [2019-12-26 21:56:18,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:18,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:56:18,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244672030] [2019-12-26 21:56:18,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:56:18,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:56:18,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:56:18,790 INFO L87 Difference]: Start difference. First operand 15428 states and 48880 transitions. Second operand 9 states. [2019-12-26 21:56:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:20,408 INFO L93 Difference]: Finished difference Result 62597 states and 191406 transitions. [2019-12-26 21:56:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 21:56:20,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 21:56:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:20,485 INFO L225 Difference]: With dead ends: 62597 [2019-12-26 21:56:20,485 INFO L226 Difference]: Without dead ends: 54167 [2019-12-26 21:56:20,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 21:56:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-26 21:56:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 19382. [2019-12-26 21:56:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19382 states. [2019-12-26 21:56:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 61433 transitions. [2019-12-26 21:56:21,068 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 61433 transitions. Word has length 57 [2019-12-26 21:56:21,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:21,068 INFO L462 AbstractCegarLoop]: Abstraction has 19382 states and 61433 transitions. [2019-12-26 21:56:21,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:56:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 61433 transitions. [2019-12-26 21:56:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:21,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:21,088 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-26 21:56:21,089 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-26 21:56:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 7 times [2019-12-26 21:56:21,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:21,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438740267] [2019-12-26 21:56:21,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:21,174 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-26 21:56:21,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438740267] [2019-12-26 21:56:21,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:21,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:56:21,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940589270] [2019-12-26 21:56:21,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:56:21,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:56:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:21,176 INFO L87 Difference]: Start difference. First operand 19382 states and 61433 transitions. Second operand 3 states. [2019-12-26 21:56:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:21,252 INFO L93 Difference]: Finished difference Result 16496 states and 51087 transitions. [2019-12-26 21:56:21,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:56:21,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-26 21:56:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:21,282 INFO L225 Difference]: With dead ends: 16496 [2019-12-26 21:56:21,283 INFO L226 Difference]: Without dead ends: 16496 [2019-12-26 21:56:21,285 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-26 21:56:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16496 states. [2019-12-26 21:56:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16496 to 15921. [2019-12-26 21:56:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15921 states. [2019-12-26 21:56:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 49194 transitions. [2019-12-26 21:56:21,525 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 49194 transitions. Word has length 57 [2019-12-26 21:56:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:21,525 INFO L462 AbstractCegarLoop]: Abstraction has 15921 states and 49194 transitions. [2019-12-26 21:56:21,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 49194 transitions. [2019-12-26 21:56:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:21,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:21,541 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-26 21:56:21,541 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-26 21:56:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-26 21:56:21,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:21,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333464754] [2019-12-26 21:56:21,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:21,654 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-26 21:56:21,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333464754] [2019-12-26 21:56:21,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:21,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:56:21,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784902300] [2019-12-26 21:56:21,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:56:21,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:21,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:56:21,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:56:21,660 INFO L87 Difference]: Start difference. First operand 15921 states and 49194 transitions. Second operand 8 states. [2019-12-26 21:56:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:23,636 INFO L93 Difference]: Finished difference Result 28147 states and 84036 transitions. [2019-12-26 21:56:23,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:56:23,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-26 21:56:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:23,673 INFO L225 Difference]: With dead ends: 28147 [2019-12-26 21:56:23,673 INFO L226 Difference]: Without dead ends: 27925 [2019-12-26 21:56:23,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:56:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27925 states. [2019-12-26 21:56:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27925 to 19756. [2019-12-26 21:56:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19756 states. [2019-12-26 21:56:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19756 states to 19756 states and 60682 transitions. [2019-12-26 21:56:24,032 INFO L78 Accepts]: Start accepts. Automaton has 19756 states and 60682 transitions. Word has length 58 [2019-12-26 21:56:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:24,033 INFO L462 AbstractCegarLoop]: Abstraction has 19756 states and 60682 transitions. [2019-12-26 21:56:24,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:56:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19756 states and 60682 transitions. [2019-12-26 21:56:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:24,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:24,053 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-26 21:56:24,053 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-26 21:56:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1124271006, now seen corresponding path program 2 times [2019-12-26 21:56:24,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:24,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364796297] [2019-12-26 21:56:24,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:24,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-26 21:56:24,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364796297] [2019-12-26 21:56:24,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:24,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:56:24,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404457638] [2019-12-26 21:56:24,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:56:24,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:24,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:56:24,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:56:24,250 INFO L87 Difference]: Start difference. First operand 19756 states and 60682 transitions. Second operand 10 states. [2019-12-26 21:56:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:26,212 INFO L93 Difference]: Finished difference Result 35790 states and 109621 transitions. [2019-12-26 21:56:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:56:26,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-26 21:56:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:26,253 INFO L225 Difference]: With dead ends: 35790 [2019-12-26 21:56:26,253 INFO L226 Difference]: Without dead ends: 27423 [2019-12-26 21:56:26,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:56:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27423 states. [2019-12-26 21:56:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27423 to 20479. [2019-12-26 21:56:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20479 states. [2019-12-26 21:56:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20479 states to 20479 states and 62669 transitions. [2019-12-26 21:56:26,610 INFO L78 Accepts]: Start accepts. Automaton has 20479 states and 62669 transitions. Word has length 58 [2019-12-26 21:56:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:26,610 INFO L462 AbstractCegarLoop]: Abstraction has 20479 states and 62669 transitions. [2019-12-26 21:56:26,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:56:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 20479 states and 62669 transitions. [2019-12-26 21:56:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:26,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:26,630 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-26 21:56:26,630 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-26 21:56:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash 755166698, now seen corresponding path program 3 times [2019-12-26 21:56:26,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:26,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231685123] [2019-12-26 21:56:26,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:26,799 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-26 21:56:26,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231685123] [2019-12-26 21:56:26,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:26,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:26,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179688055] [2019-12-26 21:56:26,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:26,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:26,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:26,800 INFO L87 Difference]: Start difference. First operand 20479 states and 62669 transitions. Second operand 11 states. [2019-12-26 21:56:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:28,571 INFO L93 Difference]: Finished difference Result 32153 states and 97485 transitions. [2019-12-26 21:56:28,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:56:28,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-26 21:56:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:28,612 INFO L225 Difference]: With dead ends: 32153 [2019-12-26 21:56:28,612 INFO L226 Difference]: Without dead ends: 27735 [2019-12-26 21:56:28,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:56:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27735 states. [2019-12-26 21:56:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27735 to 20513. [2019-12-26 21:56:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20513 states. [2019-12-26 21:56:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 62504 transitions. [2019-12-26 21:56:28,974 INFO L78 Accepts]: Start accepts. Automaton has 20513 states and 62504 transitions. Word has length 58 [2019-12-26 21:56:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:28,974 INFO L462 AbstractCegarLoop]: Abstraction has 20513 states and 62504 transitions. [2019-12-26 21:56:28,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 20513 states and 62504 transitions. [2019-12-26 21:56:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:28,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:28,994 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-26 21:56:28,995 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-26 21:56:28,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1780291492, now seen corresponding path program 4 times [2019-12-26 21:56:28,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:28,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039133315] [2019-12-26 21:56:28,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:29,168 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-26 21:56:29,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039133315] [2019-12-26 21:56:29,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:29,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:29,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212144344] [2019-12-26 21:56:29,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:29,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:29,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:29,170 INFO L87 Difference]: Start difference. First operand 20513 states and 62504 transitions. Second operand 11 states. [2019-12-26 21:56:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:30,910 INFO L93 Difference]: Finished difference Result 29123 states and 88177 transitions. [2019-12-26 21:56:30,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:56:30,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-26 21:56:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:30,952 INFO L225 Difference]: With dead ends: 29123 [2019-12-26 21:56:30,952 INFO L226 Difference]: Without dead ends: 27635 [2019-12-26 21:56:30,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:56:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27635 states. [2019-12-26 21:56:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27635 to 20613. [2019-12-26 21:56:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20613 states. [2019-12-26 21:56:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20613 states to 20613 states and 62730 transitions. [2019-12-26 21:56:31,311 INFO L78 Accepts]: Start accepts. Automaton has 20613 states and 62730 transitions. Word has length 58 [2019-12-26 21:56:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:31,312 INFO L462 AbstractCegarLoop]: Abstraction has 20613 states and 62730 transitions. [2019-12-26 21:56:31,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20613 states and 62730 transitions. [2019-12-26 21:56:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:31,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:31,333 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-26 21:56:31,333 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-26 21:56:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1512869174, now seen corresponding path program 5 times [2019-12-26 21:56:31,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:31,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650865640] [2019-12-26 21:56:31,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:31,393 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-26 21:56:31,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650865640] [2019-12-26 21:56:31,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:31,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:56:31,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073916420] [2019-12-26 21:56:31,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:56:31,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:56:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:31,395 INFO L87 Difference]: Start difference. First operand 20613 states and 62730 transitions. Second operand 3 states. [2019-12-26 21:56:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:31,483 INFO L93 Difference]: Finished difference Result 20613 states and 62728 transitions. [2019-12-26 21:56:31,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:56:31,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 21:56:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:31,530 INFO L225 Difference]: With dead ends: 20613 [2019-12-26 21:56:31,530 INFO L226 Difference]: Without dead ends: 20613 [2019-12-26 21:56:31,531 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-26 21:56:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20613 states. [2019-12-26 21:56:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20613 to 17582. [2019-12-26 21:56:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17582 states. [2019-12-26 21:56:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17582 states to 17582 states and 54421 transitions. [2019-12-26 21:56:32,057 INFO L78 Accepts]: Start accepts. Automaton has 17582 states and 54421 transitions. Word has length 58 [2019-12-26 21:56:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:32,057 INFO L462 AbstractCegarLoop]: Abstraction has 17582 states and 54421 transitions. [2019-12-26 21:56:32,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 17582 states and 54421 transitions. [2019-12-26 21:56:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:56:32,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:32,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:56:32,076 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-26 21:56:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:32,076 INFO L82 PathProgramCache]: Analyzing trace with hash -286713595, now seen corresponding path program 1 times [2019-12-26 21:56:32,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:32,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015813115] [2019-12-26 21:56:32,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:32,265 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-26 21:56:32,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015813115] [2019-12-26 21:56:32,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:32,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:32,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633937065] [2019-12-26 21:56:32,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:32,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:32,269 INFO L87 Difference]: Start difference. First operand 17582 states and 54421 transitions. Second operand 11 states. [2019-12-26 21:56:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:34,610 INFO L93 Difference]: Finished difference Result 29488 states and 89847 transitions. [2019-12-26 21:56:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 21:56:34,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 21:56:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:34,649 INFO L225 Difference]: With dead ends: 29488 [2019-12-26 21:56:34,649 INFO L226 Difference]: Without dead ends: 24996 [2019-12-26 21:56:34,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2019-12-26 21:56:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24996 states. [2019-12-26 21:56:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24996 to 17846. [2019-12-26 21:56:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17846 states. [2019-12-26 21:56:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17846 states to 17846 states and 54962 transitions. [2019-12-26 21:56:34,963 INFO L78 Accepts]: Start accepts. Automaton has 17846 states and 54962 transitions. Word has length 59 [2019-12-26 21:56:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:34,963 INFO L462 AbstractCegarLoop]: Abstraction has 17846 states and 54962 transitions. [2019-12-26 21:56:34,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17846 states and 54962 transitions. [2019-12-26 21:56:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:56:34,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:34,985 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-26 21:56:34,985 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-26 21:56:34,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:34,985 INFO L82 PathProgramCache]: Analyzing trace with hash 490336035, now seen corresponding path program 2 times [2019-12-26 21:56:34,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:34,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345776431] [2019-12-26 21:56:34,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:35,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-26 21:56:35,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345776431] [2019-12-26 21:56:35,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:35,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 21:56:35,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173251974] [2019-12-26 21:56:35,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 21:56:35,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:35,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 21:56:35,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:56:35,400 INFO L87 Difference]: Start difference. First operand 17846 states and 54962 transitions. Second operand 14 states. [2019-12-26 21:56:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:39,191 INFO L93 Difference]: Finished difference Result 26964 states and 82107 transitions. [2019-12-26 21:56:39,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-26 21:56:39,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-12-26 21:56:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:39,230 INFO L225 Difference]: With dead ends: 26964 [2019-12-26 21:56:39,230 INFO L226 Difference]: Without dead ends: 26144 [2019-12-26 21:56:39,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 21:56:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26144 states. [2019-12-26 21:56:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26144 to 18082. [2019-12-26 21:56:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18082 states. [2019-12-26 21:56:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18082 states to 18082 states and 55593 transitions. [2019-12-26 21:56:39,552 INFO L78 Accepts]: Start accepts. Automaton has 18082 states and 55593 transitions. Word has length 59 [2019-12-26 21:56:39,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:39,552 INFO L462 AbstractCegarLoop]: Abstraction has 18082 states and 55593 transitions. [2019-12-26 21:56:39,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 21:56:39,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18082 states and 55593 transitions. [2019-12-26 21:56:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:56:39,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:39,570 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-26 21:56:39,570 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-26 21:56:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:39,571 INFO L82 PathProgramCache]: Analyzing trace with hash 235346217, now seen corresponding path program 3 times [2019-12-26 21:56:39,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:39,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874327441] [2019-12-26 21:56:39,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:39,805 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-26 21:56:39,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874327441] [2019-12-26 21:56:39,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:39,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:39,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049176066] [2019-12-26 21:56:39,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:39,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:39,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:39,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:39,807 INFO L87 Difference]: Start difference. First operand 18082 states and 55593 transitions. Second operand 11 states. [2019-12-26 21:56:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:40,808 INFO L93 Difference]: Finished difference Result 32368 states and 99673 transitions. [2019-12-26 21:56:40,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:56:40,808 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 21:56:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:40,854 INFO L225 Difference]: With dead ends: 32368 [2019-12-26 21:56:40,855 INFO L226 Difference]: Without dead ends: 31802 [2019-12-26 21:56:40,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:56:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31802 states. [2019-12-26 21:56:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31802 to 20916. [2019-12-26 21:56:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20916 states. [2019-12-26 21:56:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20916 states to 20916 states and 64415 transitions. [2019-12-26 21:56:41,259 INFO L78 Accepts]: Start accepts. Automaton has 20916 states and 64415 transitions. Word has length 59 [2019-12-26 21:56:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:41,259 INFO L462 AbstractCegarLoop]: Abstraction has 20916 states and 64415 transitions. [2019-12-26 21:56:41,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 20916 states and 64415 transitions. [2019-12-26 21:56:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:56:41,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:41,280 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-26 21:56:41,281 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-26 21:56:41,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1674144661, now seen corresponding path program 4 times [2019-12-26 21:56:41,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:41,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914276258] [2019-12-26 21:56:41,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:41,556 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-26 21:56:41,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914276258] [2019-12-26 21:56:41,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:41,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:41,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447418328] [2019-12-26 21:56:41,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:41,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:41,559 INFO L87 Difference]: Start difference. First operand 20916 states and 64415 transitions. Second operand 11 states. [2019-12-26 21:56:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:42,652 INFO L93 Difference]: Finished difference Result 32408 states and 99113 transitions. [2019-12-26 21:56:42,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:56:42,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 21:56:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:42,692 INFO L225 Difference]: With dead ends: 32408 [2019-12-26 21:56:42,693 INFO L226 Difference]: Without dead ends: 26807 [2019-12-26 21:56:42,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:56:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26807 states. [2019-12-26 21:56:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26807 to 17228. [2019-12-26 21:56:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17228 states. [2019-12-26 21:56:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17228 states to 17228 states and 53135 transitions. [2019-12-26 21:56:43,023 INFO L78 Accepts]: Start accepts. Automaton has 17228 states and 53135 transitions. Word has length 59 [2019-12-26 21:56:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:43,023 INFO L462 AbstractCegarLoop]: Abstraction has 17228 states and 53135 transitions. [2019-12-26 21:56:43,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 17228 states and 53135 transitions. [2019-12-26 21:56:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:56:43,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:43,041 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-26 21:56:43,042 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-26 21:56:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1304528589, now seen corresponding path program 5 times [2019-12-26 21:56:43,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:43,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368218041] [2019-12-26 21:56:43,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:43,241 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-26 21:56:43,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368218041] [2019-12-26 21:56:43,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:43,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:56:43,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823270651] [2019-12-26 21:56:43,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:56:43,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:43,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:56:43,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:56:43,243 INFO L87 Difference]: Start difference. First operand 17228 states and 53135 transitions. Second operand 12 states. [2019-12-26 21:56:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:45,588 INFO L93 Difference]: Finished difference Result 24404 states and 74206 transitions. [2019-12-26 21:56:45,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 21:56:45,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-26 21:56:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:45,622 INFO L225 Difference]: With dead ends: 24404 [2019-12-26 21:56:45,622 INFO L226 Difference]: Without dead ends: 23326 [2019-12-26 21:56:45,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-26 21:56:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23326 states. [2019-12-26 21:56:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23326 to 16678. [2019-12-26 21:56:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16678 states. [2019-12-26 21:56:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16678 states to 16678 states and 51651 transitions. [2019-12-26 21:56:45,943 INFO L78 Accepts]: Start accepts. Automaton has 16678 states and 51651 transitions. Word has length 59 [2019-12-26 21:56:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:45,943 INFO L462 AbstractCegarLoop]: Abstraction has 16678 states and 51651 transitions. [2019-12-26 21:56:45,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:56:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 16678 states and 51651 transitions. [2019-12-26 21:56:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:56:45,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:45,961 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-26 21:56:45,961 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-26 21:56:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:45,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 6 times [2019-12-26 21:56:45,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:45,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116505888] [2019-12-26 21:56:45,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:56:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:56:46,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:56:46,072 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:56:46,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~x~0_72 0) (= v_~y$w_buff1_used~0_529 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff1_thd1~0_122 0) (= 0 v_~y$w_buff0~0_386) (= 0 v_~y$r_buff0_thd2~0_330) (= v_~__unbuffered_cnt~0_187 0) (= v_~main$tmp_guard1~0_42 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~y~0_163 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= 0 v_~y$flush_delayed~0_49) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$r_buff0_thd1~0_36 0) (= v_~y$w_buff0_used~0_832 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t605~0.base_29|) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t605~0.base_29| 4) |v_#length_31|) (= (select .cse0 |v_ULTIMATE.start_main_~#t605~0.base_29|) 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~y$r_buff1_thd4~0_202) (= v_~a~0_49 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_29|) |v_ULTIMATE.start_main_~#t605~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~y$r_buff1_thd2~0_315) (= v_~y$r_buff0_thd0~0_117 0) (= 0 |v_#NULL.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_~#t605~0.base_29| 1) |v_#valid_72|) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= v_~weak$$choice2~0_186 0) (= v_~y$r_buff1_thd0~0_220 0) (= 0 |v_ULTIMATE.start_main_~#t605~0.offset_21|) (= v_~z~0_163 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_29|, ULTIMATE.start_main_~#t605~0.offset=|v_ULTIMATE.start_main_~#t605~0.offset_21|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_49, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_189, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, ~y$flush_delayed~0=v_~y$flush_delayed~0_49, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, #length=|v_#length_31|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_21|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_29|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_202, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_330, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t605~0.base=|v_ULTIMATE.start_main_~#t605~0.base_29|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_832, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_21|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_29|, ~y~0=v_~y~0_163, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_48, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_315, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_117, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t605~0.offset, 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, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t607~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ULTIMATE.start_main_~#t608~0.offset, ~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, ULTIMATE.start_main_~#t605~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t606~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t606~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t608~0.base, 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-26 21:56:46,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t606~0.offset_10|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t606~0.base_12| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t606~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12|) |v_ULTIMATE.start_main_~#t606~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t606~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t606~0.offset, ULTIMATE.start_main_~#t606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 21:56:46,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13|) |v_ULTIMATE.start_main_~#t607~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t607~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t607~0.base_13|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t607~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t607~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_13|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t607~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 21:56:46,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd4~0_25 v_~y$r_buff1_thd4~0_25) (= v_~y$r_buff0_thd3~0_17 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24 0)) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff1_thd2~0_32) (= v_~z~0_10 1) (= v_~y$r_buff0_thd0~0_19 v_~y$r_buff1_thd0~0_17)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_32, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17} 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, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 21:56:46,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t608~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10|) |v_ULTIMATE.start_main_~#t608~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10|)) (= |v_ULTIMATE.start_main_~#t608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t608~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t608~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_10|, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t608~0.offset, ULTIMATE.start_main_~#t608~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:56:46,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_~x~0_36 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:56:46,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In80267309 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In80267309 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out80267309| ~y$w_buff1~0_In80267309)) (and (= |P3Thread1of1ForFork0_#t~ite32_Out80267309| ~y~0_In80267309) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In80267309, ~y$w_buff1~0=~y$w_buff1~0_In80267309, ~y~0=~y~0_In80267309, ~y$w_buff1_used~0=~y$w_buff1_used~0_In80267309} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In80267309, ~y$w_buff1~0=~y$w_buff1~0_In80267309, ~y~0=~y~0_In80267309, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out80267309|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In80267309} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-26 21:56:46,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_43 |v_P3Thread1of1ForFork0_#t~ite32_14|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_14|} OutVars{~y~0=v_~y~0_43, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_15|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_13|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-26 21:56:46,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In-898522060 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-898522060 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out-898522060| ~y$w_buff0_used~0_In-898522060) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-898522060|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-898522060, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-898522060} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-898522060, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-898522060, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-898522060|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-26 21:56:46,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-997197677 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-997197677 256)))) (or (and (= ~y$w_buff0_used~0_In-997197677 |P2Thread1of1ForFork3_#t~ite28_Out-997197677|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-997197677| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-997197677, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-997197677} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-997197677, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-997197677, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-997197677|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-26 21:56:46,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-1591357792 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1591357792 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1591357792 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1591357792 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1591357792|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1591357792 |P2Thread1of1ForFork3_#t~ite29_Out-1591357792|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1591357792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1591357792, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1591357792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1591357792} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1591357792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1591357792, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1591357792, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1591357792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1591357792} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-26 21:56:46,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-541807556 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-541807556 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-541807556 0)) (and (= ~y$r_buff0_thd3~0_Out-541807556 ~y$r_buff0_thd3~0_In-541807556) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-541807556, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-541807556} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-541807556|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-541807556, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-541807556} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 21:56:46,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In485011376 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In485011376 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In485011376 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In485011376 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out485011376| ~y$r_buff1_thd3~0_In485011376) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork3_#t~ite31_Out485011376| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In485011376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In485011376, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In485011376, ~y$w_buff1_used~0=~y$w_buff1_used~0_In485011376} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In485011376, ~y$w_buff0_used~0=~y$w_buff0_used~0_In485011376, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In485011376, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out485011376|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In485011376} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-26 21:56:46,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L804-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_125) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, 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-26 21:56:46,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In-1701400437 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1701400437 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1701400437 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In-1701400437 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-1701400437| ~y$w_buff1_used~0_In-1701400437) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-1701400437|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1701400437, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1701400437, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701400437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701400437} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1701400437, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1701400437, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701400437, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1701400437|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701400437} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-26 21:56:46,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In-211845818 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-211845818 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-211845818| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-211845818| ~y$r_buff0_thd4~0_In-211845818)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-211845818, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211845818} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-211845818, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211845818, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-211845818|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-26 21:56:46,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In479408002 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In479408002 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In479408002 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In479408002 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out479408002| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd4~0_In479408002 |P3Thread1of1ForFork0_#t~ite37_Out479408002|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In479408002, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In479408002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In479408002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In479408002} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In479408002, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In479408002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In479408002, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out479408002|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In479408002} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-26 21:56:46,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L827-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P3Thread1of1ForFork0_#t~ite37_48| v_~y$r_buff1_thd4~0_61) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_61, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_47|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} 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-26 21:56:46,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In863389006 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_In863389006| |P1Thread1of1ForFork2_#t~ite8_Out863389006|) (not .cse0) (= ~y$w_buff0~0_In863389006 |P1Thread1of1ForFork2_#t~ite9_Out863389006|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In863389006 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In863389006 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In863389006 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In863389006 256)) .cse1))) (= ~y$w_buff0~0_In863389006 |P1Thread1of1ForFork2_#t~ite8_Out863389006|) .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out863389006| |P1Thread1of1ForFork2_#t~ite8_Out863389006|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In863389006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In863389006, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In863389006|, ~y$w_buff0~0=~y$w_buff0~0_In863389006, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In863389006, ~weak$$choice2~0=~weak$$choice2~0_In863389006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In863389006} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In863389006, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out863389006|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In863389006, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out863389006|, ~y$w_buff0~0=~y$w_buff0~0_In863389006, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In863389006, ~weak$$choice2~0=~weak$$choice2~0_In863389006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In863389006} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 21:56:46,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-681838669 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out-681838669| ~y$w_buff0_used~0_In-681838669) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-681838669| |P1Thread1of1ForFork2_#t~ite14_Out-681838669|)) (and .cse0 (= ~y$w_buff0_used~0_In-681838669 |P1Thread1of1ForFork2_#t~ite14_Out-681838669|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-681838669 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-681838669 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-681838669 256))) (and (= 0 (mod ~y$r_buff1_thd2~0_In-681838669 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite15_Out-681838669| |P1Thread1of1ForFork2_#t~ite14_Out-681838669|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-681838669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-681838669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-681838669, ~weak$$choice2~0=~weak$$choice2~0_In-681838669, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-681838669|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681838669} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-681838669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-681838669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-681838669, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-681838669|, ~weak$$choice2~0=~weak$$choice2~0_In-681838669, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-681838669|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681838669} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 21:56:46,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 21:56:46,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-752195637 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out-752195637| ~y$r_buff1_thd2~0_In-752195637) (= |P1Thread1of1ForFork2_#t~ite23_In-752195637| |P1Thread1of1ForFork2_#t~ite23_Out-752195637|)) (and (= ~y$r_buff1_thd2~0_In-752195637 |P1Thread1of1ForFork2_#t~ite23_Out-752195637|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-752195637 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-752195637 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-752195637 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-752195637 256)))) (= |P1Thread1of1ForFork2_#t~ite24_Out-752195637| |P1Thread1of1ForFork2_#t~ite23_Out-752195637|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-752195637, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752195637, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-752195637, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-752195637|, ~weak$$choice2~0=~weak$$choice2~0_In-752195637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752195637} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-752195637, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752195637, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-752195637, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-752195637|, ~weak$$choice2~0=~weak$$choice2~0_In-752195637, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-752195637|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752195637} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 21:56:46,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_~y~0_19 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:56:46,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:56:46,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-487317593 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-487317593| |ULTIMATE.start_main_#t~ite43_Out-487317593|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-487317593 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite42_Out-487317593| ~y~0_In-487317593)) (and (not .cse1) .cse2 (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-487317593| ~y$w_buff1~0_In-487317593)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-487317593, ~y~0=~y~0_In-487317593, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-487317593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487317593} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-487317593, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-487317593|, ~y~0=~y~0_In-487317593, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-487317593|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-487317593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487317593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:56:46,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In258027767 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In258027767 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out258027767|) (not .cse1)) (and (= ~y$w_buff0_used~0_In258027767 |ULTIMATE.start_main_#t~ite44_Out258027767|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In258027767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258027767} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In258027767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258027767, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out258027767|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:56:46,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1128918884 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1128918884 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1128918884 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1128918884 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1128918884 |ULTIMATE.start_main_#t~ite45_Out1128918884|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1128918884|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1128918884, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1128918884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1128918884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128918884} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1128918884, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1128918884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1128918884, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1128918884|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128918884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:56:46,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In929093135 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In929093135 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite46_Out929093135|)) (and (= ~y$r_buff0_thd0~0_In929093135 |ULTIMATE.start_main_#t~ite46_Out929093135|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In929093135, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In929093135} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In929093135, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In929093135, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out929093135|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 21:56:46,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1805733586 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1805733586 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1805733586 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1805733586 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite47_Out1805733586| ~y$r_buff1_thd0~0_In1805733586)) (and (= |ULTIMATE.start_main_#t~ite47_Out1805733586| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1805733586, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1805733586, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1805733586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1805733586} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1805733586, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1805733586, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1805733586|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1805733586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1805733586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:56:46,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_26) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y$r_buff1_thd0~0_153 |v_ULTIMATE.start_main_#t~ite47_41|) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_45 2) (= v_~main$tmp_guard1~0_19 0) (= v_~z~0_103 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_41|, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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-26 21:56:46,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:56:46 BasicIcfg [2019-12-26 21:56:46,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:56:46,194 INFO L168 Benchmark]: Toolchain (without parser) took 135774.11 ms. Allocated memory was 138.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-26 21:56:46,198 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:56:46,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.73 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 156.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:56:46,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.44 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:56:46,199 INFO L168 Benchmark]: Boogie Preprocessor took 37.02 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:56:46,199 INFO L168 Benchmark]: RCFGBuilder took 801.91 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 101.8 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:56:46,205 INFO L168 Benchmark]: TraceAbstraction took 134072.67 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 21:56:46,207 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.97 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.73 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 156.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.44 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.02 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.91 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 101.8 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134072.67 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.6s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 7917 VarBasedMoverChecksPositive, 267 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 235 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66461 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L848] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L850] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L800] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L852] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L823] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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=2] [L763] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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=2] [L800] 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) [L763] 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) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 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 [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 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)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, 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=2] [L765] 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)) [L766] 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)) [L767] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, 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=2] [L767] 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)) [L769] 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)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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=2] [L858] EXPR 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=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=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 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 [L861] 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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 133.7s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 45.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6587 SDtfs, 9459 SDslu, 27023 SDs, 0 SdLazy, 19059 SolverSat, 498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 46 SyntacticMatches, 16 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160898occurred 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: 43.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 223326 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1306 NumberOfCodeBlocks, 1306 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1220 ConstructedInterpolants, 0 QuantifiedInterpolants, 244588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...