/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:59:34,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:59:34,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:59:34,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:59:34,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:59:34,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:59:34,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:59:34,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:59:34,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:59:34,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:59:34,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:59:34,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:59:34,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:59:34,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:59:34,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:59:34,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:59:34,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:59:34,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:59:34,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:59:34,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:59:34,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:59:34,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:59:34,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:59:34,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:59:34,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:59:34,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:59:34,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:59:34,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:59:34,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:59:34,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:59:34,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:59:34,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:59:34,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:59:34,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:59:34,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:59:34,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:59:34,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:59:34,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:59:34,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:59:34,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:59:34,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:59:34,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:59:34,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:59:34,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:59:34,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:59:34,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:59:34,375 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:59:34,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:59:34,376 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:59:34,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:59:34,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:59:34,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:59:34,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:59:34,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:59:34,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:59:34,377 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:59:34,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:59:34,378 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:59:34,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:59:34,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:59:34,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:59:34,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:59:34,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:59:34,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:59:34,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:59:34,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:59:34,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:59:34,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:59:34,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:59:34,380 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:59:34,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:59:34,381 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:59:34,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:59:34,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:59:34,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:59:34,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:59:34,686 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:59:34,686 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:59:34,687 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i [2019-12-27 17:59:34,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3f0a80a/18c450dca2694451abca1731658e08e3/FLAGa9065b01f [2019-12-27 17:59:35,306 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:59:35,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i [2019-12-27 17:59:35,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3f0a80a/18c450dca2694451abca1731658e08e3/FLAGa9065b01f [2019-12-27 17:59:35,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3f0a80a/18c450dca2694451abca1731658e08e3 [2019-12-27 17:59:35,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:59:35,620 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:59:35,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:59:35,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:59:35,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:59:35,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:59:35" (1/1) ... [2019-12-27 17:59:35,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5046e964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:35, skipping insertion in model container [2019-12-27 17:59:35,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:59:35" (1/1) ... [2019-12-27 17:59:35,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:59:35,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:59:36,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:59:36,183 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:59:36,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:59:36,323 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:59:36,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36 WrapperNode [2019-12-27 17:59:36,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:59:36,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:59:36,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:59:36,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:59:36,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:59:36,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:59:36,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:59:36,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:59:36,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... [2019-12-27 17:59:36,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:59:36,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:59:36,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:59:36,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:59:36,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:59:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:59:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:59:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:59:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:59:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:59:36,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:59:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:59:36,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:59:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:59:36,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:59:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:59:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:59:36,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:59:36,506 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:59:37,287 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:59:37,287 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:59:37,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:59:37 BoogieIcfgContainer [2019-12-27 17:59:37,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:59:37,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:59:37,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:59:37,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:59:37,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:59:35" (1/3) ... [2019-12-27 17:59:37,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28141513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:59:37, skipping insertion in model container [2019-12-27 17:59:37,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:36" (2/3) ... [2019-12-27 17:59:37,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28141513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:59:37, skipping insertion in model container [2019-12-27 17:59:37,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:59:37" (3/3) ... [2019-12-27 17:59:37,298 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_pso.opt.i [2019-12-27 17:59:37,309 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:59:37,309 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:59:37,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:59:37,324 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:59:37,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,407 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,407 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,407 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,415 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,415 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,455 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,455 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,460 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:37,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:59:37,502 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:59:37,502 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:59:37,502 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:59:37,502 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:59:37,502 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:59:37,502 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:59:37,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:59:37,503 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:59:37,521 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 17:59:37,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 17:59:37,640 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 17:59:37,641 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:59:37,657 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 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:59:37,680 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 17:59:37,749 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 17:59:37,749 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:59:37,759 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 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:59:37,781 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 17:59:37,782 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:59:43,437 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 17:59:43,576 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 17:59:43,596 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-27 17:59:43,596 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 17:59:43,600 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-27 17:59:53,633 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-27 17:59:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-27 17:59:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:59:53,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:59:53,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:59:53,644 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-27 17:59:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:59:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-27 17:59:53,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:59:53,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542937416] [2019-12-27 17:59:53,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:59:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:59:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:59:53,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542937416] [2019-12-27 17:59:53,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:59:53,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:59:53,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279299698] [2019-12-27 17:59:53,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:59:53,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:59:53,955 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:59:53,956 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:59:53,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:59:53,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:59:53,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:59:53,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:59:53,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:59:53,972 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-27 17:59:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:59:55,432 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-27 17:59:55,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:59:55,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:59:55,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:59:55,992 INFO L225 Difference]: With dead ends: 79498 [2019-12-27 17:59:55,992 INFO L226 Difference]: Without dead ends: 74626 [2019-12-27 17:59:55,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-27 18:00:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-27 18:00:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-27 18:00:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-27 18:00:06,200 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-27 18:00:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:06,200 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-27 18:00:06,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:00:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-27 18:00:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:00:06,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:06,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:06,215 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-27 18:00:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-27 18:00:06,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:06,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240061660] [2019-12-27 18:00:06,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:06,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240061660] [2019-12-27 18:00:06,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:06,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:06,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478645793] [2019-12-27 18:00:06,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:06,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:06,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:00:06,371 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:06,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:06,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:00:06,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:06,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:00:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:06,373 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-27 18:00:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:06,585 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-27 18:00:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:06,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:00:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:06,695 INFO L225 Difference]: With dead ends: 19918 [2019-12-27 18:00:06,695 INFO L226 Difference]: Without dead ends: 19918 [2019-12-27 18:00:06,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-27 18:00:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-27 18:00:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-27 18:00:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-27 18:00:07,173 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-27 18:00:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:07,173 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-27 18:00:07,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:00:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-27 18:00:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:00:07,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:07,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:07,175 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-27 18:00:07,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-27 18:00:07,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:07,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919002688] [2019-12-27 18:00:07,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:07,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919002688] [2019-12-27 18:00:07,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:07,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:07,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [530639715] [2019-12-27 18:00:07,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:07,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:07,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:00:07,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:07,292 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:07,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:07,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:07,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:07,293 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-27 18:00:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:07,654 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-27 18:00:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:00:07,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:00:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:07,798 INFO L225 Difference]: With dead ends: 29603 [2019-12-27 18:00:07,798 INFO L226 Difference]: Without dead ends: 29589 [2019-12-27 18:00:07,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-27 18:00:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-27 18:00:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-27 18:00:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-27 18:00:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-27 18:00:10,048 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-27 18:00:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:10,049 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-27 18:00:10,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-27 18:00:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:00:10,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:10,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:10,052 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-27 18:00:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-27 18:00:10,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:10,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604640706] [2019-12-27 18:00:10,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:10,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604640706] [2019-12-27 18:00:10,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:10,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:00:10,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [330520622] [2019-12-27 18:00:10,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:10,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:10,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:00:10,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:10,242 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:00:10,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:00:10,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:00:10,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:00:10,244 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 7 states. [2019-12-27 18:00:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:10,879 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-27 18:00:10,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:00:10,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 18:00:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:10,966 INFO L225 Difference]: With dead ends: 40028 [2019-12-27 18:00:10,966 INFO L226 Difference]: Without dead ends: 40010 [2019-12-27 18:00:10,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:00:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-27 18:00:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-27 18:00:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-27 18:00:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-27 18:00:11,906 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-27 18:00:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:11,907 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-27 18:00:11,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:00:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-27 18:00:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:00:11,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:11,918 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-27 18:00:11,918 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-27 18:00:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-27 18:00:11,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:11,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898529155] [2019-12-27 18:00:11,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:12,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898529155] [2019-12-27 18:00:12,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:12,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:00:12,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251570735] [2019-12-27 18:00:12,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:12,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:12,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 18:00:12,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:12,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:00:12,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:00:12,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:00:12,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:12,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:00:12,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:00:12,292 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 9 states. [2019-12-27 18:00:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:14,753 INFO L93 Difference]: Finished difference Result 91747 states and 301001 transitions. [2019-12-27 18:00:14,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:00:14,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 18:00:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:14,931 INFO L225 Difference]: With dead ends: 91747 [2019-12-27 18:00:14,931 INFO L226 Difference]: Without dead ends: 91710 [2019-12-27 18:00:14,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:00:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91710 states. [2019-12-27 18:00:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91710 to 44228. [2019-12-27 18:00:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44228 states. [2019-12-27 18:00:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44228 states to 44228 states and 147919 transitions. [2019-12-27 18:00:16,531 INFO L78 Accepts]: Start accepts. Automaton has 44228 states and 147919 transitions. Word has length 22 [2019-12-27 18:00:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:16,532 INFO L462 AbstractCegarLoop]: Abstraction has 44228 states and 147919 transitions. [2019-12-27 18:00:16,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:00:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 44228 states and 147919 transitions. [2019-12-27 18:00:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:00:16,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:16,545 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-27 18:00:16,545 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-27 18:00:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1820035389, now seen corresponding path program 2 times [2019-12-27 18:00:16,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:16,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058618527] [2019-12-27 18:00:16,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:16,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058618527] [2019-12-27 18:00:16,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:16,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:00:16,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134013804] [2019-12-27 18:00:16,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:16,682 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:16,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 18:00:16,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:16,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:16,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:00:16,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:00:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:00:16,692 INFO L87 Difference]: Start difference. First operand 44228 states and 147919 transitions. Second operand 6 states. [2019-12-27 18:00:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:17,966 INFO L93 Difference]: Finished difference Result 68472 states and 222810 transitions. [2019-12-27 18:00:17,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:00:17,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:00:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:18,087 INFO L225 Difference]: With dead ends: 68472 [2019-12-27 18:00:18,087 INFO L226 Difference]: Without dead ends: 68442 [2019-12-27 18:00:18,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:00:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68442 states. [2019-12-27 18:00:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68442 to 42219. [2019-12-27 18:00:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42219 states. [2019-12-27 18:00:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42219 states to 42219 states and 141184 transitions. [2019-12-27 18:00:18,969 INFO L78 Accepts]: Start accepts. Automaton has 42219 states and 141184 transitions. Word has length 22 [2019-12-27 18:00:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:18,970 INFO L462 AbstractCegarLoop]: Abstraction has 42219 states and 141184 transitions. [2019-12-27 18:00:18,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:00:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 42219 states and 141184 transitions. [2019-12-27 18:00:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:00:18,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:18,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:18,985 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-27 18:00:18,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:18,985 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-27 18:00:18,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:18,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349111638] [2019-12-27 18:00:18,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:19,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349111638] [2019-12-27 18:00:19,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:19,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:00:19,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65511479] [2019-12-27 18:00:19,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:19,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:19,051 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:00:19,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:19,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:19,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:19,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:19,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:19,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:19,053 INFO L87 Difference]: Start difference. First operand 42219 states and 141184 transitions. Second operand 4 states. [2019-12-27 18:00:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:19,142 INFO L93 Difference]: Finished difference Result 16856 states and 52701 transitions. [2019-12-27 18:00:19,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:00:19,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:00:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:19,169 INFO L225 Difference]: With dead ends: 16856 [2019-12-27 18:00:19,170 INFO L226 Difference]: Without dead ends: 16856 [2019-12-27 18:00:19,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16856 states. [2019-12-27 18:00:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16856 to 16742. [2019-12-27 18:00:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-12-27 18:00:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 52364 transitions. [2019-12-27 18:00:19,647 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 52364 transitions. Word has length 25 [2019-12-27 18:00:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:19,647 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 52364 transitions. [2019-12-27 18:00:19,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 52364 transitions. [2019-12-27 18:00:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:00:19,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:19,671 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-27 18:00:19,671 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-27 18:00:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:19,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-27 18:00:19,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:19,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524455132] [2019-12-27 18:00:19,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:19,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524455132] [2019-12-27 18:00:19,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:19,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:00:19,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481437024] [2019-12-27 18:00:19,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:19,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:19,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 18:00:19,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:19,773 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:19,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:00:19,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:00:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:19,774 INFO L87 Difference]: Start difference. First operand 16742 states and 52364 transitions. Second operand 3 states. [2019-12-27 18:00:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:19,835 INFO L93 Difference]: Finished difference Result 16741 states and 52362 transitions. [2019-12-27 18:00:19,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:19,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 18:00:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:19,860 INFO L225 Difference]: With dead ends: 16741 [2019-12-27 18:00:19,860 INFO L226 Difference]: Without dead ends: 16741 [2019-12-27 18:00:19,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16741 states. [2019-12-27 18:00:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16741 to 16741. [2019-12-27 18:00:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16741 states. [2019-12-27 18:00:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16741 states to 16741 states and 52362 transitions. [2019-12-27 18:00:20,100 INFO L78 Accepts]: Start accepts. Automaton has 16741 states and 52362 transitions. Word has length 39 [2019-12-27 18:00:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:20,100 INFO L462 AbstractCegarLoop]: Abstraction has 16741 states and 52362 transitions. [2019-12-27 18:00:20,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:00:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 16741 states and 52362 transitions. [2019-12-27 18:00:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:00:20,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:20,132 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-27 18:00:20,132 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-27 18:00:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-27 18:00:20,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:20,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687803103] [2019-12-27 18:00:20,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:20,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687803103] [2019-12-27 18:00:20,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:20,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:00:20,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [661038275] [2019-12-27 18:00:20,197 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:20,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:20,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 162 transitions. [2019-12-27 18:00:20,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:20,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:00:20,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:00:20,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:20,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:00:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:00:20,265 INFO L87 Difference]: Start difference. First operand 16741 states and 52362 transitions. Second operand 5 states. [2019-12-27 18:00:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:20,375 INFO L93 Difference]: Finished difference Result 15259 states and 48568 transitions. [2019-12-27 18:00:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:00:20,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 18:00:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:20,408 INFO L225 Difference]: With dead ends: 15259 [2019-12-27 18:00:20,408 INFO L226 Difference]: Without dead ends: 15259 [2019-12-27 18:00:20,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:00:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15259 states. [2019-12-27 18:00:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15259 to 14485. [2019-12-27 18:00:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14485 states. [2019-12-27 18:00:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14485 states to 14485 states and 46365 transitions. [2019-12-27 18:00:20,701 INFO L78 Accepts]: Start accepts. Automaton has 14485 states and 46365 transitions. Word has length 40 [2019-12-27 18:00:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:20,701 INFO L462 AbstractCegarLoop]: Abstraction has 14485 states and 46365 transitions. [2019-12-27 18:00:20,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:00:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 14485 states and 46365 transitions. [2019-12-27 18:00:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:20,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:20,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:20,723 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-27 18:00:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash 166042611, now seen corresponding path program 1 times [2019-12-27 18:00:20,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:20,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774381956] [2019-12-27 18:00:20,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:20,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774381956] [2019-12-27 18:00:20,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:20,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:00:20,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926000038] [2019-12-27 18:00:20,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:20,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:21,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 464 transitions. [2019-12-27 18:00:21,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:21,119 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:00:21,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:21,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:21,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:21,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:21,121 INFO L87 Difference]: Start difference. First operand 14485 states and 46365 transitions. Second operand 4 states. [2019-12-27 18:00:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:21,254 INFO L93 Difference]: Finished difference Result 18807 states and 60047 transitions. [2019-12-27 18:00:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:21,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 18:00:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:21,291 INFO L225 Difference]: With dead ends: 18807 [2019-12-27 18:00:21,291 INFO L226 Difference]: Without dead ends: 18807 [2019-12-27 18:00:21,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2019-12-27 18:00:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 12193. [2019-12-27 18:00:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12193 states. [2019-12-27 18:00:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12193 states to 12193 states and 39155 transitions. [2019-12-27 18:00:21,550 INFO L78 Accepts]: Start accepts. Automaton has 12193 states and 39155 transitions. Word has length 54 [2019-12-27 18:00:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:21,550 INFO L462 AbstractCegarLoop]: Abstraction has 12193 states and 39155 transitions. [2019-12-27 18:00:21,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 12193 states and 39155 transitions. [2019-12-27 18:00:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:21,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:21,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:21,566 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-27 18:00:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2131568022, now seen corresponding path program 1 times [2019-12-27 18:00:21,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:21,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136861029] [2019-12-27 18:00:21,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:21,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136861029] [2019-12-27 18:00:21,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:21,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:21,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507210674] [2019-12-27 18:00:21,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:21,662 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:21,913 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 708 transitions. [2019-12-27 18:00:21,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:21,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:21,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:21,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:21,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:21,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:21,917 INFO L87 Difference]: Start difference. First operand 12193 states and 39155 transitions. Second operand 4 states. [2019-12-27 18:00:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:22,002 INFO L93 Difference]: Finished difference Result 23305 states and 75058 transitions. [2019-12-27 18:00:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:00:22,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 18:00:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:22,020 INFO L225 Difference]: With dead ends: 23305 [2019-12-27 18:00:22,020 INFO L226 Difference]: Without dead ends: 11421 [2019-12-27 18:00:22,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:00:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11421 states. [2019-12-27 18:00:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11421 to 11421. [2019-12-27 18:00:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11421 states. [2019-12-27 18:00:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11421 states to 11421 states and 36793 transitions. [2019-12-27 18:00:22,200 INFO L78 Accepts]: Start accepts. Automaton has 11421 states and 36793 transitions. Word has length 54 [2019-12-27 18:00:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:22,200 INFO L462 AbstractCegarLoop]: Abstraction has 11421 states and 36793 transitions. [2019-12-27 18:00:22,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 11421 states and 36793 transitions. [2019-12-27 18:00:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:22,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:22,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:22,214 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-27 18:00:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash 794798576, now seen corresponding path program 2 times [2019-12-27 18:00:22,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:22,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280397547] [2019-12-27 18:00:22,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:22,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280397547] [2019-12-27 18:00:22,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:22,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:00:22,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297746407] [2019-12-27 18:00:22,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:22,307 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:22,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 622 transitions. [2019-12-27 18:00:22,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:22,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:00:22,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:00:22,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:22,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:00:22,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:00:22,623 INFO L87 Difference]: Start difference. First operand 11421 states and 36793 transitions. Second operand 6 states. [2019-12-27 18:00:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:22,787 INFO L93 Difference]: Finished difference Result 32357 states and 104808 transitions. [2019-12-27 18:00:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:00:22,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 18:00:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:22,798 INFO L225 Difference]: With dead ends: 32357 [2019-12-27 18:00:22,799 INFO L226 Difference]: Without dead ends: 6706 [2019-12-27 18:00:22,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:00:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2019-12-27 18:00:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 6706. [2019-12-27 18:00:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-12-27 18:00:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 21776 transitions. [2019-12-27 18:00:22,909 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 21776 transitions. Word has length 54 [2019-12-27 18:00:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:22,910 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 21776 transitions. [2019-12-27 18:00:22,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:00:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 21776 transitions. [2019-12-27 18:00:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:22,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:22,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:22,918 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-27 18:00:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 370181420, now seen corresponding path program 3 times [2019-12-27 18:00:22,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:22,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195217610] [2019-12-27 18:00:22,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:23,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195217610] [2019-12-27 18:00:23,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:23,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:00:23,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074766043] [2019-12-27 18:00:23,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:23,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:23,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 425 transitions. [2019-12-27 18:00:23,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:23,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 18:00:23,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:00:23,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:23,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:00:23,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:00:23,324 INFO L87 Difference]: Start difference. First operand 6706 states and 21776 transitions. Second operand 8 states. [2019-12-27 18:00:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:23,600 INFO L93 Difference]: Finished difference Result 11218 states and 36364 transitions. [2019-12-27 18:00:23,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 18:00:23,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 18:00:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:23,615 INFO L225 Difference]: With dead ends: 11218 [2019-12-27 18:00:23,615 INFO L226 Difference]: Without dead ends: 8640 [2019-12-27 18:00:23,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:00:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8640 states. [2019-12-27 18:00:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8640 to 7875. [2019-12-27 18:00:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7875 states. [2019-12-27 18:00:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 25651 transitions. [2019-12-27 18:00:23,751 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 25651 transitions. Word has length 54 [2019-12-27 18:00:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:23,751 INFO L462 AbstractCegarLoop]: Abstraction has 7875 states and 25651 transitions. [2019-12-27 18:00:23,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:00:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 25651 transitions. [2019-12-27 18:00:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:23,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:23,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:23,761 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-27 18:00:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1876082156, now seen corresponding path program 4 times [2019-12-27 18:00:23,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:23,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288518576] [2019-12-27 18:00:23,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:23,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288518576] [2019-12-27 18:00:23,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:23,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:00:23,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264799863] [2019-12-27 18:00:23,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:23,871 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:24,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 464 transitions. [2019-12-27 18:00:24,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:24,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:00:24,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:00:24,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:00:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:00:24,184 INFO L87 Difference]: Start difference. First operand 7875 states and 25651 transitions. Second operand 11 states. [2019-12-27 18:00:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:25,648 INFO L93 Difference]: Finished difference Result 17223 states and 55210 transitions. [2019-12-27 18:00:25,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:00:25,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 18:00:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:25,672 INFO L225 Difference]: With dead ends: 17223 [2019-12-27 18:00:25,672 INFO L226 Difference]: Without dead ends: 12726 [2019-12-27 18:00:25,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:00:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12726 states. [2019-12-27 18:00:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12726 to 9350. [2019-12-27 18:00:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9350 states. [2019-12-27 18:00:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9350 states to 9350 states and 30217 transitions. [2019-12-27 18:00:25,850 INFO L78 Accepts]: Start accepts. Automaton has 9350 states and 30217 transitions. Word has length 54 [2019-12-27 18:00:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:25,850 INFO L462 AbstractCegarLoop]: Abstraction has 9350 states and 30217 transitions. [2019-12-27 18:00:25,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:00:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 9350 states and 30217 transitions. [2019-12-27 18:00:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:25,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:25,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:25,863 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-27 18:00:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1222512202, now seen corresponding path program 5 times [2019-12-27 18:00:25,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:25,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254011109] [2019-12-27 18:00:25,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:25,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254011109] [2019-12-27 18:00:25,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:25,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:00:25,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965445753] [2019-12-27 18:00:25,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:25,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:26,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 358 transitions. [2019-12-27 18:00:26,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:26,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:00:26,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:00:26,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:26,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:00:26,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:00:26,354 INFO L87 Difference]: Start difference. First operand 9350 states and 30217 transitions. Second operand 9 states. [2019-12-27 18:00:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:27,596 INFO L93 Difference]: Finished difference Result 29122 states and 91916 transitions. [2019-12-27 18:00:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 18:00:27,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 18:00:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:27,631 INFO L225 Difference]: With dead ends: 29122 [2019-12-27 18:00:27,632 INFO L226 Difference]: Without dead ends: 22614 [2019-12-27 18:00:27,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:00:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22614 states. [2019-12-27 18:00:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22614 to 10979. [2019-12-27 18:00:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10979 states. [2019-12-27 18:00:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10979 states to 10979 states and 35385 transitions. [2019-12-27 18:00:27,898 INFO L78 Accepts]: Start accepts. Automaton has 10979 states and 35385 transitions. Word has length 54 [2019-12-27 18:00:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:27,898 INFO L462 AbstractCegarLoop]: Abstraction has 10979 states and 35385 transitions. [2019-12-27 18:00:27,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:00:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 10979 states and 35385 transitions. [2019-12-27 18:00:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:27,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:27,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:27,911 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-27 18:00:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1952183562, now seen corresponding path program 6 times [2019-12-27 18:00:27,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:27,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790538495] [2019-12-27 18:00:27,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:28,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790538495] [2019-12-27 18:00:28,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:28,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:28,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22918330] [2019-12-27 18:00:28,001 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:28,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:28,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 403 transitions. [2019-12-27 18:00:28,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:28,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:00:28,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:28,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:28,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:28,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:28,262 INFO L87 Difference]: Start difference. First operand 10979 states and 35385 transitions. Second operand 4 states. [2019-12-27 18:00:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:28,503 INFO L93 Difference]: Finished difference Result 14130 states and 43827 transitions. [2019-12-27 18:00:28,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:00:28,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 18:00:28,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:28,526 INFO L225 Difference]: With dead ends: 14130 [2019-12-27 18:00:28,526 INFO L226 Difference]: Without dead ends: 14130 [2019-12-27 18:00:28,527 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-27 18:00:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14130 states. [2019-12-27 18:00:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14130 to 9254. [2019-12-27 18:00:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9254 states. [2019-12-27 18:00:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9254 states to 9254 states and 28955 transitions. [2019-12-27 18:00:28,702 INFO L78 Accepts]: Start accepts. Automaton has 9254 states and 28955 transitions. Word has length 54 [2019-12-27 18:00:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:28,703 INFO L462 AbstractCegarLoop]: Abstraction has 9254 states and 28955 transitions. [2019-12-27 18:00:28,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9254 states and 28955 transitions. [2019-12-27 18:00:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:00:28,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:28,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:28,713 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-27 18:00:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1490833915, now seen corresponding path program 1 times [2019-12-27 18:00:28,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:28,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298845155] [2019-12-27 18:00:28,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:28,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-27 18:00:28,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298845155] [2019-12-27 18:00:28,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:28,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:28,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075399075] [2019-12-27 18:00:28,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:28,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:29,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 414 transitions. [2019-12-27 18:00:29,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:29,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:29,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:00:29,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:29,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:00:29,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:29,038 INFO L87 Difference]: Start difference. First operand 9254 states and 28955 transitions. Second operand 3 states. [2019-12-27 18:00:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:29,087 INFO L93 Difference]: Finished difference Result 9254 states and 28953 transitions. [2019-12-27 18:00:29,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:29,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 18:00:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:29,105 INFO L225 Difference]: With dead ends: 9254 [2019-12-27 18:00:29,105 INFO L226 Difference]: Without dead ends: 9254 [2019-12-27 18:00:29,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9254 states. [2019-12-27 18:00:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9254 to 8934. [2019-12-27 18:00:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-27 18:00:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 28084 transitions. [2019-12-27 18:00:29,252 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 28084 transitions. Word has length 55 [2019-12-27 18:00:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:29,252 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 28084 transitions. [2019-12-27 18:00:29,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:00:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 28084 transitions. [2019-12-27 18:00:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:00:29,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:29,263 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-27 18:00:29,263 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-27 18:00:29,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:29,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 1 times [2019-12-27 18:00:29,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:29,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783912962] [2019-12-27 18:00:29,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:29,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783912962] [2019-12-27 18:00:29,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:29,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:00:29,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2008987107] [2019-12-27 18:00:29,667 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:29,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:29,901 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 415 transitions. [2019-12-27 18:00:29,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:30,326 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:00:30,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:00:30,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:30,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:00:30,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:00:30,327 INFO L87 Difference]: Start difference. First operand 8934 states and 28084 transitions. Second operand 20 states. [2019-12-27 18:00:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:33,598 INFO L93 Difference]: Finished difference Result 17285 states and 53781 transitions. [2019-12-27 18:00:33,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 18:00:33,599 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-27 18:00:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:33,616 INFO L225 Difference]: With dead ends: 17285 [2019-12-27 18:00:33,616 INFO L226 Difference]: Without dead ends: 11646 [2019-12-27 18:00:33,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 18:00:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11646 states. [2019-12-27 18:00:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11646 to 9596. [2019-12-27 18:00:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9596 states. [2019-12-27 18:00:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9596 states to 9596 states and 29701 transitions. [2019-12-27 18:00:33,779 INFO L78 Accepts]: Start accepts. Automaton has 9596 states and 29701 transitions. Word has length 56 [2019-12-27 18:00:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:33,779 INFO L462 AbstractCegarLoop]: Abstraction has 9596 states and 29701 transitions. [2019-12-27 18:00:33,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:00:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 9596 states and 29701 transitions. [2019-12-27 18:00:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:00:33,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:33,790 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-27 18:00:33,790 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-27 18:00:33,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1558253649, now seen corresponding path program 2 times [2019-12-27 18:00:33,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:33,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599787487] [2019-12-27 18:00:33,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:34,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599787487] [2019-12-27 18:00:34,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:34,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 18:00:34,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [479861632] [2019-12-27 18:00:34,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:34,451 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:34,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 428 transitions. [2019-12-27 18:00:34,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:35,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 18:00:35,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 18:00:35,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:35,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 18:00:35,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:00:35,647 INFO L87 Difference]: Start difference. First operand 9596 states and 29701 transitions. Second operand 28 states. [2019-12-27 18:00:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:42,325 INFO L93 Difference]: Finished difference Result 20150 states and 60467 transitions. [2019-12-27 18:00:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 18:00:42,325 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-12-27 18:00:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:42,351 INFO L225 Difference]: With dead ends: 20150 [2019-12-27 18:00:42,352 INFO L226 Difference]: Without dead ends: 17353 [2019-12-27 18:00:42,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=718, Invalid=4252, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 18:00:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17353 states. [2019-12-27 18:00:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17353 to 11347. [2019-12-27 18:00:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-27 18:00:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 34554 transitions. [2019-12-27 18:00:42,572 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 34554 transitions. Word has length 56 [2019-12-27 18:00:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:42,572 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 34554 transitions. [2019-12-27 18:00:42,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 18:00:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 34554 transitions. [2019-12-27 18:00:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:00:42,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:42,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:42,585 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-27 18:00:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -672202313, now seen corresponding path program 3 times [2019-12-27 18:00:42,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:42,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341348782] [2019-12-27 18:00:42,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:43,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341348782] [2019-12-27 18:00:43,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:43,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 18:00:43,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [946702517] [2019-12-27 18:00:43,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:43,258 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:43,486 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 237 states and 476 transitions. [2019-12-27 18:00:43,486 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:44,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 43 times. [2019-12-27 18:00:44,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 18:00:44,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:44,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 18:00:44,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:00:44,541 INFO L87 Difference]: Start difference. First operand 11347 states and 34554 transitions. Second operand 30 states. [2019-12-27 18:00:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:50,595 INFO L93 Difference]: Finished difference Result 18447 states and 55287 transitions. [2019-12-27 18:00:50,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 18:00:50,595 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-12-27 18:00:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:50,622 INFO L225 Difference]: With dead ends: 18447 [2019-12-27 18:00:50,622 INFO L226 Difference]: Without dead ends: 17644 [2019-12-27 18:00:50,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 18 SyntacticMatches, 16 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=705, Invalid=3851, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 18:00:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17644 states. [2019-12-27 18:00:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17644 to 11381. [2019-12-27 18:00:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11381 states. [2019-12-27 18:00:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11381 states to 11381 states and 34639 transitions. [2019-12-27 18:00:50,844 INFO L78 Accepts]: Start accepts. Automaton has 11381 states and 34639 transitions. Word has length 56 [2019-12-27 18:00:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:50,844 INFO L462 AbstractCegarLoop]: Abstraction has 11381 states and 34639 transitions. [2019-12-27 18:00:50,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 18:00:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 11381 states and 34639 transitions. [2019-12-27 18:00:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:00:50,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:50,857 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-27 18:00:50,857 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-27 18:00:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1927034469, now seen corresponding path program 4 times [2019-12-27 18:00:50,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:50,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64232266] [2019-12-27 18:00:50,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:51,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64232266] [2019-12-27 18:00:51,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:51,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:00:51,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275911482] [2019-12-27 18:00:51,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:51,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:51,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 442 transitions. [2019-12-27 18:00:51,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:52,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 18:00:52,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:00:52,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:00:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:00:52,185 INFO L87 Difference]: Start difference. First operand 11381 states and 34639 transitions. Second operand 22 states. [2019-12-27 18:00:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:58,021 INFO L93 Difference]: Finished difference Result 24530 states and 74033 transitions. [2019-12-27 18:00:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 18:00:58,022 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-12-27 18:00:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:58,054 INFO L225 Difference]: With dead ends: 24530 [2019-12-27 18:00:58,054 INFO L226 Difference]: Without dead ends: 22037 [2019-12-27 18:00:58,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=551, Invalid=3109, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 18:00:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22037 states. [2019-12-27 18:00:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22037 to 11005. [2019-12-27 18:00:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11005 states. [2019-12-27 18:00:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11005 states to 11005 states and 33577 transitions. [2019-12-27 18:00:58,299 INFO L78 Accepts]: Start accepts. Automaton has 11005 states and 33577 transitions. Word has length 56 [2019-12-27 18:00:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:58,300 INFO L462 AbstractCegarLoop]: Abstraction has 11005 states and 33577 transitions. [2019-12-27 18:00:58,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:00:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 11005 states and 33577 transitions. [2019-12-27 18:00:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:00:58,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:58,314 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-27 18:00:58,314 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash -207244209, now seen corresponding path program 5 times [2019-12-27 18:00:58,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:58,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832810468] [2019-12-27 18:00:58,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:58,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832810468] [2019-12-27 18:00:58,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:58,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:00:58,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [268037567] [2019-12-27 18:00:58,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:58,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:58,737 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 387 transitions. [2019-12-27 18:00:58,737 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:59,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 18:00:59,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:00:59,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:59,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:00:59,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:00:59,065 INFO L87 Difference]: Start difference. First operand 11005 states and 33577 transitions. Second operand 19 states. [2019-12-27 18:01:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:01:04,234 INFO L93 Difference]: Finished difference Result 27806 states and 84308 transitions. [2019-12-27 18:01:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 18:01:04,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-27 18:01:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:01:04,263 INFO L225 Difference]: With dead ends: 27806 [2019-12-27 18:01:04,263 INFO L226 Difference]: Without dead ends: 19394 [2019-12-27 18:01:04,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=513, Invalid=3147, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 18:01:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19394 states. [2019-12-27 18:01:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19394 to 11838. [2019-12-27 18:01:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11838 states. [2019-12-27 18:01:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11838 states to 11838 states and 35865 transitions. [2019-12-27 18:01:04,499 INFO L78 Accepts]: Start accepts. Automaton has 11838 states and 35865 transitions. Word has length 56 [2019-12-27 18:01:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:01:04,500 INFO L462 AbstractCegarLoop]: Abstraction has 11838 states and 35865 transitions. [2019-12-27 18:01:04,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:01:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 11838 states and 35865 transitions. [2019-12-27 18:01:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:01:04,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:01:04,512 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-27 18:01:04,513 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:01:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:01:04,513 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 6 times [2019-12-27 18:01:04,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:01:04,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514603371] [2019-12-27 18:01:04,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:01:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:01:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:01:04,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:01:04,615 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:01:04,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1834~0.base_39| 1)) (= 0 v_~__unbuffered_p0_EAX~0_82) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1834~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1834~0.base_39|) |v_ULTIMATE.start_main_~#t1834~0.offset_25| 0)) |v_#memory_int_21|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1834~0.base_39| 4)) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1834~0.base_39|) 0) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t1834~0.offset_25|) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1834~0.base_39|) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_~#t1835~0.offset=|v_ULTIMATE.start_main_~#t1835~0.offset_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1835~0.base=|v_ULTIMATE.start_main_~#t1835~0.base_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ULTIMATE.start_main_~#t1834~0.base=|v_ULTIMATE.start_main_~#t1834~0.base_39|, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1836~0.offset=|v_ULTIMATE.start_main_~#t1836~0.offset_16|, ~x~0=v_~x~0_186, ULTIMATE.start_main_~#t1834~0.offset=|v_ULTIMATE.start_main_~#t1834~0.offset_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ULTIMATE.start_main_~#t1836~0.base=|v_ULTIMATE.start_main_~#t1836~0.base_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t1834~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t1836~0.base, ~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, ULTIMATE.start_main_~#t1835~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1835~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1834~0.base, ~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, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1836~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:01:04,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1835~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1835~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1835~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1835~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1835~0.base_10|) |v_ULTIMATE.start_main_~#t1835~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1835~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1835~0.base_10| 4)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1835~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1835~0.offset=|v_ULTIMATE.start_main_~#t1835~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1835~0.base=|v_ULTIMATE.start_main_~#t1835~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1835~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1835~0.base] because there is no mapped edge [2019-12-27 18:01:04,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t1836~0.offset_9| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1836~0.base_10|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1836~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1836~0.base_10|) |v_ULTIMATE.start_main_~#t1836~0.offset_9| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1836~0.base_10| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1836~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1836~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1836~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1836~0.base=|v_ULTIMATE.start_main_~#t1836~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1836~0.offset=|v_ULTIMATE.start_main_~#t1836~0.offset_9|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1836~0.base, #length, ULTIMATE.start_main_~#t1836~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 18:01:04,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:01:04,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-901841187 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-901841187 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-901841187 |P2Thread1of1ForFork1_#t~ite32_Out-901841187|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-901841187| ~x$w_buff1~0_In-901841187) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-901841187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-901841187, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-901841187, ~x~0=~x~0_In-901841187} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-901841187|, ~x$w_buff1~0=~x$w_buff1~0_In-901841187, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-901841187, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-901841187, ~x~0=~x~0_In-901841187} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:01:04,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1282967743 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1282967743 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1282967743|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1282967743 |P1Thread1of1ForFork0_#t~ite28_Out1282967743|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1282967743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282967743} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1282967743, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1282967743|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282967743} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:01:04,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:01:04,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-527044027 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-527044027 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-527044027|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-527044027 |P2Thread1of1ForFork1_#t~ite34_Out-527044027|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-527044027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-527044027} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-527044027|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-527044027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-527044027} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:01:04,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-39396283 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-39396283 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-39396283 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-39396283 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-39396283| ~x$w_buff1_used~0_In-39396283) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-39396283| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-39396283, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-39396283, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-39396283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-39396283} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-39396283, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-39396283, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-39396283, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-39396283|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-39396283} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:01:04,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1763363276 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1763363276 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1763363276)) (and (= ~x$r_buff0_thd2~0_In-1763363276 ~x$r_buff0_thd2~0_Out-1763363276) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1763363276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1763363276} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1763363276|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1763363276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1763363276} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:01:04,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-187016769 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-187016769 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-187016769 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-187016769 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-187016769|)) (and (= ~x$r_buff1_thd2~0_In-187016769 |P1Thread1of1ForFork0_#t~ite31_Out-187016769|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-187016769, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-187016769, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-187016769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-187016769} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-187016769|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-187016769, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-187016769, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-187016769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-187016769} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:01:04,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_46|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_45|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, 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-27 18:01:04,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1453961595 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1453961595 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In1453961595 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1453961595 256) 0))) (or (and (= ~x$w_buff1_used~0_In1453961595 |P2Thread1of1ForFork1_#t~ite35_Out1453961595|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1453961595|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1453961595, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1453961595, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1453961595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453961595} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1453961595|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1453961595, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1453961595, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1453961595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453961595} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:01:04,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-236225299 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-236225299 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-236225299|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-236225299 |P2Thread1of1ForFork1_#t~ite36_Out-236225299|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-236225299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-236225299} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-236225299|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-236225299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-236225299} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:01:04,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In439999874 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out439999874| ~x$w_buff1~0_In439999874) (= |P0Thread1of1ForFork2_#t~ite11_In439999874| |P0Thread1of1ForFork2_#t~ite11_Out439999874|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out439999874| |P0Thread1of1ForFork2_#t~ite11_Out439999874|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In439999874 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In439999874 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In439999874 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In439999874 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite11_Out439999874| ~x$w_buff1~0_In439999874)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In439999874, ~x$w_buff1~0=~x$w_buff1~0_In439999874, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439999874, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In439999874, ~weak$$choice2~0=~weak$$choice2~0_In439999874, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In439999874|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439999874} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In439999874, ~x$w_buff1~0=~x$w_buff1~0_In439999874, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439999874, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In439999874, ~weak$$choice2~0=~weak$$choice2~0_In439999874, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out439999874|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out439999874|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439999874} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 18:01:04,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1488398203 256) 0))) (or (and .cse0 (= ~x$w_buff0_used~0_In1488398203 |P0Thread1of1ForFork2_#t~ite14_Out1488398203|) (= |P0Thread1of1ForFork2_#t~ite15_Out1488398203| |P0Thread1of1ForFork2_#t~ite14_Out1488398203|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1488398203 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1488398203 256)) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In1488398203 256) 0)) (= (mod ~x$w_buff0_used~0_In1488398203 256) 0)))) (and (= |P0Thread1of1ForFork2_#t~ite15_Out1488398203| ~x$w_buff0_used~0_In1488398203) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1488398203| |P0Thread1of1ForFork2_#t~ite14_Out1488398203|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1488398203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1488398203, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1488398203, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1488398203|, ~weak$$choice2~0=~weak$$choice2~0_In1488398203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1488398203} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1488398203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1488398203, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1488398203|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1488398203, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1488398203|, ~weak$$choice2~0=~weak$$choice2~0_In1488398203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1488398203} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:01:04,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:01:04,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1942603826 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out1942603826| |P0Thread1of1ForFork2_#t~ite24_Out1942603826|) (= ~x$r_buff1_thd1~0_In1942603826 |P0Thread1of1ForFork2_#t~ite23_Out1942603826|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1942603826 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1942603826 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In1942603826 256) 0)) (= (mod ~x$w_buff0_used~0_In1942603826 256) 0)))) (and (not .cse0) (= ~x$r_buff1_thd1~0_In1942603826 |P0Thread1of1ForFork2_#t~ite24_Out1942603826|) (= |P0Thread1of1ForFork2_#t~ite23_In1942603826| |P0Thread1of1ForFork2_#t~ite23_Out1942603826|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1942603826, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1942603826, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1942603826, ~weak$$choice2~0=~weak$$choice2~0_In1942603826, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1942603826|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1942603826} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1942603826, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1942603826, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1942603826, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1942603826|, ~weak$$choice2~0=~weak$$choice2~0_In1942603826, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1942603826|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1942603826} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 18:01:04,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:01:04,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1219196640 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1219196640 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1219196640 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1219196640 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In1219196640 |P2Thread1of1ForFork1_#t~ite37_Out1219196640|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1219196640|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1219196640, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1219196640, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1219196640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1219196640} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1219196640|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1219196640, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1219196640, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1219196640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1219196640} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:01:04,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_32|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, 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-27 18:01:04,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:01:04,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out1754538659| |ULTIMATE.start_main_#t~ite42_Out1754538659|)) (.cse1 (= (mod ~x$w_buff1_used~0_In1754538659 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1754538659 256)))) (or (and .cse0 (not .cse1) (= ~x$w_buff1~0_In1754538659 |ULTIMATE.start_main_#t~ite41_Out1754538659|) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out1754538659| ~x~0_In1754538659) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1754538659, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1754538659, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1754538659, ~x~0=~x~0_In1754538659} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1754538659|, ~x$w_buff1~0=~x$w_buff1~0_In1754538659, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1754538659, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1754538659, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1754538659|, ~x~0=~x~0_In1754538659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 18:01:04,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1383595819 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1383595819 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1383595819 |ULTIMATE.start_main_#t~ite43_Out1383595819|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1383595819|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1383595819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1383595819} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1383595819, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1383595819|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1383595819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:01:04,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In2136874859 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2136874859 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In2136874859 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In2136874859 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out2136874859|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In2136874859 |ULTIMATE.start_main_#t~ite44_Out2136874859|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2136874859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2136874859, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2136874859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136874859} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2136874859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2136874859, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2136874859, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2136874859|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136874859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:01:04,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-999425425 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-999425425 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-999425425| ~x$r_buff0_thd0~0_In-999425425)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-999425425|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-999425425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-999425425} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-999425425, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-999425425|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-999425425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:01:04,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1440104307 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1440104307 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1440104307 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1440104307 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1440104307|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1440104307| ~x$r_buff1_thd0~0_In-1440104307) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1440104307, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440104307, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1440104307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440104307} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1440104307, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1440104307|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1440104307, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1440104307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1440104307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:01:04,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~main$tmp_guard1~0_24 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, 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-27 18:01:04,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:01:04 BasicIcfg [2019-12-27 18:01:04,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:01:04,736 INFO L168 Benchmark]: Toolchain (without parser) took 89116.47 ms. Allocated memory was 136.8 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 99.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 18:01:04,737 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 18:01:04,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.33 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 154.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:01:04,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.21 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:01:04,741 INFO L168 Benchmark]: Boogie Preprocessor took 49.27 ms. Allocated memory is still 200.8 MB. Free memory was 151.7 MB in the beginning and 149.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:01:04,742 INFO L168 Benchmark]: RCFGBuilder took 848.30 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 102.9 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:01:04,742 INFO L168 Benchmark]: TraceAbstraction took 87444.32 ms. Allocated memory was 200.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 102.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 968.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:01:04,749 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.19 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 701.33 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 154.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.21 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.27 ms. Allocated memory is still 200.8 MB. Free memory was 151.7 MB in the beginning and 149.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.30 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 102.9 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87444.32 ms. Allocated memory was 200.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 102.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 968.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1834, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L818] FCALL, FORK 0 pthread_create(&t1835, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] 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_p0_EBX=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] [L820] FCALL, FORK 0 pthread_create(&t1836, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2] [L793] 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_p0_EBX=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=2] [L773] 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 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] 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=2, __unbuffered_p0_EBX=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=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=2] [L737] 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) [L775] 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 [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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 : (!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))=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=2] [L738] 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)) [L739] 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)) [L740] 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)) [L741] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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_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))=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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: 87.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4275 SDtfs, 8023 SDslu, 18451 SDs, 0 SdLazy, 21370 SolverSat, 712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 113 SyntacticMatches, 89 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5261 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 146510 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 884 ConstructedInterpolants, 0 QuantifiedInterpolants, 235549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...