/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:45:26,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:45:26,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:45:26,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:45:26,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:45:26,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:45:26,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:45:26,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:45:26,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:45:26,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:45:26,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:45:26,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:45:26,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:45:26,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:45:26,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:45:26,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:45:26,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:45:26,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:45:26,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:45:26,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:45:26,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:45:26,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:45:26,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:45:26,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:45:26,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:45:26,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:45:26,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:45:26,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:45:26,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:45:26,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:45:26,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:45:26,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:45:26,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:45:26,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:45:26,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:45:26,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:45:26,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:45:26,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:45:26,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:45:26,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:45:26,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:45:26,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:45:26,372 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:45:26,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:45:26,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:45:26,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:45:26,375 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:45:26,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:45:26,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:45:26,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:45:26,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:45:26,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:45:26,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:45:26,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:45:26,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:45:26,377 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:45:26,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:45:26,377 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:45:26,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:45:26,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:45:26,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:45:26,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:45:26,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:45:26,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:45:26,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:45:26,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:45:26,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:45:26,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:45:26,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:45:26,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:45:26,380 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:45:26,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:45:26,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:45:26,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:45:26,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:45:26,712 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:45:26,713 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:45:26,714 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i [2019-12-26 23:45:26,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994919c42/0b15a1a90eec494d92ae0208e1062912/FLAG249db3d1e [2019-12-26 23:45:27,354 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:45:27,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_rmo.opt.i [2019-12-26 23:45:27,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994919c42/0b15a1a90eec494d92ae0208e1062912/FLAG249db3d1e [2019-12-26 23:45:27,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994919c42/0b15a1a90eec494d92ae0208e1062912 [2019-12-26 23:45:27,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:45:27,630 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:45:27,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:45:27,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:45:27,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:45:27,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:45:27" (1/1) ... [2019-12-26 23:45:27,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da409ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:27, skipping insertion in model container [2019-12-26 23:45:27,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:45:27" (1/1) ... [2019-12-26 23:45:27,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:45:27,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:45:28,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:45:28,371 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:45:28,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:45:28,553 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:45:28,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28 WrapperNode [2019-12-26 23:45:28,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:45:28,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:45:28,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:45:28,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:45:28,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:45:28,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:45:28,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:45:28,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:45:28,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... [2019-12-26 23:45:28,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:45:28,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:45:28,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:45:28,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:45:28,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:45:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:45:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:45:28,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:45:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:45:28,745 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:45:28,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:45:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:45:28,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:45:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:45:28,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:45:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:45:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:45:28,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:45:28,751 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:45:29,526 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:45:29,527 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:45:29,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:45:29 BoogieIcfgContainer [2019-12-26 23:45:29,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:45:29,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:45:29,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:45:29,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:45:29,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:45:27" (1/3) ... [2019-12-26 23:45:29,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7db91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:45:29, skipping insertion in model container [2019-12-26 23:45:29,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:45:28" (2/3) ... [2019-12-26 23:45:29,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7db91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:45:29, skipping insertion in model container [2019-12-26 23:45:29,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:45:29" (3/3) ... [2019-12-26 23:45:29,543 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_rmo.opt.i [2019-12-26 23:45:29,554 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:45:29,555 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:45:29,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:45:29,567 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:45:29,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:45:29,708 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:45:29,727 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:45:29,727 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:45:29,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:45:29,728 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:45:29,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:45:29,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:45:29,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:45:29,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:45:29,744 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-26 23:45:29,746 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:45:29,846 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:45:29,846 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:45:29,863 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:45:29,887 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:45:29,973 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:45:29,973 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:45:29,981 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:45:30,001 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:45:30,003 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:45:35,436 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:45:35,571 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:45:35,675 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-26 23:45:35,676 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:45:35,680 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-26 23:45:46,964 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-26 23:45:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-26 23:45:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:45:46,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:46,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:45:46,985 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-26 23:45:47,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:47,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018615187] [2019-12-26 23:45:47,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:47,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018615187] [2019-12-26 23:45:47,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:47,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:45:47,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862046608] [2019-12-26 23:45:47,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:47,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:47,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:47,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:47,271 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-26 23:45:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:48,170 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-26 23:45:48,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:48,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:45:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:51,286 INFO L225 Difference]: With dead ends: 85012 [2019-12-26 23:45:51,287 INFO L226 Difference]: Without dead ends: 80140 [2019-12-26 23:45:51,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-26 23:45:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-26 23:45:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-26 23:45:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-26 23:45:57,343 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-26 23:45:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:57,343 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-26 23:45:57,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-26 23:45:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:45:57,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:57,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:57,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-26 23:45:57,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:57,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004774423] [2019-12-26 23:45:57,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:57,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004774423] [2019-12-26 23:45:57,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:57,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:57,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631681497] [2019-12-26 23:45:57,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:57,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:57,523 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-26 23:46:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:02,232 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-26 23:46:02,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:46:02,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:46:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:02,797 INFO L225 Difference]: With dead ends: 123388 [2019-12-26 23:46:02,797 INFO L226 Difference]: Without dead ends: 123290 [2019-12-26 23:46:02,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-26 23:46:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-26 23:46:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-26 23:46:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-26 23:46:09,878 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-26 23:46:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:09,882 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-26 23:46:09,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:46:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-26 23:46:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:46:09,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:09,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:09,887 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-26 23:46:09,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:09,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724502091] [2019-12-26 23:46:09,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:10,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724502091] [2019-12-26 23:46:10,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:10,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:10,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535647688] [2019-12-26 23:46:10,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:46:10,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:10,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:46:10,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:46:10,015 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-26 23:46:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:10,209 INFO L93 Difference]: Finished difference Result 36525 states and 128382 transitions. [2019-12-26 23:46:10,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:46:10,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:46:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:10,279 INFO L225 Difference]: With dead ends: 36525 [2019-12-26 23:46:10,279 INFO L226 Difference]: Without dead ends: 28771 [2019-12-26 23:46:10,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28771 states. [2019-12-26 23:46:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28771 to 28723. [2019-12-26 23:46:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2019-12-26 23:46:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 97157 transitions. [2019-12-26 23:46:14,593 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 97157 transitions. Word has length 13 [2019-12-26 23:46:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:14,594 INFO L462 AbstractCegarLoop]: Abstraction has 28723 states and 97157 transitions. [2019-12-26 23:46:14,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:46:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 97157 transitions. [2019-12-26 23:46:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:46:14,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:14,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:14,596 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-26 23:46:14,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:14,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566928621] [2019-12-26 23:46:14,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:14,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566928621] [2019-12-26 23:46:14,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:14,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:14,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970635358] [2019-12-26 23:46:14,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:14,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:14,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:14,674 INFO L87 Difference]: Start difference. First operand 28723 states and 97157 transitions. Second operand 3 states. [2019-12-26 23:46:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:14,878 INFO L93 Difference]: Finished difference Result 42081 states and 141205 transitions. [2019-12-26 23:46:14,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:14,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:46:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:14,960 INFO L225 Difference]: With dead ends: 42081 [2019-12-26 23:46:14,960 INFO L226 Difference]: Without dead ends: 42081 [2019-12-26 23:46:14,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42081 states. [2019-12-26 23:46:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42081 to 32226. [2019-12-26 23:46:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32226 states. [2019-12-26 23:46:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32226 states to 32226 states and 107932 transitions. [2019-12-26 23:46:16,038 INFO L78 Accepts]: Start accepts. Automaton has 32226 states and 107932 transitions. Word has length 14 [2019-12-26 23:46:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:16,038 INFO L462 AbstractCegarLoop]: Abstraction has 32226 states and 107932 transitions. [2019-12-26 23:46:16,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 32226 states and 107932 transitions. [2019-12-26 23:46:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:46:16,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:16,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:16,041 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:16,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-26 23:46:16,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:16,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060818400] [2019-12-26 23:46:16,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:16,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060818400] [2019-12-26 23:46:16,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:16,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:16,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617316285] [2019-12-26 23:46:16,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:46:16,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:46:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:46:16,120 INFO L87 Difference]: Start difference. First operand 32226 states and 107932 transitions. Second operand 4 states. [2019-12-26 23:46:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:16,446 INFO L93 Difference]: Finished difference Result 39611 states and 130690 transitions. [2019-12-26 23:46:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:46:16,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:46:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:16,514 INFO L225 Difference]: With dead ends: 39611 [2019-12-26 23:46:16,514 INFO L226 Difference]: Without dead ends: 39522 [2019-12-26 23:46:16,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39522 states. [2019-12-26 23:46:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39522 to 34698. [2019-12-26 23:46:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34698 states. [2019-12-26 23:46:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34698 states to 34698 states and 115782 transitions. [2019-12-26 23:46:17,140 INFO L78 Accepts]: Start accepts. Automaton has 34698 states and 115782 transitions. Word has length 14 [2019-12-26 23:46:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:17,141 INFO L462 AbstractCegarLoop]: Abstraction has 34698 states and 115782 transitions. [2019-12-26 23:46:17,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:46:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34698 states and 115782 transitions. [2019-12-26 23:46:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:46:17,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:17,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:17,143 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:17,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-26 23:46:17,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:17,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746472993] [2019-12-26 23:46:17,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:17,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746472993] [2019-12-26 23:46:17,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:17,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:17,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175507203] [2019-12-26 23:46:17,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:46:17,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:17,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:46:17,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:46:17,203 INFO L87 Difference]: Start difference. First operand 34698 states and 115782 transitions. Second operand 4 states. [2019-12-26 23:46:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:17,540 INFO L93 Difference]: Finished difference Result 42436 states and 139747 transitions. [2019-12-26 23:46:17,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:46:17,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:46:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:17,612 INFO L225 Difference]: With dead ends: 42436 [2019-12-26 23:46:17,612 INFO L226 Difference]: Without dead ends: 42329 [2019-12-26 23:46:17,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42329 states. [2019-12-26 23:46:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42329 to 36027. [2019-12-26 23:46:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36027 states. [2019-12-26 23:46:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36027 states to 36027 states and 119643 transitions. [2019-12-26 23:46:18,612 INFO L78 Accepts]: Start accepts. Automaton has 36027 states and 119643 transitions. Word has length 14 [2019-12-26 23:46:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:18,613 INFO L462 AbstractCegarLoop]: Abstraction has 36027 states and 119643 transitions. [2019-12-26 23:46:18,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:46:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 36027 states and 119643 transitions. [2019-12-26 23:46:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:46:18,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:18,626 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-26 23:46:18,626 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:18,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-26 23:46:18,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:18,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995611675] [2019-12-26 23:46:18,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:18,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995611675] [2019-12-26 23:46:18,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:18,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:18,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541102809] [2019-12-26 23:46:18,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:18,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:18,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:18,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:18,761 INFO L87 Difference]: Start difference. First operand 36027 states and 119643 transitions. Second operand 5 states. [2019-12-26 23:46:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:19,383 INFO L93 Difference]: Finished difference Result 48205 states and 157671 transitions. [2019-12-26 23:46:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:46:19,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:46:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:19,469 INFO L225 Difference]: With dead ends: 48205 [2019-12-26 23:46:19,469 INFO L226 Difference]: Without dead ends: 48029 [2019-12-26 23:46:19,470 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-26 23:46:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48029 states. [2019-12-26 23:46:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48029 to 36780. [2019-12-26 23:46:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36780 states. [2019-12-26 23:46:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36780 states to 36780 states and 122127 transitions. [2019-12-26 23:46:20,550 INFO L78 Accepts]: Start accepts. Automaton has 36780 states and 122127 transitions. Word has length 22 [2019-12-26 23:46:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:20,551 INFO L462 AbstractCegarLoop]: Abstraction has 36780 states and 122127 transitions. [2019-12-26 23:46:20,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 36780 states and 122127 transitions. [2019-12-26 23:46:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:46:20,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:20,562 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-26 23:46:20,562 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-26 23:46:20,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:20,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868957033] [2019-12-26 23:46:20,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:20,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868957033] [2019-12-26 23:46:20,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:20,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:20,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300075073] [2019-12-26 23:46:20,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:20,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:20,659 INFO L87 Difference]: Start difference. First operand 36780 states and 122127 transitions. Second operand 5 states. [2019-12-26 23:46:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:21,271 INFO L93 Difference]: Finished difference Result 49034 states and 160234 transitions. [2019-12-26 23:46:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:46:21,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:46:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:21,364 INFO L225 Difference]: With dead ends: 49034 [2019-12-26 23:46:21,364 INFO L226 Difference]: Without dead ends: 48752 [2019-12-26 23:46:21,365 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-26 23:46:21,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48752 states. [2019-12-26 23:46:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48752 to 34955. [2019-12-26 23:46:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34955 states. [2019-12-26 23:46:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34955 states to 34955 states and 116069 transitions. [2019-12-26 23:46:22,059 INFO L78 Accepts]: Start accepts. Automaton has 34955 states and 116069 transitions. Word has length 22 [2019-12-26 23:46:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:22,059 INFO L462 AbstractCegarLoop]: Abstraction has 34955 states and 116069 transitions. [2019-12-26 23:46:22,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 34955 states and 116069 transitions. [2019-12-26 23:46:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:46:22,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:22,072 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-26 23:46:22,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-26 23:46:22,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:22,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644499487] [2019-12-26 23:46:22,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:22,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644499487] [2019-12-26 23:46:22,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:22,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:46:22,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709701495] [2019-12-26 23:46:22,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:46:22,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:46:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:22,248 INFO L87 Difference]: Start difference. First operand 34955 states and 116069 transitions. Second operand 7 states. [2019-12-26 23:46:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:23,131 INFO L93 Difference]: Finished difference Result 48013 states and 156239 transitions. [2019-12-26 23:46:23,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:46:23,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-26 23:46:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:23,217 INFO L225 Difference]: With dead ends: 48013 [2019-12-26 23:46:23,218 INFO L226 Difference]: Without dead ends: 47985 [2019-12-26 23:46:23,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47985 states. [2019-12-26 23:46:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47985 to 39324. [2019-12-26 23:46:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39324 states. [2019-12-26 23:46:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39324 states to 39324 states and 129687 transitions. [2019-12-26 23:46:23,906 INFO L78 Accepts]: Start accepts. Automaton has 39324 states and 129687 transitions. Word has length 25 [2019-12-26 23:46:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:23,907 INFO L462 AbstractCegarLoop]: Abstraction has 39324 states and 129687 transitions. [2019-12-26 23:46:23,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:46:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 39324 states and 129687 transitions. [2019-12-26 23:46:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:46:23,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:23,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:23,925 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-26 23:46:23,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:23,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820122012] [2019-12-26 23:46:23,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:24,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820122012] [2019-12-26 23:46:24,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:24,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:46:24,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439725165] [2019-12-26 23:46:24,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:24,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:24,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:24,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:24,034 INFO L87 Difference]: Start difference. First operand 39324 states and 129687 transitions. Second operand 5 states. [2019-12-26 23:46:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:24,191 INFO L93 Difference]: Finished difference Result 17735 states and 54519 transitions. [2019-12-26 23:46:24,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:46:24,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:46:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:24,218 INFO L225 Difference]: With dead ends: 17735 [2019-12-26 23:46:24,218 INFO L226 Difference]: Without dead ends: 15148 [2019-12-26 23:46:24,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15148 states. [2019-12-26 23:46:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15148 to 14734. [2019-12-26 23:46:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14734 states. [2019-12-26 23:46:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14734 states to 14734 states and 44987 transitions. [2019-12-26 23:46:24,439 INFO L78 Accepts]: Start accepts. Automaton has 14734 states and 44987 transitions. Word has length 28 [2019-12-26 23:46:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:24,439 INFO L462 AbstractCegarLoop]: Abstraction has 14734 states and 44987 transitions. [2019-12-26 23:46:24,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 14734 states and 44987 transitions. [2019-12-26 23:46:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 23:46:24,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:24,461 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-26 23:46:24,461 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:24,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:24,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1034846780, now seen corresponding path program 1 times [2019-12-26 23:46:24,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:24,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939724920] [2019-12-26 23:46:24,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:24,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939724920] [2019-12-26 23:46:24,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:24,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:24,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455827086] [2019-12-26 23:46:24,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:24,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:24,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:24,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:24,521 INFO L87 Difference]: Start difference. First operand 14734 states and 44987 transitions. Second operand 3 states. [2019-12-26 23:46:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:24,626 INFO L93 Difference]: Finished difference Result 27128 states and 82724 transitions. [2019-12-26 23:46:24,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:24,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 23:46:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:24,649 INFO L225 Difference]: With dead ends: 27128 [2019-12-26 23:46:24,649 INFO L226 Difference]: Without dead ends: 15096 [2019-12-26 23:46:24,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15096 states. [2019-12-26 23:46:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15096 to 14920. [2019-12-26 23:46:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14920 states. [2019-12-26 23:46:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14920 states to 14920 states and 44667 transitions. [2019-12-26 23:46:24,861 INFO L78 Accepts]: Start accepts. Automaton has 14920 states and 44667 transitions. Word has length 39 [2019-12-26 23:46:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:24,861 INFO L462 AbstractCegarLoop]: Abstraction has 14920 states and 44667 transitions. [2019-12-26 23:46:24,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14920 states and 44667 transitions. [2019-12-26 23:46:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:24,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:24,882 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-26 23:46:24,882 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:24,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-26 23:46:24,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:24,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14402000] [2019-12-26 23:46:24,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:24,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14402000] [2019-12-26 23:46:24,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:24,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:46:24,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084115735] [2019-12-26 23:46:24,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:24,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:24,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:24,996 INFO L87 Difference]: Start difference. First operand 14920 states and 44667 transitions. Second operand 6 states. [2019-12-26 23:46:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:25,783 INFO L93 Difference]: Finished difference Result 17908 states and 52567 transitions. [2019-12-26 23:46:25,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:46:25,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:46:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:25,809 INFO L225 Difference]: With dead ends: 17908 [2019-12-26 23:46:25,809 INFO L226 Difference]: Without dead ends: 17740 [2019-12-26 23:46:25,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:46:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17740 states. [2019-12-26 23:46:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17740 to 15076. [2019-12-26 23:46:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15076 states. [2019-12-26 23:46:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15076 states to 15076 states and 45066 transitions. [2019-12-26 23:46:26,044 INFO L78 Accepts]: Start accepts. Automaton has 15076 states and 45066 transitions. Word has length 40 [2019-12-26 23:46:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:26,044 INFO L462 AbstractCegarLoop]: Abstraction has 15076 states and 45066 transitions. [2019-12-26 23:46:26,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 15076 states and 45066 transitions. [2019-12-26 23:46:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:26,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:26,065 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-26 23:46:26,066 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:26,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:26,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2063605447, now seen corresponding path program 1 times [2019-12-26 23:46:26,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:26,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231841975] [2019-12-26 23:46:26,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:26,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231841975] [2019-12-26 23:46:26,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:26,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:46:26,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117979932] [2019-12-26 23:46:26,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:26,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:26,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:26,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:26,125 INFO L87 Difference]: Start difference. First operand 15076 states and 45066 transitions. Second operand 3 states. [2019-12-26 23:46:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:26,231 INFO L93 Difference]: Finished difference Result 18335 states and 53534 transitions. [2019-12-26 23:46:26,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:26,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 23:46:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:26,275 INFO L225 Difference]: With dead ends: 18335 [2019-12-26 23:46:26,275 INFO L226 Difference]: Without dead ends: 18335 [2019-12-26 23:46:26,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18335 states. [2019-12-26 23:46:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18335 to 15651. [2019-12-26 23:46:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15651 states. [2019-12-26 23:46:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15651 states to 15651 states and 46016 transitions. [2019-12-26 23:46:26,662 INFO L78 Accepts]: Start accepts. Automaton has 15651 states and 46016 transitions. Word has length 40 [2019-12-26 23:46:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:26,663 INFO L462 AbstractCegarLoop]: Abstraction has 15651 states and 46016 transitions. [2019-12-26 23:46:26,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 15651 states and 46016 transitions. [2019-12-26 23:46:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:26,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:26,686 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-26 23:46:26,686 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1230367192, now seen corresponding path program 1 times [2019-12-26 23:46:26,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:26,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701817200] [2019-12-26 23:46:26,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:26,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701817200] [2019-12-26 23:46:26,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:26,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:46:26,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355949831] [2019-12-26 23:46:26,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:26,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:26,777 INFO L87 Difference]: Start difference. First operand 15651 states and 46016 transitions. Second operand 5 states. [2019-12-26 23:46:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:27,411 INFO L93 Difference]: Finished difference Result 22891 states and 66789 transitions. [2019-12-26 23:46:27,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:27,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 23:46:27,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:27,464 INFO L225 Difference]: With dead ends: 22891 [2019-12-26 23:46:27,464 INFO L226 Difference]: Without dead ends: 22891 [2019-12-26 23:46:27,465 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-26 23:46:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22891 states. [2019-12-26 23:46:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22891 to 20346. [2019-12-26 23:46:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20346 states. [2019-12-26 23:46:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20346 states to 20346 states and 59890 transitions. [2019-12-26 23:46:27,792 INFO L78 Accepts]: Start accepts. Automaton has 20346 states and 59890 transitions. Word has length 40 [2019-12-26 23:46:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:27,793 INFO L462 AbstractCegarLoop]: Abstraction has 20346 states and 59890 transitions. [2019-12-26 23:46:27,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 20346 states and 59890 transitions. [2019-12-26 23:46:27,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:27,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:27,817 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-26 23:46:27,817 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:27,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:27,818 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 2 times [2019-12-26 23:46:27,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:27,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304766547] [2019-12-26 23:46:27,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:27,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304766547] [2019-12-26 23:46:27,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:27,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:27,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028836269] [2019-12-26 23:46:27,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:27,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:27,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:27,892 INFO L87 Difference]: Start difference. First operand 20346 states and 59890 transitions. Second operand 3 states. [2019-12-26 23:46:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:27,981 INFO L93 Difference]: Finished difference Result 19368 states and 56273 transitions. [2019-12-26 23:46:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:27,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 23:46:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:28,015 INFO L225 Difference]: With dead ends: 19368 [2019-12-26 23:46:28,016 INFO L226 Difference]: Without dead ends: 19368 [2019-12-26 23:46:28,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19368 states. [2019-12-26 23:46:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19368 to 19078. [2019-12-26 23:46:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19078 states. [2019-12-26 23:46:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19078 states to 19078 states and 55546 transitions. [2019-12-26 23:46:28,285 INFO L78 Accepts]: Start accepts. Automaton has 19078 states and 55546 transitions. Word has length 40 [2019-12-26 23:46:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:28,286 INFO L462 AbstractCegarLoop]: Abstraction has 19078 states and 55546 transitions. [2019-12-26 23:46:28,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 19078 states and 55546 transitions. [2019-12-26 23:46:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:46:28,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:28,483 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] [2019-12-26 23:46:28,483 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-26 23:46:28,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:28,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954006285] [2019-12-26 23:46:28,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:28,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954006285] [2019-12-26 23:46:28,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:28,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:46:28,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652063888] [2019-12-26 23:46:28,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:28,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:28,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:28,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:28,590 INFO L87 Difference]: Start difference. First operand 19078 states and 55546 transitions. Second operand 6 states. [2019-12-26 23:46:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:29,276 INFO L93 Difference]: Finished difference Result 22507 states and 64632 transitions. [2019-12-26 23:46:29,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:46:29,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:46:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:29,309 INFO L225 Difference]: With dead ends: 22507 [2019-12-26 23:46:29,309 INFO L226 Difference]: Without dead ends: 22267 [2019-12-26 23:46:29,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:46:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22267 states. [2019-12-26 23:46:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22267 to 18162. [2019-12-26 23:46:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18162 states. [2019-12-26 23:46:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18162 states to 18162 states and 53090 transitions. [2019-12-26 23:46:29,594 INFO L78 Accepts]: Start accepts. Automaton has 18162 states and 53090 transitions. Word has length 41 [2019-12-26 23:46:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:29,594 INFO L462 AbstractCegarLoop]: Abstraction has 18162 states and 53090 transitions. [2019-12-26 23:46:29,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18162 states and 53090 transitions. [2019-12-26 23:46:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:46:29,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:29,614 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] [2019-12-26 23:46:29,614 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash -55018944, now seen corresponding path program 1 times [2019-12-26 23:46:29,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:29,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257907381] [2019-12-26 23:46:29,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:29,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257907381] [2019-12-26 23:46:29,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:29,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:29,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341121152] [2019-12-26 23:46:29,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:29,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:29,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:29,703 INFO L87 Difference]: Start difference. First operand 18162 states and 53090 transitions. Second operand 3 states. [2019-12-26 23:46:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:29,782 INFO L93 Difference]: Finished difference Result 18075 states and 52792 transitions. [2019-12-26 23:46:29,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:29,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-26 23:46:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:29,815 INFO L225 Difference]: With dead ends: 18075 [2019-12-26 23:46:29,815 INFO L226 Difference]: Without dead ends: 18075 [2019-12-26 23:46:29,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18075 states. [2019-12-26 23:46:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18075 to 14877. [2019-12-26 23:46:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14877 states. [2019-12-26 23:46:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14877 states to 14877 states and 43795 transitions. [2019-12-26 23:46:30,082 INFO L78 Accepts]: Start accepts. Automaton has 14877 states and 43795 transitions. Word has length 41 [2019-12-26 23:46:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:30,082 INFO L462 AbstractCegarLoop]: Abstraction has 14877 states and 43795 transitions. [2019-12-26 23:46:30,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 14877 states and 43795 transitions. [2019-12-26 23:46:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 23:46:30,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:30,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:30,098 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash 838446510, now seen corresponding path program 1 times [2019-12-26 23:46:30,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:30,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010466893] [2019-12-26 23:46:30,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:30,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010466893] [2019-12-26 23:46:30,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:30,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:46:30,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90864153] [2019-12-26 23:46:30,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:30,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:30,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:30,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:30,178 INFO L87 Difference]: Start difference. First operand 14877 states and 43795 transitions. Second operand 6 states. [2019-12-26 23:46:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:30,283 INFO L93 Difference]: Finished difference Result 13589 states and 40773 transitions. [2019-12-26 23:46:30,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:30,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-26 23:46:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:30,299 INFO L225 Difference]: With dead ends: 13589 [2019-12-26 23:46:30,299 INFO L226 Difference]: Without dead ends: 11324 [2019-12-26 23:46:30,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11324 states. [2019-12-26 23:46:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11324 to 10896. [2019-12-26 23:46:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10896 states. [2019-12-26 23:46:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10896 states to 10896 states and 33225 transitions. [2019-12-26 23:46:30,471 INFO L78 Accepts]: Start accepts. Automaton has 10896 states and 33225 transitions. Word has length 42 [2019-12-26 23:46:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:30,472 INFO L462 AbstractCegarLoop]: Abstraction has 10896 states and 33225 transitions. [2019-12-26 23:46:30,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 10896 states and 33225 transitions. [2019-12-26 23:46:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:30,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:30,484 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-26 23:46:30,484 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:30,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-26 23:46:30,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:30,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021948266] [2019-12-26 23:46:30,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:30,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021948266] [2019-12-26 23:46:30,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:30,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:46:30,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378071833] [2019-12-26 23:46:30,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:46:30,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:46:30,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:46:30,829 INFO L87 Difference]: Start difference. First operand 10896 states and 33225 transitions. Second operand 11 states. [2019-12-26 23:46:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:32,202 INFO L93 Difference]: Finished difference Result 30494 states and 92765 transitions. [2019-12-26 23:46:32,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 23:46:32,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 23:46:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:32,232 INFO L225 Difference]: With dead ends: 30494 [2019-12-26 23:46:32,232 INFO L226 Difference]: Without dead ends: 20428 [2019-12-26 23:46:32,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 23:46:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20428 states. [2019-12-26 23:46:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20428 to 13201. [2019-12-26 23:46:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13201 states. [2019-12-26 23:46:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13201 states to 13201 states and 39668 transitions. [2019-12-26 23:46:32,625 INFO L78 Accepts]: Start accepts. Automaton has 13201 states and 39668 transitions. Word has length 56 [2019-12-26 23:46:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:32,625 INFO L462 AbstractCegarLoop]: Abstraction has 13201 states and 39668 transitions. [2019-12-26 23:46:32,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:46:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 13201 states and 39668 transitions. [2019-12-26 23:46:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:32,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:32,640 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-26 23:46:32,640 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1822247207, now seen corresponding path program 2 times [2019-12-26 23:46:32,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:32,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426678857] [2019-12-26 23:46:32,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:33,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426678857] [2019-12-26 23:46:33,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:33,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:46:33,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404826124] [2019-12-26 23:46:33,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:46:33,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:46:33,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:46:33,018 INFO L87 Difference]: Start difference. First operand 13201 states and 39668 transitions. Second operand 12 states. [2019-12-26 23:46:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:34,201 INFO L93 Difference]: Finished difference Result 20910 states and 62137 transitions. [2019-12-26 23:46:34,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 23:46:34,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-26 23:46:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:34,240 INFO L225 Difference]: With dead ends: 20910 [2019-12-26 23:46:34,240 INFO L226 Difference]: Without dead ends: 19900 [2019-12-26 23:46:34,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:46:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19900 states. [2019-12-26 23:46:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19900 to 12857. [2019-12-26 23:46:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12857 states. [2019-12-26 23:46:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12857 states to 12857 states and 38718 transitions. [2019-12-26 23:46:34,504 INFO L78 Accepts]: Start accepts. Automaton has 12857 states and 38718 transitions. Word has length 56 [2019-12-26 23:46:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:34,504 INFO L462 AbstractCegarLoop]: Abstraction has 12857 states and 38718 transitions. [2019-12-26 23:46:34,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:46:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 12857 states and 38718 transitions. [2019-12-26 23:46:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:34,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:34,518 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-26 23:46:34,518 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:34,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 3 times [2019-12-26 23:46:34,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:34,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425933276] [2019-12-26 23:46:34,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:34,639 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:46:34,639 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:46:34,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2088~0.base_30|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2088~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2088~0.base_30|) |v_ULTIMATE.start_main_~#t2088~0.offset_22| 0)) |v_#memory_int_23|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2088~0.base_30| 1)) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2088~0.base_30|)) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2088~0.base_30| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= |v_ULTIMATE.start_main_~#t2088~0.offset_22| 0) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, ULTIMATE.start_main_~#t2090~0.base=|v_ULTIMATE.start_main_~#t2090~0.base_23|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ULTIMATE.start_main_~#t2090~0.offset=|v_ULTIMATE.start_main_~#t2090~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2089~0.offset=|v_ULTIMATE.start_main_~#t2089~0.offset_22|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2088~0.base=|v_ULTIMATE.start_main_~#t2088~0.base_30|, ULTIMATE.start_main_~#t2088~0.offset=|v_ULTIMATE.start_main_~#t2088~0.offset_22|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ULTIMATE.start_main_~#t2089~0.base=|v_ULTIMATE.start_main_~#t2089~0.base_31|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2090~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2088~0.base, ULTIMATE.start_main_~#t2088~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2090~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2089~0.offset, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2089~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:46:34,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2089~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2089~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2089~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2089~0.offset_9| 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2089~0.base_10| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2089~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2089~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2089~0.base_10|) |v_ULTIMATE.start_main_~#t2089~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2089~0.offset=|v_ULTIMATE.start_main_~#t2089~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2089~0.base=|v_ULTIMATE.start_main_~#t2089~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2089~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2089~0.base] because there is no mapped edge [2019-12-26 23:46:34,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:46:34,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2090~0.offset_10| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2090~0.base_11| 4) |v_#length_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2090~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2090~0.base_11|) |v_ULTIMATE.start_main_~#t2090~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2090~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2090~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2090~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2090~0.offset=|v_ULTIMATE.start_main_~#t2090~0.offset_10|, ULTIMATE.start_main_~#t2090~0.base=|v_ULTIMATE.start_main_~#t2090~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2090~0.offset, ULTIMATE.start_main_~#t2090~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 23:46:34,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In129771374 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In129771374 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out129771374| ~x$w_buff1~0_In129771374) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out129771374| ~x~0_In129771374) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In129771374, ~x$w_buff1_used~0=~x$w_buff1_used~0_In129771374, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In129771374, ~x~0=~x~0_In129771374} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out129771374|, ~x$w_buff1~0=~x$w_buff1~0_In129771374, ~x$w_buff1_used~0=~x$w_buff1_used~0_In129771374, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In129771374, ~x~0=~x~0_In129771374} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:46:34,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:46:34,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In318620224 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In318620224 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out318620224| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In318620224 |P2Thread1of1ForFork1_#t~ite34_Out318620224|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In318620224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In318620224} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out318620224|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In318620224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In318620224} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:46:34,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In915916830 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In915916830 256)))) (or (and (= ~x$w_buff0_used~0_In915916830 |P1Thread1of1ForFork0_#t~ite28_Out915916830|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out915916830|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In915916830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In915916830} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In915916830, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out915916830|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In915916830} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:46:34,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-627860838 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-627860838 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-627860838 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-627860838 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-627860838| ~x$w_buff1_used~0_In-627860838) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-627860838| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-627860838, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-627860838, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-627860838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-627860838} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-627860838, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-627860838, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-627860838, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-627860838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-627860838} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:46:34,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In878240711 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In878240711 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out878240711 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out878240711 ~x$r_buff0_thd2~0_In878240711) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In878240711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In878240711} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out878240711|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out878240711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In878240711} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:46:34,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1860188097 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1860188097 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1860188097 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1860188097 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1860188097| ~x$r_buff1_thd2~0_In1860188097) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out1860188097| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1860188097, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1860188097, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1860188097, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860188097} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1860188097|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1860188097, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1860188097, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1860188097, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860188097} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:46:34,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 23:46:34,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1671822481 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In-1671822481| |P0Thread1of1ForFork2_#t~ite8_Out-1671822481|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite9_Out-1671822481| ~x$w_buff0~0_In-1671822481)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite9_Out-1671822481| |P0Thread1of1ForFork2_#t~ite8_Out-1671822481|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1671822481 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In-1671822481 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-1671822481 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-1671822481 256) 0))) (= ~x$w_buff0~0_In-1671822481 |P0Thread1of1ForFork2_#t~ite8_Out-1671822481|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1671822481, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1671822481, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1671822481|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1671822481, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1671822481, ~weak$$choice2~0=~weak$$choice2~0_In-1671822481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1671822481} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1671822481, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1671822481, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1671822481|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1671822481, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1671822481|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1671822481, ~weak$$choice2~0=~weak$$choice2~0_In-1671822481, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1671822481} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:46:34,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1706569830 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1706569830 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1706569830 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1706569830 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1706569830| ~x$w_buff1_used~0_In-1706569830) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1706569830| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1706569830, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1706569830, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1706569830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1706569830} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1706569830|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1706569830, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1706569830, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1706569830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1706569830} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:46:34,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-337360071 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-337360071 256)))) (or (and (= ~x$r_buff0_thd3~0_In-337360071 |P2Thread1of1ForFork1_#t~ite36_Out-337360071|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-337360071|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-337360071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-337360071} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-337360071|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-337360071, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-337360071} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:46:34,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In298581420 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In298581420 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In298581420 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In298581420 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out298581420|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In298581420 |P2Thread1of1ForFork1_#t~ite37_Out298581420|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In298581420, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In298581420, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In298581420, ~x$w_buff0_used~0=~x$w_buff0_used~0_In298581420} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out298581420|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In298581420, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In298581420, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In298581420, ~x$w_buff0_used~0=~x$w_buff0_used~0_In298581420} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:46:34,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 23:46:34,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In245030276 256) 0))) (or (and (not .cse0) (= ~x$w_buff1_used~0_In245030276 |P0Thread1of1ForFork2_#t~ite18_Out245030276|) (= |P0Thread1of1ForFork2_#t~ite17_In245030276| |P0Thread1of1ForFork2_#t~ite17_Out245030276|)) (and .cse0 (= ~x$w_buff1_used~0_In245030276 |P0Thread1of1ForFork2_#t~ite17_Out245030276|) (= |P0Thread1of1ForFork2_#t~ite18_Out245030276| |P0Thread1of1ForFork2_#t~ite17_Out245030276|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In245030276 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In245030276 256) 0)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In245030276 256))) (= 0 (mod ~x$w_buff0_used~0_In245030276 256))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In245030276, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In245030276|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In245030276, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In245030276, ~weak$$choice2~0=~weak$$choice2~0_In245030276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In245030276} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In245030276, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out245030276|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out245030276|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In245030276, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In245030276, ~weak$$choice2~0=~weak$$choice2~0_In245030276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In245030276} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:46:34,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:46:34,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1223644201 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1223644201 256)))) (or (= (mod ~x$w_buff0_used~0_In1223644201 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1223644201 256))) (and .cse0 (= (mod ~x$w_buff1_used~0_In1223644201 256) 0)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite24_Out1223644201| |P0Thread1of1ForFork2_#t~ite23_Out1223644201|) (= ~x$r_buff1_thd1~0_In1223644201 |P0Thread1of1ForFork2_#t~ite23_Out1223644201|)) (and (= |P0Thread1of1ForFork2_#t~ite24_Out1223644201| ~x$r_buff1_thd1~0_In1223644201) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In1223644201| |P0Thread1of1ForFork2_#t~ite23_Out1223644201|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1223644201, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1223644201, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1223644201, ~weak$$choice2~0=~weak$$choice2~0_In1223644201, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1223644201|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1223644201} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1223644201, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1223644201, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1223644201, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1223644201|, ~weak$$choice2~0=~weak$$choice2~0_In1223644201, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1223644201|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1223644201} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:46:34,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:46:34,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:46:34,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In975462735 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In975462735 256) 0))) (or (and (= ~x~0_In975462735 |ULTIMATE.start_main_#t~ite41_Out975462735|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out975462735| ~x$w_buff1~0_In975462735) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In975462735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975462735, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975462735, ~x~0=~x~0_In975462735} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out975462735|, ~x$w_buff1~0=~x$w_buff1~0_In975462735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975462735, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975462735, ~x~0=~x~0_In975462735} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:46:34,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 23:46:34,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1522739652 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1522739652 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1522739652| ~x$w_buff0_used~0_In1522739652) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1522739652| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1522739652, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1522739652} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1522739652, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1522739652|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1522739652} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:46:34,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1612659400 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1612659400 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1612659400 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1612659400 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out1612659400|)) (and (= ~x$w_buff1_used~0_In1612659400 |ULTIMATE.start_main_#t~ite44_Out1612659400|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1612659400, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1612659400, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1612659400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1612659400} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1612659400, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1612659400, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1612659400, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1612659400|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1612659400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:46:34,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1477476239 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1477476239 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1477476239| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1477476239| ~x$r_buff0_thd0~0_In-1477476239)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1477476239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1477476239} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1477476239, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1477476239|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1477476239} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:46:34,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2048499369 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2048499369 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In2048499369 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In2048499369 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In2048499369 |ULTIMATE.start_main_#t~ite46_Out2048499369|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out2048499369| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2048499369, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048499369, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2048499369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048499369} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2048499369, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2048499369|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048499369, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2048499369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048499369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:46:34,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:46:34,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:46:34 BasicIcfg [2019-12-26 23:46:34,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:46:34,737 INFO L168 Benchmark]: Toolchain (without parser) took 67107.85 ms. Allocated memory was 142.1 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 98.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 23:46:34,738 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:46:34,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 922.51 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 153.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:34,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.77 ms. Allocated memory is still 199.8 MB. Free memory was 153.8 MB in the beginning and 150.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:34,740 INFO L168 Benchmark]: Boogie Preprocessor took 38.92 ms. Allocated memory is still 199.8 MB. Free memory was 150.8 MB in the beginning and 148.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:34,740 INFO L168 Benchmark]: RCFGBuilder took 861.12 ms. Allocated memory is still 199.8 MB. Free memory was 148.7 MB in the beginning and 102.3 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:34,741 INFO L168 Benchmark]: TraceAbstraction took 65204.42 ms. Allocated memory was 199.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 23:46:34,745 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 922.51 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 153.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.77 ms. Allocated memory is still 199.8 MB. Free memory was 153.8 MB in the beginning and 150.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.92 ms. Allocated memory is still 199.8 MB. Free memory was 150.8 MB in the beginning and 148.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 861.12 ms. Allocated memory is still 199.8 MB. Free memory was 148.7 MB in the beginning and 102.3 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65204.42 ms. Allocated memory was 199.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2088, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2089, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2090, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 64.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3599 SDtfs, 4636 SDslu, 9332 SDs, 0 SdLazy, 4116 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 22 SyntacticMatches, 17 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114218occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 94582 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 129044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...