/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:46:56,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:46:56,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:46:56,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:46:56,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:46:56,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:46:56,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:46:56,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:46:56,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:46:56,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:46:56,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:46:56,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:46:56,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:46:56,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:46:56,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:46:56,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:46:56,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:46:56,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:46:56,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:46:56,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:46:56,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:46:56,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:46:56,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:46:56,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:46:56,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:46:56,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:46:56,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:46:56,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:46:56,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:46:56,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:46:56,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:46:56,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:46:56,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:46:56,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:46:56,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:46:56,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:46:56,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:46:56,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:46:56,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:46:56,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:46:56,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:46:56,293 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:46:56,307 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:46:56,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:46:56,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:46:56,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:46:56,309 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:46:56,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:46:56,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:46:56,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:46:56,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:46:56,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:46:56,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:46:56,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:46:56,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:46:56,310 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:46:56,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:46:56,311 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:46:56,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:46:56,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:46:56,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:46:56,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:46:56,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:46:56,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:46:56,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:46:56,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:46:56,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:46:56,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:46:56,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:46:56,313 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:46:56,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:46:56,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:46:56,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:46:56,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:46:56,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:46:56,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:46:56,629 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:46:56,630 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-18 20:46:56,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9594231/9464b7657e3944a3adadb7f66349be29/FLAG30842adc0 [2019-12-18 20:46:57,235 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:46:57,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-18 20:46:57,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9594231/9464b7657e3944a3adadb7f66349be29/FLAG30842adc0 [2019-12-18 20:46:57,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9594231/9464b7657e3944a3adadb7f66349be29 [2019-12-18 20:46:57,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:46:57,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:46:57,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:46:57,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:46:57,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:46:57,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:46:57" (1/1) ... [2019-12-18 20:46:57,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32100126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:57, skipping insertion in model container [2019-12-18 20:46:57,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:46:57" (1/1) ... [2019-12-18 20:46:57,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:46:57,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:46:58,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:46:58,171 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:46:58,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:46:58,322 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:46:58,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58 WrapperNode [2019-12-18 20:46:58,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:46:58,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:46:58,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:46:58,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:46:58,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:46:58,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:46:58,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:46:58,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:46:58,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... [2019-12-18 20:46:58,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:46:58,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:46:58,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:46:58,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:46:58,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:46:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:46:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:46:58,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:46:58,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:46:58,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:46:58,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:46:58,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:46:58,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:46:58,516 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:46:58,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:46:58,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:46:58,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:46:58,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:46:58,518 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:46:59,290 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:46:59,290 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:46:59,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:46:59 BoogieIcfgContainer [2019-12-18 20:46:59,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:46:59,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:46:59,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:46:59,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:46:59,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:46:57" (1/3) ... [2019-12-18 20:46:59,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e82a6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:46:59, skipping insertion in model container [2019-12-18 20:46:59,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:46:58" (2/3) ... [2019-12-18 20:46:59,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e82a6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:46:59, skipping insertion in model container [2019-12-18 20:46:59,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:46:59" (3/3) ... [2019-12-18 20:46:59,301 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.opt.i [2019-12-18 20:46:59,311 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:46:59,312 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:46:59,320 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:46:59,321 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:46:59,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,363 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,364 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,390 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,415 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,415 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,428 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,437 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,438 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,443 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,443 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:46:59,466 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:46:59,487 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:46:59,487 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:46:59,487 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:46:59,487 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:46:59,487 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:46:59,487 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:46:59,487 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:46:59,487 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:46:59,504 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 20:46:59,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 20:46:59,587 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 20:46:59,588 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:46:59,612 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:46:59,637 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 20:46:59,734 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 20:46:59,734 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:46:59,745 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:46:59,768 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 20:46:59,770 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:47:03,621 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 20:47:03,799 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 20:47:03,821 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-18 20:47:03,822 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 20:47:03,826 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-18 20:47:13,775 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-18 20:47:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-18 20:47:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:47:13,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:13,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:47:13,784 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-18 20:47:13,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:13,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288949040] [2019-12-18 20:47:13,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:14,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288949040] [2019-12-18 20:47:14,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:14,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:47:14,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452929516] [2019-12-18 20:47:14,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:14,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:14,050 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-18 20:47:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:15,347 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-18 20:47:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:15,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:47:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:15,862 INFO L225 Difference]: With dead ends: 81762 [2019-12-18 20:47:15,862 INFO L226 Difference]: Without dead ends: 77082 [2019-12-18 20:47:15,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-18 20:47:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-18 20:47:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-18 20:47:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-18 20:47:24,668 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-18 20:47:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:24,669 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-18 20:47:24,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-18 20:47:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:47:24,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:24,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:24,678 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-18 20:47:24,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:24,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413435305] [2019-12-18 20:47:24,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:24,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413435305] [2019-12-18 20:47:24,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:24,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:47:24,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217971501] [2019-12-18 20:47:24,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:24,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:24,761 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-18 20:47:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:25,043 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-18 20:47:25,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:25,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:47:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:25,111 INFO L225 Difference]: With dead ends: 20478 [2019-12-18 20:47:25,111 INFO L226 Difference]: Without dead ends: 20478 [2019-12-18 20:47:25,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-18 20:47:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-18 20:47:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-18 20:47:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-18 20:47:25,675 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-18 20:47:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:25,675 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-18 20:47:25,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-18 20:47:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:47:25,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:25,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:25,678 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-18 20:47:25,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:25,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483830697] [2019-12-18 20:47:25,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:25,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483830697] [2019-12-18 20:47:25,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:25,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:47:25,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010515181] [2019-12-18 20:47:25,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:47:25,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:25,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:47:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:47:25,804 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-18 20:47:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:27,496 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-18 20:47:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:47:27,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:47:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:27,604 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 20:47:27,604 INFO L226 Difference]: Without dead ends: 30788 [2019-12-18 20:47:27,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-18 20:47:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-18 20:47:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-18 20:47:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-18 20:47:28,424 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-18 20:47:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:28,425 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-18 20:47:28,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:47:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-18 20:47:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:47:28,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:28,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:28,428 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:28,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-18 20:47:28,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:28,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133366654] [2019-12-18 20:47:28,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:28,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-18 20:47:28,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133366654] [2019-12-18 20:47:28,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:28,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:47:28,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196835172] [2019-12-18 20:47:28,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:47:28,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:28,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:47:28,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:47:28,517 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-18 20:47:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:28,853 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-18 20:47:28,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:47:28,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:47:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:28,958 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 20:47:28,958 INFO L226 Difference]: Without dead ends: 35512 [2019-12-18 20:47:28,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-18 20:47:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-18 20:47:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-18 20:47:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-18 20:47:30,017 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-18 20:47:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:30,018 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-18 20:47:30,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:47:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-18 20:47:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:47:30,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:30,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:30,021 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-18 20:47:30,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:30,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136957034] [2019-12-18 20:47:30,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:30,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136957034] [2019-12-18 20:47:30,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:30,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:47:30,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954694132] [2019-12-18 20:47:30,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:47:30,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:47:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:47:30,096 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-18 20:47:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:30,502 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-18 20:47:30,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:47:30,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:47:30,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:30,599 INFO L225 Difference]: With dead ends: 38443 [2019-12-18 20:47:30,599 INFO L226 Difference]: Without dead ends: 38432 [2019-12-18 20:47:30,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-18 20:47:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-18 20:47:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-18 20:47:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-18 20:47:31,573 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-18 20:47:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:31,574 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-18 20:47:31,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:47:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-18 20:47:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:47:31,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:31,584 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] [2019-12-18 20:47:31,584 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:31,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-18 20:47:31,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:31,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20309761] [2019-12-18 20:47:31,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:31,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20309761] [2019-12-18 20:47:31,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:31,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:47:31,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140840087] [2019-12-18 20:47:31,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:47:31,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:31,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:47:31,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:31,705 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-18 20:47:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:32,300 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-18 20:47:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:47:32,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:47:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:32,382 INFO L225 Difference]: With dead ends: 45281 [2019-12-18 20:47:32,382 INFO L226 Difference]: Without dead ends: 45258 [2019-12-18 20:47:32,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-18 20:47:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-18 20:47:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-18 20:47:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-18 20:47:33,487 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-18 20:47:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:33,488 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-18 20:47:33,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:47:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-18 20:47:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:47:33,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:33,498 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] [2019-12-18 20:47:33,499 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-18 20:47:33,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:33,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896717615] [2019-12-18 20:47:33,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:33,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896717615] [2019-12-18 20:47:33,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:33,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:47:33,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401553298] [2019-12-18 20:47:33,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:47:33,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:33,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:47:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:33,622 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-18 20:47:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:34,214 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-18 20:47:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:47:34,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:47:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:34,298 INFO L225 Difference]: With dead ends: 46044 [2019-12-18 20:47:34,299 INFO L226 Difference]: Without dead ends: 46021 [2019-12-18 20:47:34,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-18 20:47:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-18 20:47:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-18 20:47:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-18 20:47:34,939 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-18 20:47:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:34,940 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-18 20:47:34,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:47:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-18 20:47:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:47:34,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:34,951 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] [2019-12-18 20:47:34,951 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:34,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-18 20:47:34,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:34,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526798437] [2019-12-18 20:47:34,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:35,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526798437] [2019-12-18 20:47:35,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:35,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:47:35,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505855890] [2019-12-18 20:47:35,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:47:35,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:47:35,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:47:35,003 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-18 20:47:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:35,064 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-18 20:47:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:47:35,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:47:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:35,083 INFO L225 Difference]: With dead ends: 11657 [2019-12-18 20:47:35,083 INFO L226 Difference]: Without dead ends: 11657 [2019-12-18 20:47:35,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:47:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-18 20:47:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-18 20:47:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-18 20:47:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-18 20:47:35,250 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-18 20:47:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:35,250 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-18 20:47:35,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:47:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-18 20:47:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:47:35,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:35,467 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] [2019-12-18 20:47:35,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-18 20:47:35,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:35,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819088667] [2019-12-18 20:47:35,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:35,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819088667] [2019-12-18 20:47:35,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:35,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:47:35,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621090525] [2019-12-18 20:47:35,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:35,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:35,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:35,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:35,529 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-18 20:47:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:35,577 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-18 20:47:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:35,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:47:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:35,602 INFO L225 Difference]: With dead ends: 11488 [2019-12-18 20:47:35,602 INFO L226 Difference]: Without dead ends: 11488 [2019-12-18 20:47:35,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-18 20:47:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-18 20:47:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-18 20:47:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-18 20:47:35,862 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-18 20:47:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:35,862 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-18 20:47:35,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-18 20:47:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:47:35,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:35,886 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] [2019-12-18 20:47:35,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:35,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:35,887 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-18 20:47:35,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:35,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684176198] [2019-12-18 20:47:35,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:35,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684176198] [2019-12-18 20:47:35,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:35,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:47:35,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995743833] [2019-12-18 20:47:35,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:47:35,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:35,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:47:35,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:35,982 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-18 20:47:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:36,547 INFO L93 Difference]: Finished difference Result 17261 states and 52536 transitions. [2019-12-18 20:47:36,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:47:36,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:47:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:36,572 INFO L225 Difference]: With dead ends: 17261 [2019-12-18 20:47:36,572 INFO L226 Difference]: Without dead ends: 17261 [2019-12-18 20:47:36,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:47:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17261 states. [2019-12-18 20:47:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17261 to 15423. [2019-12-18 20:47:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15423 states. [2019-12-18 20:47:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15423 states to 15423 states and 47364 transitions. [2019-12-18 20:47:36,814 INFO L78 Accepts]: Start accepts. Automaton has 15423 states and 47364 transitions. Word has length 40 [2019-12-18 20:47:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:36,815 INFO L462 AbstractCegarLoop]: Abstraction has 15423 states and 47364 transitions. [2019-12-18 20:47:36,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:47:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 15423 states and 47364 transitions. [2019-12-18 20:47:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:47:36,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:36,838 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] [2019-12-18 20:47:36,838 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1253428480, now seen corresponding path program 2 times [2019-12-18 20:47:36,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:36,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056862677] [2019-12-18 20:47:36,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:36,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056862677] [2019-12-18 20:47:36,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:36,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:47:36,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939890408] [2019-12-18 20:47:36,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:47:36,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:36,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:47:36,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:47:36,979 INFO L87 Difference]: Start difference. First operand 15423 states and 47364 transitions. Second operand 6 states. [2019-12-18 20:47:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:37,763 INFO L93 Difference]: Finished difference Result 28477 states and 87094 transitions. [2019-12-18 20:47:37,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:47:37,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 20:47:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:37,807 INFO L225 Difference]: With dead ends: 28477 [2019-12-18 20:47:37,807 INFO L226 Difference]: Without dead ends: 28477 [2019-12-18 20:47:37,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28477 states. [2019-12-18 20:47:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28477 to 17256. [2019-12-18 20:47:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17256 states. [2019-12-18 20:47:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17256 states to 17256 states and 53163 transitions. [2019-12-18 20:47:38,159 INFO L78 Accepts]: Start accepts. Automaton has 17256 states and 53163 transitions. Word has length 40 [2019-12-18 20:47:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:38,160 INFO L462 AbstractCegarLoop]: Abstraction has 17256 states and 53163 transitions. [2019-12-18 20:47:38,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:47:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 17256 states and 53163 transitions. [2019-12-18 20:47:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:47:38,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:38,185 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] [2019-12-18 20:47:38,185 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1511982952, now seen corresponding path program 3 times [2019-12-18 20:47:38,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:38,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959961844] [2019-12-18 20:47:38,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:38,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959961844] [2019-12-18 20:47:38,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:38,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:47:38,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951133134] [2019-12-18 20:47:38,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:47:38,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:38,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:47:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:38,246 INFO L87 Difference]: Start difference. First operand 17256 states and 53163 transitions. Second operand 5 states. [2019-12-18 20:47:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:38,423 INFO L93 Difference]: Finished difference Result 15919 states and 49702 transitions. [2019-12-18 20:47:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:47:38,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:47:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:38,456 INFO L225 Difference]: With dead ends: 15919 [2019-12-18 20:47:38,456 INFO L226 Difference]: Without dead ends: 15919 [2019-12-18 20:47:38,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:47:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15919 states. [2019-12-18 20:47:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15919 to 15040. [2019-12-18 20:47:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15040 states. [2019-12-18 20:47:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15040 states to 15040 states and 47234 transitions. [2019-12-18 20:47:38,687 INFO L78 Accepts]: Start accepts. Automaton has 15040 states and 47234 transitions. Word has length 40 [2019-12-18 20:47:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:38,687 INFO L462 AbstractCegarLoop]: Abstraction has 15040 states and 47234 transitions. [2019-12-18 20:47:38,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:47:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15040 states and 47234 transitions. [2019-12-18 20:47:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:38,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:38,704 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] [2019-12-18 20:47:38,705 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-18 20:47:38,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:38,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768490268] [2019-12-18 20:47:38,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:38,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768490268] [2019-12-18 20:47:38,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:38,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:47:38,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429034138] [2019-12-18 20:47:38,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:47:38,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:38,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:47:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:47:38,759 INFO L87 Difference]: Start difference. First operand 15040 states and 47234 transitions. Second operand 3 states. [2019-12-18 20:47:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:38,860 INFO L93 Difference]: Finished difference Result 18782 states and 58182 transitions. [2019-12-18 20:47:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:47:38,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:47:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:38,897 INFO L225 Difference]: With dead ends: 18782 [2019-12-18 20:47:38,898 INFO L226 Difference]: Without dead ends: 18782 [2019-12-18 20:47:38,898 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-18 20:47:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18782 states. [2019-12-18 20:47:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18782 to 15823. [2019-12-18 20:47:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15823 states. [2019-12-18 20:47:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15823 states to 15823 states and 49541 transitions. [2019-12-18 20:47:39,248 INFO L78 Accepts]: Start accepts. Automaton has 15823 states and 49541 transitions. Word has length 54 [2019-12-18 20:47:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:39,249 INFO L462 AbstractCegarLoop]: Abstraction has 15823 states and 49541 transitions. [2019-12-18 20:47:39,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:47:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15823 states and 49541 transitions. [2019-12-18 20:47:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:39,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:39,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:39,268 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:39,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-18 20:47:39,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:39,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633568307] [2019-12-18 20:47:39,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:39,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633568307] [2019-12-18 20:47:39,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:39,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:47:39,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097904127] [2019-12-18 20:47:39,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:47:39,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:47:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:47:39,384 INFO L87 Difference]: Start difference. First operand 15823 states and 49541 transitions. Second operand 7 states. [2019-12-18 20:47:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:39,847 INFO L93 Difference]: Finished difference Result 39558 states and 123147 transitions. [2019-12-18 20:47:39,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:47:39,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:47:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:39,910 INFO L225 Difference]: With dead ends: 39558 [2019-12-18 20:47:39,910 INFO L226 Difference]: Without dead ends: 30506 [2019-12-18 20:47:39,912 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-18 20:47:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30506 states. [2019-12-18 20:47:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30506 to 19409. [2019-12-18 20:47:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19409 states. [2019-12-18 20:47:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19409 states to 19409 states and 60921 transitions. [2019-12-18 20:47:40,368 INFO L78 Accepts]: Start accepts. Automaton has 19409 states and 60921 transitions. Word has length 54 [2019-12-18 20:47:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:40,368 INFO L462 AbstractCegarLoop]: Abstraction has 19409 states and 60921 transitions. [2019-12-18 20:47:40,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:47:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 19409 states and 60921 transitions. [2019-12-18 20:47:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:40,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:40,395 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] [2019-12-18 20:47:40,395 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:40,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-18 20:47:40,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:40,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529014999] [2019-12-18 20:47:40,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:40,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529014999] [2019-12-18 20:47:40,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:40,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:47:40,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50805126] [2019-12-18 20:47:40,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:47:40,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:40,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:47:40,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:47:40,491 INFO L87 Difference]: Start difference. First operand 19409 states and 60921 transitions. Second operand 7 states. [2019-12-18 20:47:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:41,081 INFO L93 Difference]: Finished difference Result 46087 states and 141926 transitions. [2019-12-18 20:47:41,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:47:41,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:47:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:41,134 INFO L225 Difference]: With dead ends: 46087 [2019-12-18 20:47:41,134 INFO L226 Difference]: Without dead ends: 34024 [2019-12-18 20:47:41,134 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-18 20:47:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34024 states. [2019-12-18 20:47:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34024 to 23243. [2019-12-18 20:47:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23243 states. [2019-12-18 20:47:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23243 states to 23243 states and 72679 transitions. [2019-12-18 20:47:41,597 INFO L78 Accepts]: Start accepts. Automaton has 23243 states and 72679 transitions. Word has length 54 [2019-12-18 20:47:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:41,597 INFO L462 AbstractCegarLoop]: Abstraction has 23243 states and 72679 transitions. [2019-12-18 20:47:41,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:47:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 23243 states and 72679 transitions. [2019-12-18 20:47:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:41,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:41,633 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] [2019-12-18 20:47:41,633 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:41,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:41,633 INFO L82 PathProgramCache]: Analyzing trace with hash -229272590, now seen corresponding path program 3 times [2019-12-18 20:47:41,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:41,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517868029] [2019-12-18 20:47:41,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:41,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517868029] [2019-12-18 20:47:41,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:41,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:41,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766510618] [2019-12-18 20:47:41,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:47:41,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:41,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:47:41,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:41,773 INFO L87 Difference]: Start difference. First operand 23243 states and 72679 transitions. Second operand 9 states. [2019-12-18 20:47:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:43,754 INFO L93 Difference]: Finished difference Result 122841 states and 378489 transitions. [2019-12-18 20:47:43,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 20:47:43,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 20:47:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:43,961 INFO L225 Difference]: With dead ends: 122841 [2019-12-18 20:47:43,961 INFO L226 Difference]: Without dead ends: 106010 [2019-12-18 20:47:43,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 20:47:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106010 states. [2019-12-18 20:47:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106010 to 32021. [2019-12-18 20:47:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32021 states. [2019-12-18 20:47:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32021 states to 32021 states and 101115 transitions. [2019-12-18 20:47:45,355 INFO L78 Accepts]: Start accepts. Automaton has 32021 states and 101115 transitions. Word has length 54 [2019-12-18 20:47:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:45,355 INFO L462 AbstractCegarLoop]: Abstraction has 32021 states and 101115 transitions. [2019-12-18 20:47:45,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:47:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 32021 states and 101115 transitions. [2019-12-18 20:47:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:45,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:45,394 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] [2019-12-18 20:47:45,394 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1063097586, now seen corresponding path program 4 times [2019-12-18 20:47:45,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:45,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014383355] [2019-12-18 20:47:45,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:45,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014383355] [2019-12-18 20:47:45,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:45,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:45,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625860034] [2019-12-18 20:47:45,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:47:45,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:45,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:47:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:45,508 INFO L87 Difference]: Start difference. First operand 32021 states and 101115 transitions. Second operand 9 states. [2019-12-18 20:47:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:47,054 INFO L93 Difference]: Finished difference Result 96459 states and 297039 transitions. [2019-12-18 20:47:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 20:47:47,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 20:47:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:47,201 INFO L225 Difference]: With dead ends: 96459 [2019-12-18 20:47:47,201 INFO L226 Difference]: Without dead ends: 91853 [2019-12-18 20:47:47,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 20:47:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91853 states. [2019-12-18 20:47:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91853 to 31487. [2019-12-18 20:47:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31487 states. [2019-12-18 20:47:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31487 states to 31487 states and 99453 transitions. [2019-12-18 20:47:48,544 INFO L78 Accepts]: Start accepts. Automaton has 31487 states and 99453 transitions. Word has length 54 [2019-12-18 20:47:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:48,545 INFO L462 AbstractCegarLoop]: Abstraction has 31487 states and 99453 transitions. [2019-12-18 20:47:48,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:47:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 31487 states and 99453 transitions. [2019-12-18 20:47:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:48,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:48,585 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] [2019-12-18 20:47:48,585 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-18 20:47:48,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:48,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659814725] [2019-12-18 20:47:48,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:48,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659814725] [2019-12-18 20:47:48,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:48,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:48,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091280172] [2019-12-18 20:47:48,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:47:48,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:47:48,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:47:48,730 INFO L87 Difference]: Start difference. First operand 31487 states and 99453 transitions. Second operand 8 states. [2019-12-18 20:47:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:49,657 INFO L93 Difference]: Finished difference Result 38941 states and 118457 transitions. [2019-12-18 20:47:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:47:49,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 20:47:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:49,719 INFO L225 Difference]: With dead ends: 38941 [2019-12-18 20:47:49,719 INFO L226 Difference]: Without dead ends: 38843 [2019-12-18 20:47:49,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:47:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38843 states. [2019-12-18 20:47:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38843 to 28878. [2019-12-18 20:47:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28878 states. [2019-12-18 20:47:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28878 states to 28878 states and 89996 transitions. [2019-12-18 20:47:50,278 INFO L78 Accepts]: Start accepts. Automaton has 28878 states and 89996 transitions. Word has length 54 [2019-12-18 20:47:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:50,279 INFO L462 AbstractCegarLoop]: Abstraction has 28878 states and 89996 transitions. [2019-12-18 20:47:50,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:47:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28878 states and 89996 transitions. [2019-12-18 20:47:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:50,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:50,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:47:50,569 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:50,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:50,570 INFO L82 PathProgramCache]: Analyzing trace with hash -623567340, now seen corresponding path program 6 times [2019-12-18 20:47:50,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:50,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031346561] [2019-12-18 20:47:50,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:50,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031346561] [2019-12-18 20:47:50,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:50,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:47:50,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141294098] [2019-12-18 20:47:50,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:47:50,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:50,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:47:50,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:47:50,712 INFO L87 Difference]: Start difference. First operand 28878 states and 89996 transitions. Second operand 8 states. [2019-12-18 20:47:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:51,810 INFO L93 Difference]: Finished difference Result 37249 states and 113806 transitions. [2019-12-18 20:47:51,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:47:51,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 20:47:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:51,867 INFO L225 Difference]: With dead ends: 37249 [2019-12-18 20:47:51,867 INFO L226 Difference]: Without dead ends: 37249 [2019-12-18 20:47:51,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:47:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37249 states. [2019-12-18 20:47:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37249 to 28954. [2019-12-18 20:47:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28954 states. [2019-12-18 20:47:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28954 states to 28954 states and 90206 transitions. [2019-12-18 20:47:52,381 INFO L78 Accepts]: Start accepts. Automaton has 28954 states and 90206 transitions. Word has length 54 [2019-12-18 20:47:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:52,381 INFO L462 AbstractCegarLoop]: Abstraction has 28954 states and 90206 transitions. [2019-12-18 20:47:52,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:47:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 28954 states and 90206 transitions. [2019-12-18 20:47:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:52,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:52,417 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] [2019-12-18 20:47:52,417 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -365012868, now seen corresponding path program 7 times [2019-12-18 20:47:52,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:52,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603529688] [2019-12-18 20:47:52,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:52,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603529688] [2019-12-18 20:47:52,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:52,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:47:52,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131746935] [2019-12-18 20:47:52,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:47:52,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:52,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:47:52,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:47:52,570 INFO L87 Difference]: Start difference. First operand 28954 states and 90206 transitions. Second operand 9 states. [2019-12-18 20:47:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:54,115 INFO L93 Difference]: Finished difference Result 39314 states and 119440 transitions. [2019-12-18 20:47:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:47:54,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 20:47:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:54,177 INFO L225 Difference]: With dead ends: 39314 [2019-12-18 20:47:54,177 INFO L226 Difference]: Without dead ends: 39194 [2019-12-18 20:47:54,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:47:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39194 states. [2019-12-18 20:47:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39194 to 30549. [2019-12-18 20:47:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30549 states. [2019-12-18 20:47:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30549 states to 30549 states and 95055 transitions. [2019-12-18 20:47:55,002 INFO L78 Accepts]: Start accepts. Automaton has 30549 states and 95055 transitions. Word has length 54 [2019-12-18 20:47:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:55,003 INFO L462 AbstractCegarLoop]: Abstraction has 30549 states and 95055 transitions. [2019-12-18 20:47:55,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:47:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 30549 states and 95055 transitions. [2019-12-18 20:47:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:55,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:55,042 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] [2019-12-18 20:47:55,042 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:55,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash -851794568, now seen corresponding path program 8 times [2019-12-18 20:47:55,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:55,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310077060] [2019-12-18 20:47:55,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:55,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310077060] [2019-12-18 20:47:55,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:55,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:47:55,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544031898] [2019-12-18 20:47:55,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:47:55,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:47:55,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:47:55,235 INFO L87 Difference]: Start difference. First operand 30549 states and 95055 transitions. Second operand 10 states. [2019-12-18 20:47:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:56,637 INFO L93 Difference]: Finished difference Result 40180 states and 122280 transitions. [2019-12-18 20:47:56,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:47:56,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-18 20:47:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:56,702 INFO L225 Difference]: With dead ends: 40180 [2019-12-18 20:47:56,702 INFO L226 Difference]: Without dead ends: 40054 [2019-12-18 20:47:56,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:47:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-18 20:47:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 32015. [2019-12-18 20:47:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32015 states. [2019-12-18 20:47:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32015 states to 32015 states and 99445 transitions. [2019-12-18 20:47:57,283 INFO L78 Accepts]: Start accepts. Automaton has 32015 states and 99445 transitions. Word has length 54 [2019-12-18 20:47:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:57,283 INFO L462 AbstractCegarLoop]: Abstraction has 32015 states and 99445 transitions. [2019-12-18 20:47:57,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:47:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 32015 states and 99445 transitions. [2019-12-18 20:47:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:57,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:57,324 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] [2019-12-18 20:47:57,324 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash -304327506, now seen corresponding path program 9 times [2019-12-18 20:47:57,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:57,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518269231] [2019-12-18 20:47:57,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:57,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518269231] [2019-12-18 20:47:57,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:57,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:47:57,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804869423] [2019-12-18 20:47:57,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:47:57,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:57,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:47:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:47:57,426 INFO L87 Difference]: Start difference. First operand 32015 states and 99445 transitions. Second operand 7 states. [2019-12-18 20:47:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:47:58,862 INFO L93 Difference]: Finished difference Result 43638 states and 132324 transitions. [2019-12-18 20:47:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:47:58,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:47:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:47:58,931 INFO L225 Difference]: With dead ends: 43638 [2019-12-18 20:47:58,931 INFO L226 Difference]: Without dead ends: 43526 [2019-12-18 20:47:58,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:47:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43526 states. [2019-12-18 20:47:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43526 to 31190. [2019-12-18 20:47:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31190 states. [2019-12-18 20:47:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31190 states to 31190 states and 96721 transitions. [2019-12-18 20:47:59,757 INFO L78 Accepts]: Start accepts. Automaton has 31190 states and 96721 transitions. Word has length 54 [2019-12-18 20:47:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:47:59,757 INFO L462 AbstractCegarLoop]: Abstraction has 31190 states and 96721 transitions. [2019-12-18 20:47:59,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:47:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 31190 states and 96721 transitions. [2019-12-18 20:47:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:47:59,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:47:59,794 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] [2019-12-18 20:47:59,794 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:47:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:47:59,795 INFO L82 PathProgramCache]: Analyzing trace with hash 483920898, now seen corresponding path program 10 times [2019-12-18 20:47:59,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:47:59,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308579624] [2019-12-18 20:47:59,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:47:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:47:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:47:59,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308579624] [2019-12-18 20:47:59,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:47:59,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:47:59,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077818717] [2019-12-18 20:47:59,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:47:59,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:47:59,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:47:59,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:47:59,899 INFO L87 Difference]: Start difference. First operand 31190 states and 96721 transitions. Second operand 7 states. [2019-12-18 20:48:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:01,021 INFO L93 Difference]: Finished difference Result 44972 states and 137595 transitions. [2019-12-18 20:48:01,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 20:48:01,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:48:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:01,092 INFO L225 Difference]: With dead ends: 44972 [2019-12-18 20:48:01,092 INFO L226 Difference]: Without dead ends: 44972 [2019-12-18 20:48:01,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:48:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44972 states. [2019-12-18 20:48:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44972 to 31199. [2019-12-18 20:48:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31199 states. [2019-12-18 20:48:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31199 states to 31199 states and 96742 transitions. [2019-12-18 20:48:01,689 INFO L78 Accepts]: Start accepts. Automaton has 31199 states and 96742 transitions. Word has length 54 [2019-12-18 20:48:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:01,689 INFO L462 AbstractCegarLoop]: Abstraction has 31199 states and 96742 transitions. [2019-12-18 20:48:01,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:48:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 31199 states and 96742 transitions. [2019-12-18 20:48:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:48:01,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:01,727 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] [2019-12-18 20:48:01,728 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1936289590, now seen corresponding path program 11 times [2019-12-18 20:48:01,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:01,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559137025] [2019-12-18 20:48:01,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:01,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559137025] [2019-12-18 20:48:01,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:01,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:48:01,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750366223] [2019-12-18 20:48:01,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:01,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:01,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:01,780 INFO L87 Difference]: Start difference. First operand 31199 states and 96742 transitions. Second operand 3 states. [2019-12-18 20:48:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:01,910 INFO L93 Difference]: Finished difference Result 26124 states and 80391 transitions. [2019-12-18 20:48:01,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:01,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:48:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:01,974 INFO L225 Difference]: With dead ends: 26124 [2019-12-18 20:48:01,974 INFO L226 Difference]: Without dead ends: 26124 [2019-12-18 20:48:01,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26124 states. [2019-12-18 20:48:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26124 to 24168. [2019-12-18 20:48:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24168 states. [2019-12-18 20:48:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24168 states to 24168 states and 74083 transitions. [2019-12-18 20:48:02,647 INFO L78 Accepts]: Start accepts. Automaton has 24168 states and 74083 transitions. Word has length 54 [2019-12-18 20:48:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:02,647 INFO L462 AbstractCegarLoop]: Abstraction has 24168 states and 74083 transitions. [2019-12-18 20:48:02,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 24168 states and 74083 transitions. [2019-12-18 20:48:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:48:02,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:02,684 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] [2019-12-18 20:48:02,684 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1077838096, now seen corresponding path program 1 times [2019-12-18 20:48:02,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:02,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743517552] [2019-12-18 20:48:02,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:02,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743517552] [2019-12-18 20:48:02,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:02,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:48:02,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381026904] [2019-12-18 20:48:02,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:48:02,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:02,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:48:02,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:48:02,795 INFO L87 Difference]: Start difference. First operand 24168 states and 74083 transitions. Second operand 9 states. [2019-12-18 20:48:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:04,162 INFO L93 Difference]: Finished difference Result 39590 states and 120400 transitions. [2019-12-18 20:48:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:48:04,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 20:48:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:04,220 INFO L225 Difference]: With dead ends: 39590 [2019-12-18 20:48:04,220 INFO L226 Difference]: Without dead ends: 32040 [2019-12-18 20:48:04,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:48:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32040 states. [2019-12-18 20:48:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32040 to 24792. [2019-12-18 20:48:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24792 states. [2019-12-18 20:48:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24792 states to 24792 states and 75634 transitions. [2019-12-18 20:48:04,690 INFO L78 Accepts]: Start accepts. Automaton has 24792 states and 75634 transitions. Word has length 55 [2019-12-18 20:48:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:04,690 INFO L462 AbstractCegarLoop]: Abstraction has 24792 states and 75634 transitions. [2019-12-18 20:48:04,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:48:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 24792 states and 75634 transitions. [2019-12-18 20:48:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:48:04,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:04,731 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] [2019-12-18 20:48:04,731 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:04,731 INFO L82 PathProgramCache]: Analyzing trace with hash 36934650, now seen corresponding path program 1 times [2019-12-18 20:48:04,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:04,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430943248] [2019-12-18 20:48:04,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:04,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430943248] [2019-12-18 20:48:04,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:04,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:48:04,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429424709] [2019-12-18 20:48:04,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:04,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:04,776 INFO L87 Difference]: Start difference. First operand 24792 states and 75634 transitions. Second operand 3 states. [2019-12-18 20:48:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:04,891 INFO L93 Difference]: Finished difference Result 26927 states and 79752 transitions. [2019-12-18 20:48:04,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:04,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:48:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:04,928 INFO L225 Difference]: With dead ends: 26927 [2019-12-18 20:48:04,928 INFO L226 Difference]: Without dead ends: 26927 [2019-12-18 20:48:04,928 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-18 20:48:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26927 states. [2019-12-18 20:48:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26927 to 19563. [2019-12-18 20:48:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19563 states. [2019-12-18 20:48:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19563 states to 19563 states and 57992 transitions. [2019-12-18 20:48:05,284 INFO L78 Accepts]: Start accepts. Automaton has 19563 states and 57992 transitions. Word has length 55 [2019-12-18 20:48:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:05,284 INFO L462 AbstractCegarLoop]: Abstraction has 19563 states and 57992 transitions. [2019-12-18 20:48:05,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 19563 states and 57992 transitions. [2019-12-18 20:48:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:48:05,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:05,307 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] [2019-12-18 20:48:05,307 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1825023718, now seen corresponding path program 2 times [2019-12-18 20:48:05,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:05,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913816289] [2019-12-18 20:48:05,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:05,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913816289] [2019-12-18 20:48:05,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:05,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:48:05,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919809507] [2019-12-18 20:48:05,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:48:05,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:05,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:48:05,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:48:05,482 INFO L87 Difference]: Start difference. First operand 19563 states and 57992 transitions. Second operand 11 states. [2019-12-18 20:48:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:06,826 INFO L93 Difference]: Finished difference Result 23492 states and 69410 transitions. [2019-12-18 20:48:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:48:06,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 20:48:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:06,858 INFO L225 Difference]: With dead ends: 23492 [2019-12-18 20:48:06,858 INFO L226 Difference]: Without dead ends: 22642 [2019-12-18 20:48:06,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:48:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22642 states. [2019-12-18 20:48:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22642 to 20211. [2019-12-18 20:48:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20211 states. [2019-12-18 20:48:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20211 states to 20211 states and 59676 transitions. [2019-12-18 20:48:07,164 INFO L78 Accepts]: Start accepts. Automaton has 20211 states and 59676 transitions. Word has length 55 [2019-12-18 20:48:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:07,165 INFO L462 AbstractCegarLoop]: Abstraction has 20211 states and 59676 transitions. [2019-12-18 20:48:07,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:48:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 20211 states and 59676 transitions. [2019-12-18 20:48:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:48:07,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:07,187 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] [2019-12-18 20:48:07,187 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash 696070732, now seen corresponding path program 3 times [2019-12-18 20:48:07,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:07,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802193997] [2019-12-18 20:48:07,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:07,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802193997] [2019-12-18 20:48:07,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:07,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:48:07,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156788896] [2019-12-18 20:48:07,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:48:07,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:07,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:48:07,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:48:07,349 INFO L87 Difference]: Start difference. First operand 20211 states and 59676 transitions. Second operand 11 states. [2019-12-18 20:48:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:08,728 INFO L93 Difference]: Finished difference Result 25022 states and 73505 transitions. [2019-12-18 20:48:08,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:48:08,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 20:48:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:08,761 INFO L225 Difference]: With dead ends: 25022 [2019-12-18 20:48:08,761 INFO L226 Difference]: Without dead ends: 23786 [2019-12-18 20:48:08,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:48:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23786 states. [2019-12-18 20:48:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23786 to 19807. [2019-12-18 20:48:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19807 states. [2019-12-18 20:48:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19807 states to 19807 states and 58592 transitions. [2019-12-18 20:48:09,184 INFO L78 Accepts]: Start accepts. Automaton has 19807 states and 58592 transitions. Word has length 55 [2019-12-18 20:48:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:09,184 INFO L462 AbstractCegarLoop]: Abstraction has 19807 states and 58592 transitions. [2019-12-18 20:48:09,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:48:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 19807 states and 58592 transitions. [2019-12-18 20:48:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:48:09,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:09,214 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] [2019-12-18 20:48:09,215 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash 478362784, now seen corresponding path program 4 times [2019-12-18 20:48:09,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:09,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291904246] [2019-12-18 20:48:09,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:09,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-18 20:48:09,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291904246] [2019-12-18 20:48:09,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:09,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:48:09,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862161423] [2019-12-18 20:48:09,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:48:09,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:09,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:48:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:48:09,395 INFO L87 Difference]: Start difference. First operand 19807 states and 58592 transitions. Second operand 11 states. [2019-12-18 20:48:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:10,402 INFO L93 Difference]: Finished difference Result 36557 states and 107559 transitions. [2019-12-18 20:48:10,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 20:48:10,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 20:48:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:10,451 INFO L225 Difference]: With dead ends: 36557 [2019-12-18 20:48:10,452 INFO L226 Difference]: Without dead ends: 35435 [2019-12-18 20:48:10,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 20:48:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35435 states. [2019-12-18 20:48:10,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35435 to 22021. [2019-12-18 20:48:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22021 states. [2019-12-18 20:48:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 64836 transitions. [2019-12-18 20:48:10,876 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 64836 transitions. Word has length 55 [2019-12-18 20:48:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:10,877 INFO L462 AbstractCegarLoop]: Abstraction has 22021 states and 64836 transitions. [2019-12-18 20:48:10,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:48:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 64836 transitions. [2019-12-18 20:48:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:48:10,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:10,903 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] [2019-12-18 20:48:10,903 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -410036086, now seen corresponding path program 5 times [2019-12-18 20:48:10,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:10,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350509395] [2019-12-18 20:48:10,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:11,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350509395] [2019-12-18 20:48:11,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:11,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:48:11,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310166938] [2019-12-18 20:48:11,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:48:11,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:11,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:48:11,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:48:11,056 INFO L87 Difference]: Start difference. First operand 22021 states and 64836 transitions. Second operand 11 states. [2019-12-18 20:48:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:11,963 INFO L93 Difference]: Finished difference Result 35901 states and 105043 transitions. [2019-12-18 20:48:11,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:48:11,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 20:48:11,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:12,001 INFO L225 Difference]: With dead ends: 35901 [2019-12-18 20:48:12,001 INFO L226 Difference]: Without dead ends: 28304 [2019-12-18 20:48:12,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:48:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28304 states. [2019-12-18 20:48:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28304 to 17647. [2019-12-18 20:48:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17647 states. [2019-12-18 20:48:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17647 states to 17647 states and 52139 transitions. [2019-12-18 20:48:12,337 INFO L78 Accepts]: Start accepts. Automaton has 17647 states and 52139 transitions. Word has length 55 [2019-12-18 20:48:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:12,337 INFO L462 AbstractCegarLoop]: Abstraction has 17647 states and 52139 transitions. [2019-12-18 20:48:12,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:48:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 17647 states and 52139 transitions. [2019-12-18 20:48:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:48:12,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:12,357 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] [2019-12-18 20:48:12,357 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:12,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1379165460, now seen corresponding path program 6 times [2019-12-18 20:48:12,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:12,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780257252] [2019-12-18 20:48:12,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:12,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780257252] [2019-12-18 20:48:12,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:12,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:48:12,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422088955] [2019-12-18 20:48:12,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:48:12,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:48:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:12,411 INFO L87 Difference]: Start difference. First operand 17647 states and 52139 transitions. Second operand 3 states. [2019-12-18 20:48:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:12,491 INFO L93 Difference]: Finished difference Result 17645 states and 52134 transitions. [2019-12-18 20:48:12,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:48:12,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:48:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:12,522 INFO L225 Difference]: With dead ends: 17645 [2019-12-18 20:48:12,523 INFO L226 Difference]: Without dead ends: 17645 [2019-12-18 20:48:12,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:48:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17645 states. [2019-12-18 20:48:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17645 to 14168. [2019-12-18 20:48:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14168 states. [2019-12-18 20:48:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14168 states to 14168 states and 42416 transitions. [2019-12-18 20:48:12,802 INFO L78 Accepts]: Start accepts. Automaton has 14168 states and 42416 transitions. Word has length 55 [2019-12-18 20:48:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:12,802 INFO L462 AbstractCegarLoop]: Abstraction has 14168 states and 42416 transitions. [2019-12-18 20:48:12,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:48:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 14168 states and 42416 transitions. [2019-12-18 20:48:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:48:12,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:12,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:48:12,818 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 1 times [2019-12-18 20:48:12,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:12,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286445257] [2019-12-18 20:48:12,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:48:13,254 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-12-18 20:48:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:48:13,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286445257] [2019-12-18 20:48:13,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:48:13,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 20:48:13,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763482450] [2019-12-18 20:48:13,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 20:48:13,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:48:13,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 20:48:13,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:48:13,523 INFO L87 Difference]: Start difference. First operand 14168 states and 42416 transitions. Second operand 18 states. [2019-12-18 20:48:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:48:18,155 INFO L93 Difference]: Finished difference Result 23415 states and 69173 transitions. [2019-12-18 20:48:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 20:48:18,155 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-18 20:48:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:48:18,188 INFO L225 Difference]: With dead ends: 23415 [2019-12-18 20:48:18,188 INFO L226 Difference]: Without dead ends: 23125 [2019-12-18 20:48:18,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=361, Invalid=1895, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 20:48:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23125 states. [2019-12-18 20:48:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23125 to 14004. [2019-12-18 20:48:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14004 states. [2019-12-18 20:48:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14004 states to 14004 states and 42020 transitions. [2019-12-18 20:48:18,461 INFO L78 Accepts]: Start accepts. Automaton has 14004 states and 42020 transitions. Word has length 56 [2019-12-18 20:48:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:48:18,461 INFO L462 AbstractCegarLoop]: Abstraction has 14004 states and 42020 transitions. [2019-12-18 20:48:18,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 20:48:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 14004 states and 42020 transitions. [2019-12-18 20:48:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:48:18,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:48:18,477 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] [2019-12-18 20:48:18,477 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:48:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:48:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 2 times [2019-12-18 20:48:18,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:48:18,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674977946] [2019-12-18 20:48:18,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:48:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:48:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:48:18,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:48:18,577 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:48:18,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_16|) |v_ULTIMATE.start_main_~#t642~0.offset_13| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t642~0.base_16|) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_ULTIMATE.start_main_~#t642~0.offset_13| 0) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t642~0.base_16| 1)) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t642~0.base_16| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t642~0.base_16|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t642~0.offset=|v_ULTIMATE.start_main_~#t642~0.offset_13|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_19|, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t642~0.base=|v_ULTIMATE.start_main_~#t642~0.base_16|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_15|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t642~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t644~0.base, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t644~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t642~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:48:18,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t643~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t643~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t643~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11|) |v_ULTIMATE.start_main_~#t643~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t643~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_10|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:48:18,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= 1 ~y$w_buff0~0_Out2124953576) (= ~y$w_buff1_used~0_Out2124953576 ~y$w_buff0_used~0_In2124953576) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out2124953576| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out2124953576) (= 0 (mod ~y$w_buff1_used~0_Out2124953576 256)) (= |P1Thread1of1ForFork1_#in~arg.base_In2124953576| P1Thread1of1ForFork1_~arg.base_Out2124953576) (= ~y$w_buff0~0_In2124953576 ~y$w_buff1~0_Out2124953576) (= ~y$w_buff0_used~0_Out2124953576 1) (= |P1Thread1of1ForFork1_#in~arg.offset_In2124953576| P1Thread1of1ForFork1_~arg.offset_Out2124953576) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out2124953576| 1)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2124953576, ~y$w_buff0~0=~y$w_buff0~0_In2124953576, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In2124953576|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In2124953576|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out2124953576, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out2124953576, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out2124953576, ~y$w_buff1~0=~y$w_buff1~0_Out2124953576, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out2124953576|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out2124953576, ~y$w_buff0~0=~y$w_buff0~0_Out2124953576, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In2124953576|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In2124953576|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out2124953576} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:48:18,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11|) |v_ULTIMATE.start_main_~#t644~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t644~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t644~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t644~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t644~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t644~0.base, ULTIMATE.start_main_~#t644~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:48:18,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1870067060 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1870067060 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite33_Out-1870067060| |P2Thread1of1ForFork2_#t~ite32_Out-1870067060|))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-1870067060 |P2Thread1of1ForFork2_#t~ite32_Out-1870067060|)) (and (or .cse1 .cse2) .cse0 (= |P2Thread1of1ForFork2_#t~ite32_Out-1870067060| ~y~0_In-1870067060)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1870067060, ~y$w_buff1~0=~y$w_buff1~0_In-1870067060, ~y~0=~y~0_In-1870067060, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1870067060} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1870067060, ~y$w_buff1~0=~y$w_buff1~0_In-1870067060, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out-1870067060|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-1870067060|, ~y~0=~y~0_In-1870067060, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1870067060} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 20:48:18,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-161435290 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-161435290 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out-161435290| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-161435290 |P1Thread1of1ForFork1_#t~ite28_Out-161435290|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-161435290, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-161435290} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-161435290, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-161435290, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-161435290|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 20:48:18,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1330923332 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1330923332 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite34_Out-1330923332| ~y$w_buff0_used~0_In-1330923332) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite34_Out-1330923332|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1330923332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1330923332} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1330923332|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1330923332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1330923332} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 20:48:18,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In224889857 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In224889857 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In224889857 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In224889857 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out224889857|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In224889857 |P2Thread1of1ForFork2_#t~ite35_Out224889857|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In224889857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In224889857, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In224889857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In224889857} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out224889857|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In224889857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In224889857, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In224889857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In224889857} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 20:48:18,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1170101535 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1170101535 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite36_Out-1170101535|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1170101535 |P2Thread1of1ForFork2_#t~ite36_Out-1170101535|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1170101535, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1170101535} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-1170101535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1170101535, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1170101535} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 20:48:18,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1153270139 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1153270139 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1153270139 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1153270139 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out1153270139|)) (and (= ~y$r_buff1_thd3~0_In1153270139 |P2Thread1of1ForFork2_#t~ite37_Out1153270139|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1153270139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1153270139, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1153270139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1153270139} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out1153270139|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1153270139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1153270139, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1153270139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1153270139} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 20:48:18,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 20:48:18,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In753560104 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In753560104 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In753560104 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In753560104 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out753560104|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out753560104| ~y$w_buff1_used~0_In753560104) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In753560104, ~y$w_buff0_used~0=~y$w_buff0_used~0_In753560104, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In753560104, ~y$w_buff1_used~0=~y$w_buff1_used~0_In753560104} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In753560104, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out753560104|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In753560104, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In753560104, ~y$w_buff1_used~0=~y$w_buff1_used~0_In753560104} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 20:48:18,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1874264848 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1874264848 256)))) (or (and (= 0 ~y$r_buff0_thd2~0_Out-1874264848) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-1874264848 ~y$r_buff0_thd2~0_Out-1874264848)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874264848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1874264848} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1874264848|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874264848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1874264848} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:48:18,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1893011527 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1893011527 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1893011527 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1893011527 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1893011527 |P1Thread1of1ForFork1_#t~ite31_Out-1893011527|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite31_Out-1893011527| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1893011527, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1893011527, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1893011527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1893011527} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1893011527, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1893011527, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1893011527|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1893011527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1893011527} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 20:48:18,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 20:48:18,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1532975747 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_In-1532975747| |P0Thread1of1ForFork0_#t~ite8_Out-1532975747|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite9_Out-1532975747| ~y$w_buff0~0_In-1532975747)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1532975747| ~y$w_buff0~0_In-1532975747) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1532975747 256)))) (or (= (mod ~y$w_buff0_used~0_In-1532975747 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1532975747 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1532975747 256) 0)))) (= |P0Thread1of1ForFork0_#t~ite9_Out-1532975747| |P0Thread1of1ForFork0_#t~ite8_Out-1532975747|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1532975747, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1532975747, ~y$w_buff0~0=~y$w_buff0~0_In-1532975747, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1532975747, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In-1532975747|, ~weak$$choice2~0=~weak$$choice2~0_In-1532975747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1532975747} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1532975747, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-1532975747|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1532975747, ~y$w_buff0~0=~y$w_buff0~0_In-1532975747, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1532975747|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1532975747, ~weak$$choice2~0=~weak$$choice2~0_In-1532975747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1532975747} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:48:18,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In563921435 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out563921435| ~y$w_buff1~0_In563921435) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In563921435| |P0Thread1of1ForFork0_#t~ite11_Out563921435|)) (and (= |P0Thread1of1ForFork0_#t~ite12_Out563921435| |P0Thread1of1ForFork0_#t~ite11_Out563921435|) (= |P0Thread1of1ForFork0_#t~ite11_Out563921435| ~y$w_buff1~0_In563921435) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In563921435 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In563921435 256)) .cse1) (= (mod ~y$w_buff0_used~0_In563921435 256) 0) (and (= (mod ~y$r_buff1_thd1~0_In563921435 256) 0) .cse1)))))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In563921435|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In563921435, ~y$w_buff1~0=~y$w_buff1~0_In563921435, ~y$w_buff0_used~0=~y$w_buff0_used~0_In563921435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In563921435, ~weak$$choice2~0=~weak$$choice2~0_In563921435, ~y$w_buff1_used~0=~y$w_buff1_used~0_In563921435} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out563921435|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In563921435, ~y$w_buff1~0=~y$w_buff1~0_In563921435, ~y$w_buff0_used~0=~y$w_buff0_used~0_In563921435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In563921435, ~weak$$choice2~0=~weak$$choice2~0_In563921435, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out563921435|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In563921435} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 20:48:18,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 20:48:18,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite23_Out1586786393| |P0Thread1of1ForFork0_#t~ite24_Out1586786393|)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1586786393 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1586786393 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In1586786393 256))) (.cse5 (= 0 (mod ~y$w_buff1_used~0_In1586786393 256))) (.cse4 (= (mod ~y$r_buff0_thd1~0_In1586786393 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite22_In1586786393| |P0Thread1of1ForFork0_#t~ite22_Out1586786393|) (or (and (= |P0Thread1of1ForFork0_#t~ite23_In1586786393| |P0Thread1of1ForFork0_#t~ite23_Out1586786393|) (= ~y$r_buff1_thd1~0_In1586786393 |P0Thread1of1ForFork0_#t~ite24_Out1586786393|) (not .cse0)) (and .cse1 (= ~y$r_buff1_thd1~0_In1586786393 |P0Thread1of1ForFork0_#t~ite23_Out1586786393|) (or .cse2 (and .cse3 .cse4) (and .cse4 .cse5)) .cse0))) (let ((.cse6 (not .cse4))) (and (= |P0Thread1of1ForFork0_#t~ite22_Out1586786393| |P0Thread1of1ForFork0_#t~ite23_Out1586786393|) .cse1 (or (not .cse3) .cse6) (= |P0Thread1of1ForFork0_#t~ite22_Out1586786393| 0) (not .cse2) .cse0 (or (not .cse5) .cse6))))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In1586786393|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1586786393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1586786393, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1586786393, ~weak$$choice2~0=~weak$$choice2~0_In1586786393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1586786393, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In1586786393|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out1586786393|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1586786393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1586786393, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1586786393, ~weak$$choice2~0=~weak$$choice2~0_In1586786393, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out1586786393|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out1586786393|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1586786393} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 20:48:18,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 20:48:18,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:48:18,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-126078287 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-126078287 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-126078287| ~y$w_buff1~0_In-126078287) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-126078287 |ULTIMATE.start_main_#t~ite41_Out-126078287|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-126078287, ~y~0=~y~0_In-126078287, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-126078287, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-126078287} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-126078287|, ~y$w_buff1~0=~y$w_buff1~0_In-126078287, ~y~0=~y~0_In-126078287, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-126078287, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-126078287} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 20:48:18,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:48:18,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1475277076 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1475277076 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1475277076| ~y$w_buff0_used~0_In1475277076)) (and (= |ULTIMATE.start_main_#t~ite43_Out1475277076| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1475277076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1475277076} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1475277076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1475277076, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1475277076|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:48:18,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1172926711 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1172926711 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1172926711 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1172926711 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1172926711|)) (and (= ~y$w_buff1_used~0_In-1172926711 |ULTIMATE.start_main_#t~ite44_Out-1172926711|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1172926711, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1172926711, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1172926711, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1172926711} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1172926711, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1172926711, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1172926711, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1172926711|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1172926711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:48:18,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In930618073 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In930618073 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In930618073 |ULTIMATE.start_main_#t~ite45_Out930618073|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out930618073| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In930618073, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In930618073} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In930618073, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In930618073, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out930618073|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:48:18,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-572972871 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-572972871 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-572972871 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-572972871 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-572972871|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-572972871 |ULTIMATE.start_main_#t~ite46_Out-572972871|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-572972871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-572972871, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-572972871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572972871} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-572972871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-572972871, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-572972871|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-572972871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572972871} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:48:18,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:48:18,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:48:18 BasicIcfg [2019-12-18 20:48:18,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:48:18,701 INFO L168 Benchmark]: Toolchain (without parser) took 81126.98 ms. Allocated memory was 137.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 20:48:18,701 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 20:48:18,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.68 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.1 MB in the beginning and 155.8 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:48:18,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.18 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:48:18,703 INFO L168 Benchmark]: Boogie Preprocessor took 38.20 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:48:18,703 INFO L168 Benchmark]: RCFGBuilder took 854.12 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 104.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:48:18,704 INFO L168 Benchmark]: TraceAbstraction took 79406.68 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 103.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:48:18,706 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.68 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.1 MB in the beginning and 155.8 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.18 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.20 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.12 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 104.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79406.68 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 103.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t642, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t643, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] FCALL, FORK 0 pthread_create(&t644, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 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) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 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 [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 79.0s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7147 SDtfs, 9771 SDslu, 25938 SDs, 0 SdLazy, 18769 SolverSat, 453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 69 SyntacticMatches, 40 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred 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: 26.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 337879 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1432 NumberOfCodeBlocks, 1432 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1344 ConstructedInterpolants, 0 QuantifiedInterpolants, 289911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...